The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Optimal classification trees
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
R: A Language and Environment for Statistical Computing
R Core Team (2025) · doi:10.32614/r.manuals · Cited by 352,181
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Classification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
Julia: A Fresh Approach to Numerical Computing
Bezanson, J., Edelman, A., Karpinski, S., & Shah, V. B. (2017) · SIAM Review · doi:10.1137/141000671 · Cited by 5,440
SPLIT SELECTION METHODS FOR CLASSIFICATION TREES
Loh, W., & Shih, Y. (1997) · Cited by 977
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959 · cited 1×
“Indeed, it is well-known that the problem of constructing optimal binary decision trees is NP-hard (Hyafil and Rivest 1976).”
BackgroundA System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. L. (1994) · Cited by 723
Best subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Self-citationA System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.63 · Cited by 590
Recursive Partitioning and Regression Trees
Therneau, T. M., Atkinson, B., & Ripley, B. D. (2015) · Cited by 471
Computing in Operations Research Using Julia
Lubin, M., & Dunning, I. (2015) · INFORMS journal on computing · doi:10.1287/ijoc.2014.0623 · Cited by 367
A support vector machine approach to decision trees
Bennett, K. P., & Blue, J. A. (2002) · 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227) · doi:10.1109/ijcnn.1998.687237 · Cited by 235
A brief history of linear and mixed-integer programming computation
Bixby, R. E. (2012) · Documenta Mathematica Series · doi:10.4171/dms/6/16 · Cited by 228
Mathematical Programming in Statistics.
Brown, R. A., Arthanari, T. S., & Dodge, Y. (1982) · Biometrics · doi:10.2307/2529904 · Cited by 187
Induction of Oblique Decision Trees.
Heath, D. G., Kasif, S., & Salzberg, S. L. (1993) · International Joint Conference on Artificial Intelligence · Cited by 164
Generating better decision trees
Norton, S. W. (1989) · International Joint Conference on Artificial Intelligence · Cited by 137
OR Forum—An Algorithmic Approach to Linear Regression
Bertsimas, D., & King, A. (2015) · Operations Research · doi:10.1287/opre.2015.1436 · Cited by 133
Self-citationLogistic Regression: From Art to Science
Bertsimas, D., & King, A. (2017) · Statistical Science · doi:10.1214/16-sts602 · Cited by 127
Self-citationEfficient non-greedy optimization of decision treesPreprint
Norouzi, M., Collins, M. D., Johnson, M., Fleet, D. J., & Kohli, P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.04056 · Cited by 123
Classification and Regression via Integer Optimization
Bertsimas, D., & Shioda, R. (2007) · Operations Research · doi:10.1287/opre.1060.0360 · Cited by 118
Self-citationTheory and Applications of Agnostic PAC-Learning with Small Decision Trees
Auer, P. L., Holte, R. C., & Maass, W. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50012-8 · Cited by 102
Lookahead and pathology in decision tree induction
Murthy, S. K., & Salzberg, S. L. (1995) · Cited by 91
HHCART: An oblique decision tree
Wickramarachchi, D. C., Robertson, B. L., Reale, M., Price, C. J., & Brown, J. (2015) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2015.11.006 · Cited by 84
Anytime Learning of Decision Trees
Esmeir, S., & Markovitch, S. (2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248692 · Cited by 72
Least quantile regression via modern optimization
Bertsimas, D., & Mazumder, R. (2014) · The Annals of Statistics · doi:10.1214/14-aos1223 · Cited by 61
Self-citationLópez‐Chau, A., Cervantes, J., López-García, L., & García‐Lamont, F. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.044 · Cited by 42
Decision tree induction: how effective is the greedy heuristic?
Murthy, S. K., & Salzberg, S. L. (1995) · Cited by 25
Fast growing and interpretable oblique trees via logistic regression models
Truong, A. K. Y. (2009) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.5287/ora-2z7n81pnz · Cited by 18
An Algorithmic Approach to Linear Regression
van Beek, M. (2018) · Cited by 16
Cited by
Bias in data‐driven artificial intelligence systems—An introductory survey
Ntoutsi, E., Fafalios, P., Gadiraju, U., Iosifidis, V., Nejdl, W., Vidal, M., Ruggieri, S., Turini, F., Papadopoulos, S., Krasanakis, E., et al. (2020) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1356 · Cited by 1,043
Interpretable machine learning: Fundamental principles and 10 grand challenges
Rudin, C., Chen, C., Chen, Z., Huang, H., Semenova, L., & Zhong, C. (2022) · Statistics Surveys · doi:10.1214/21-ss133 · Cited by 958
Recent advances in decision trees: an updated survey
Costa, V. G., & Pedreira, C. E. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10275-5 · Cited by 572
Explaining anomalies detected by autoencoders using Shapley Additive Explanations
Antwarg, L., Miller, R. M., Shapira, B., & Rokach, L. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115736 · Cited by 496
Policy Learning With Observational Data
Athey, S., & Wager, S. (2021) · Econometrica · doi:10.3982/ecta15732 · Cited by 372
Metadata
- Authors
- Bertsimas, D., & Dunn, J.
- Venue
- Machine Learning
- Published
- 2017-04-03
- Volume
- 106
- Issue
- 7
- Pages
- 1039-1082
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2604736517
- Cited by
- 638
- References
- 35
- FWCI
- 67.24
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.