Fetching the paper…
Reading the bibliography…
Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models.
Optimal binary identification procedures
Michael R Garey · 1972
Earlier work this paper cites.
Constructing optimal binary decision trees is NP-complete
Laurent Hyafil and Ronald L Rivest · 1976
Earlier work this paper cites.
Classification and regression trees
Leo Breiman, JH Friedman, RA Olshen, and CJ Stone · 1984
Earlier work this paper cites.
Multi-interval discretization of continuous-valued attributes for classification learning
Usama M. Fayyad and Keki B. Irani · 1993
Earlier work this paper cites.
C4.5: Programs for Machine Learning
Ross Quinlan · 1993
Earlier work this paper cites.
Scalable algorithms for association mining
Mohammed Javeed Zaki · 2000
Earlier work this paper cites.
Fast vertical mining using diffsets
Mohammed J Zaki and Karam Gouda · 2003
Earlier work this paper cites.
Classification and regression via integer optimization
Dimitris Bertsimas and Romy Shioda · 2007
Earlier work this paper cites.
Mining optimal decision trees from itemset lattices
Siegfried Nijssen and Elisa Fromont · 2007
Earlier work this paper cites.
Minimising decision tree size as combinatorial optimisation
Christian Bessiere, Emmanuel Hebrard, and Barry O’Sullivan · 2009
Earlier work this paper cites.
Cluster-grouping: from subgroup discovery to clustering
Albrecht Zimmermann and Luc De Raedt · 2009
Earlier work this paper cites.
Discrimination aware decision tree learning
Faisal Kamiran, Toon Calders, and Mykola Pechenizkiy · 2010
Earlier work this paper cites.
Optimal constraint-based decision tree induction from itemset lattices
Siegfried Nijssen and Elisa Fromont · 2010
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Earlier work this paper cites.
Deep neural decision forests
Peter Kontschieder, Madalina Fiterau, Antonio Criminisi, and Samuel Rota Bulo · 2015
Earlier work this paper cites.
Learning certifiably optimal rule lists for categorical data
Elaine Angelino, Nicholas Larus-Stone, Daniel Alabi, Margo Seltzer, and Cynthia Rudin · 2017
Cited alongside, same era.
Optimal classification trees
Dimitris Bertsimas and Jack Dunn · 2017
Cited alongside, same era.
Learning decision trees with flexible constraints and objectives using integer optimization
Sicco Verwer and Yingqian Zhang · 2017
Cited alongside, same era.
Verifiable reinforcement learning via policy extraction
Osbert Bastani, Yewen Pu, and Armando Solar-Lezama · 2018
Cited alongside, same era.
Learning optimal decision trees with SAT
Nina Narodytska, Alexey Ignatiev, Filipe Pereira, and Joao Marques-Silva · 2018
Cited alongside, same era.
Learning optimal and fair decision trees for non-discriminative decision-making
Sina Aghaei, Mohammad Javad Azizi, and Phebe Vayanos · 2019
Efficient inference of optimal decision trees
Florent Avellaneda · 2020
Closest in time.
Provable guarantees for decision tree induction: the agnostic setting
Guy Blanc, Jane Lange, and Li-Yang Tan · 2020
Closest in time.
Sparsity in optimal randomized classification trees
Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, and Dolores Romero Morales · 2020
Closest in time.
Decision trees for decision-making under the predict-then-optimize framework
Adam N Elmachtoub, Jason Cheuk Nam Liang, and Ryan McNellis · 2020
Closest in time.
Learning optimal decision trees with maxsat and its integration in adaboost
Hao Hu, Mohamed Siala, Emmanuel Hebrard, and Marie-José Huguet · 2020
Closest in time.
Sat-based encodings for optimal decision trees with explicit paths
Mikoláš Janota and António Morgado · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
End-to-end learning of decision trees and forests
Thomas M Hehn, Julian FP Kooij, and Fred A Hamprecht · 2019
Cited alongside, same era.
Optimal sparse decision trees
Xiyang Hu, Cynthia Rudin, and Margo Seltzer · 2019
Cited alongside, same era.
Adaptive neural trees
Ryutaro Tanno, Kai Arulkumaran, Daniel Alexander, Antonio Criminisi, and Aditya Nori · 2019
Cited alongside, same era.
Learning optimal decision trees using constraint programming
Hélene Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, and Pierre Schaus · 2019
Cited alongside, same era.
Learning optimal classification trees using a binary linear program formulation
Sicco Verwer and Yingqian Zhang · 2019
Cited alongside, same era.
Weighted oblique decision trees
Bin-Bin Yang, Song-Qing Shen, and Wei Gao · 2019
Cited alongside, same era.
Package ‘discretization’ in cran-r
HyunJi Kim · 2020
Closest in time.
Generalized and scalable optimal sparse decision trees
Jimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin, and Margo Seltzer · 2020
Closest in time.
Born-again tree ensembles
Thibaut Vidal and Maximilian Schiffer · 2020
Closest in time.
A scalable mip-based method for learning optimal multivariate decision trees
Haoran Zhu, Pavankumar Murali, Dzung T Phan, Lam M Nguyen, and Jayant R Kalagnanam · 2020
Closest in time.
Mathematical optimization in classification and regression trees, 2021
Emilio Carrizosa, Cristina Molero-Río, and Dolores Romero Morales · 2021
Closest in time.
Optimal decision trees for nonlinear metrics
Emir Demirović and Peter Stuckey · 2021
Closest in time.
Parameterized complexity of small decision tree learning
Sebastian Ordyniak and Stefan Szeider · 2021
Closest in time.
Sat-based decision tree learning for large data sets
André Schidler and Stefan Szeider · 2021
Closest in time.