{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T05:46:50Z","timestamp":1776059210885,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10994-017-5633-9","type":"journal-article","created":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T05:36:16Z","timestamp":1491284176000},"page":"1039-1082","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":487,"title":["Optimal classification trees"],"prefix":"10.1007","volume":"106","author":[{"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"given":"Jack","family":"Dunn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"5633_CR1","volume-title":"Mathematical programming in statistics","author":"T Arthanari","year":"1981","unstructured":"Arthanari, T., & Dodge, Y. (1981). Mathematical programming in statistics (Vol. 341). New York: Wiley."},{"key":"5633_CR2","doi-asserted-by":"crossref","unstructured":"Auer, P., Holte, R. C., & Maass, W. (1995). Theory and applications of agnostic pac-learning with small decision trees. In Proceedings of the 12th international conference on machine learning (pp. 21\u201329).","DOI":"10.1016\/B978-1-55860-377-6.50012-8"},{"key":"5633_CR3","unstructured":"Bennett, K. P. (1992). Decision tree construction via linear programming. In M. Evans (Ed.), Proceedings of the 4th midwest artificial intelligence and cognitive science society conference (pp. 97\u2013101)."},{"key":"5633_CR4","unstructured":"Bennett, K. P., & Blue, J. (1996). Optimal decision trees. Rensselaer Polytechnic Institute Math Report No. 214."},{"key":"5633_CR5","doi-asserted-by":"crossref","unstructured":"Bennett, K. P., & Blue, J. A. (1998). A support vector machine approach to decision trees. In IEEE international joint conference on neural networks proceedings. IEEE world congress on computational intelligence (Vol. 3, pp. 2396\u20132401).","DOI":"10.1109\/IJCNN.1998.687237"},{"issue":"1","key":"5633_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., & King, A. (2015). An algorithmic approach to linear regression. Operations Research, 64(1), 2\u201316.","journal-title":"Operations Research"},{"key":"5633_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., & King, A. (2017). Logistic regression: From art to science. Statistical Science (to appear).","DOI":"10.1214\/16-STS602"},{"issue":"6","key":"5633_CR8","doi-asserted-by":"crossref","first-page":"2494","DOI":"10.1214\/14-AOS1223","volume":"42","author":"D Bertsimas","year":"2014","unstructured":"Bertsimas, D., & Mazumder, R. (2014). Least quantile regression via modern optimization. The Annals of Statistics, 42(6), 2494\u20132525.","journal-title":"The Annals of Statistics"},{"issue":"2","key":"5633_CR9","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas, D., & Shioda, R. (2007). Classification and regression via integer optimization. Operations Research, 55(2), 252\u2013271.","journal-title":"Operations Research"},{"key":"5633_CR10","volume-title":"Optimization over integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., & Weismantel, R. (2005). Optimization over integers. Belmont, MA: Dynamic Ideas."},{"issue":"2","key":"5633_CR11","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., & Mazumder, R. (2016). Best subset selection via a modern optimization lens. Annals of Statistics, 44(2), 813\u2013852.","journal-title":"Annals of Statistics"},{"key":"5633_CR12","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., & Shah, V. B. (2014). Julia: A fresh approach to numerical computing. arXiv preprint arXiv:1411.1607"},{"key":"5633_CR13","doi-asserted-by":"crossref","unstructured":"Bixby, R. E. (2012). A brief history of linear and mixed-integer programming computation. Documenta Mathematica, Extra Volume: Optimization Stories, 107\u2013121.","DOI":"10.4171\/dms\/6\/16"},{"issue":"1","key":"5633_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"5633_CR15","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and regression trees. Monterey, CA: Wadsworth and Brooks."},{"issue":"1","key":"5633_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02022091","volume":"21","author":"LA Cox Jr","year":"1989","unstructured":"Cox, L. A, Jr., Yuping, Q., & Kuehner, W. (1989). Heuristic least-cost computation of discrete classification functions with uncertain argument values. Annals of Operations Research, 21(1), 1\u201329.","journal-title":"Annals of Operations Research"},{"key":"5633_CR17","first-page":"891","volume":"8","author":"S Esmeir","year":"2007","unstructured":"Esmeir, S., & Markovitch, S. (2007). Anytime learning of decision trees. The Journal of Machine Learning Research, 8, 891\u2013933.","journal-title":"The Journal of Machine Learning Research"},{"key":"5633_CR18","unstructured":"Gurobi Optimization Inc. (2015a). Gurobi 6.0 performance benchmarks. http:\/\/www.gurobi.com\/pdfs\/benchmarks.pdf . Accessed September 5, 2015."},{"key":"5633_CR19","unstructured":"Gurobi Optimization Inc. (2015b). Gurobi optimizer reference manual. http:\/\/www.gurobi.com ."},{"key":"5633_CR20","unstructured":"Heath, D., Kasif, S., & Salzberg, S. (1993). Induction of oblique decision trees. In IJCAI, Citeseer (pp. 1002\u20131007)."},{"issue":"1","key":"5633_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5(1), 15\u201317.","journal-title":"Information Processing Letters"},{"key":"5633_CR22","unstructured":"IBM ILOG CPLEX. (2014). V12.1 users manual. https:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ ."},{"key":"5633_CR23","unstructured":"Liaw, A., & Wiener, M. (2002). Classification and regression by randomforest. R News, 2(3), 18\u201322. http:\/\/CRAN.R-project.org\/doc\/Rnews\/ ."},{"key":"5633_CR24","unstructured":"Lichman, M. (2013). UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml ."},{"issue":"4","key":"5633_CR25","first-page":"815","volume":"7","author":"WY Loh","year":"1997","unstructured":"Loh, W. Y., & Shih, Y. S. (1997). Split selection methods for classification trees. Statistica Sinica, 7(4), 815\u2013840.","journal-title":"Statistica Sinica"},{"issue":"16","key":"5633_CR26","doi-asserted-by":"crossref","first-page":"6283","DOI":"10.1016\/j.eswa.2013.05.044","volume":"40","author":"A L\u00f3pez-Chau","year":"2013","unstructured":"L\u00f3pez-Chau, A., Cervantes, J., L\u00f3pez-Garc\u00eda, L., & Lamont, F. G. (2013). Fishers decision tree. Expert Systems with Applications, 40(16), 6283\u20136291.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"5633_CR27","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin, M., & Dunning, I. (2015). Computing in operations research using julia. INFORMS Journal on Computing, 27(2), 238\u2013248.","journal-title":"INFORMS Journal on Computing"},{"key":"5633_CR28","unstructured":"Murthy, S., & Salzberg, S. (1995a). Lookahead and pathology in decision tree induction. In IJCAI, Citeseer (pp. 1025\u20131033)."},{"key":"5633_CR29","unstructured":"Murthy, S. K., & Salzberg, S. (1995b). Decision tree induction: How effective is the greedy heuristic? In KDD (pp. 222\u2013227)."},{"key":"5633_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.63","volume":"2","author":"SK Murthy","year":"1994","unstructured":"Murthy, S. K., Kasif, S., & Salzberg, S. (1994). A system for induction of oblique decision trees. Journal of Artificial Intelligence Research, 2, 1\u201332.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5633_CR31","unstructured":"Nemhauser, G. L. (2013). Integer programming: The global impact. In Presented at EURO, INFORMS, Rome, Italy, 2013. http:\/\/euro-informs2013.org\/data\/http_\/euro2013.org\/wp-content\/uploads\/nemhauser.pdf . Accessed September 9, 2015."},{"key":"5633_CR32","unstructured":"Norouzi, M., Collins, M. D., Johnson, M. A., Fleet, D. J., & Kohli, P. (2015). Efficient non-greedy optimization of decision trees. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, & R. Garnett (Eds.), Proceedings of the Advances in Neural Information Processing Systems 2015, 28: Annual Conference on Neural Information Processing Systems, 7\u201312 December 2015, Montreal, QC, pp. 1729\u20131737."},{"key":"5633_CR33","unstructured":"Norton, S. W. (1989). Generating better decision trees. In IJCAI (Vol. 89, pp. 800\u2013805)."},{"issue":"9","key":"5633_CR34","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TC.1977.1674938","volume":"100","author":"HJ Payne","year":"1977","unstructured":"Payne, H. J., & Meisel, W. S. (1977). An algorithm for constructing optimal binary decision trees. IEEE Transactions on Computers, 100(9), 905\u2013916.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"5633_CR35","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1(1), 81\u2013106.","journal-title":"Machine Learning"},{"key":"5633_CR36","volume-title":"C4.5: Programs for machine learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J. R. (1993). C4.5: Programs for machine learning. San Francisco, CA: Morgan Kaufmann."},{"key":"5633_CR37","unstructured":"R Core Team. (2015). R: A language and environment for statistical computing. Vienna: R Foundation for Statistical Computing. http:\/\/www.R-project.org\/ ."},{"issue":"1, 2","key":"5633_CR38","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-341206","volume":"34","author":"NH Son","year":"1998","unstructured":"Son, N. H. (1998). From optimal hyperplanes to optimal decision trees. Fundamenta Informaticae, 34(1, 2), 145\u2013174.","journal-title":"Fundamenta Informaticae"},{"key":"5633_CR39","unstructured":"Therneau, T., Atkinson, B., & Ripley, B. (2015). rpart: Recursive partitioning and regression trees. http:\/\/CRAN.R-project.org\/package=rpart , R package version 4.1-9."},{"key":"5633_CR40","unstructured":"Tjortjis, C., & Keane, J. (2002). T3: A classification algorithm for data mining. Lecture Notes in Computer Science (Vol. 2412, pp. 50\u201355). Berlin: Springer."},{"key":"5633_CR41","unstructured":"Top500 Supercomputer Sites. (2015). Performance development. http:\/\/www.top500.org\/statistics\/perfdevel\/ . Accessed September 4, 2015."},{"key":"5633_CR42","unstructured":"Truong, A. (2009). Fast growing and interpretable oblique trees via logistic regression models. Ph.D. thesis, University of Oxford."},{"key":"5633_CR43","unstructured":"Tzirakis, P., & Tjortjis, C. (2016). T3c: Improving a decision tree classification algorithms interval splits on continuous attributes. Advances in Data Analysis and Classification, 1\u201318."},{"key":"5633_CR44","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.csda.2015.11.006","volume":"96","author":"D Wickramarachchi","year":"2016","unstructured":"Wickramarachchi, D., Robertson, B., Reale, M., Price, C., & Brown, J. (2016). Hhcart: An oblique decision tree. Computational Statistics & Data Analysis, 96, 12\u201323.","journal-title":"Computational Statistics & Data Analysis"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5633-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5633-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5633-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:12:38Z","timestamp":1692749558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5633-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["5633"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5633-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,3]]}}}