Journal article · 2017 · Open access
Optimal classification trees
Machine Learning, 106(7), 1039–1082 · Published 3 April 2017 · DOI 10.1007/s10994-017-5633-9
In brief
“Optimal classification trees” is a 2017 journal article by Dimitris Bertsimas and Jack Dunn, published in Machine Learning. OpenAlex counts 931 citations as of 21 November 2026. It is open access: the full text is free to read at Machine Learning.
- Citations
- 931
- Most cited in
- 2026 (160)
- Field-weighted impact
- 47.84
- References
- 43
- Authors
- 2
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Bertsimas, D., & Dunn, J. (2017). Optimal classification trees. Machine Learning, 106(7), 1039–1082. https://doi.org/10.1007/s10994-017-5633-9
MLA 9
Bertsimas, Dimitris, and Jack Dunn. “Optimal classification trees.” Machine Learning, vol. 106, no. 7, 2017, pp. 1039–1082. https://doi.org/10.1007/s10994-017-5633-9.
Chicago
Bertsimas, Dimitris and Jack Dunn. 2017. “Optimal classification trees.” Machine Learning 106 (7): 1039–1082. https://doi.org/10.1007/s10994-017-5633-9.
Harvard
Bertsimas, D. and Dunn, J. (2017) ‘Optimal classification trees’, Machine Learning, 106(7), pp. 1039–1082. doi:10.1007/s10994-017-5633-9.
IEEE
D. Bertsimas and J. Dunn, “Optimal classification trees,” Machine Learning, vol. 106, no. 7, pp. 1039–1082, 2017, doi: 10.1007/s10994-017-5633-9.
BibTeX
@article{bertsimas2017optimal,
title = {{Optimal classification trees}},
author = {Bertsimas, Dimitris and Dunn, Jack},
journal = {Machine Learning},
year = {2017},
volume = {106},
number = {7},
pages = {1039--1082},
doi = {10.1007/s10994-017-5633-9},
url = {https://doi.org/10.1007/s10994-017-5633-9}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 4 | |
| 2018 | 26 | |
| 2019 | 55 | |
| 2020 | 84 | |
| 2021 | 105 | |
| 2022 | 99 | |
| 2023 | 136 | |
| 2024 | 127 | |
| 2025 | 132 | |
| 2026 | 160 |
Its field-weighted citation impact is 47.84: it has been cited 47.84 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- optimal decision trees
- classification trees
- mixed integer programming
- global optimality
- overfitting
- out-of-sample accuracy
- integer programming formulation
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Bertsimas, D., & Dunn, J. (2017). Optimal classification trees. Machine Learning, 106(7), 1039–1082. https://doi.org/10.1007/s10994-017-5633-9
How many times has this paper been cited?
931 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Machine Learning: sign in and open the PDF from this page.
Who wrote this paper?
Dimitris Bertsimas, Jack Dunn.
What is the DOI of this paper?
10.1007/s10994-017-5633-9, permanently at https://doi.org/10.1007/s10994-017-5633-9. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.