Fetching the paper…
Reading the bibliography…
Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics.
1907
Earlier work this paper cites.
Gómez A (2021) Outlier detection in time series via mixed-integer conic quadratic optimization. SIAM Journal on Optimization 31(3):1897–1925
1925
Earlier work this paper cites.
Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252
1962
Earlier work this paper cites.
Hu TC (1963) Multi-commodity network flows. Operations research 11(3):344–360
1963
Earlier work this paper cites.
Hyafil L, Rivest RL (1976) Constructing optimal binary search trees is NP complete. Information Processing Letters 5(1):15–17
1976
Earlier work this paper cites.
Magnanti TL, Wong RT (1981) Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29(3):464–484
1981
Earlier work this paper cites.
Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and Regression Trees (Monterey, CA: Wadsworth and Brooks)
1984
Earlier work this paper cites.
Quinlan JR (1986) Induction of decision trees. Machine Learning 1(1):81–106
1986
Earlier work this paper cites.
Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. Journal of the ACM (JACM) 35(4):921–940
1988
Earlier work this paper cites.
Intrator J, Allan E, Palmer M (1992) Decision tree for the management of substance-abusing psychiatric patients. Journal of Substance Abuse Treatment 9(3):215–220
1992
Earlier work this paper cites.
Blurock ES (1995) Automatic learning of chemical concepts: Research octane number and molecular substructures. Computers & chemistry 19(2):91–99
1995
Earlier work this paper cites.
Breiman L (1996) Bagging predictors. Machine learning 24(2):123–140
1996
Earlier work this paper cites.
Breiman L (2001) Random forests. Machine learning 45(1):5–32
2001
Earlier work this paper cites.
Olanow CW, Watts RL, Koller WC (2001) An algorithm (decision tree) for the management of parkinson’s disease (2001): Treatment guidelines. Neurology 56(suppl 5):S1–S88
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
Liaw A, Wiener M (2002) Classification and regression by randomforest. R News 2(3):18–22
2002
Earlier work this paper cites.
2005
Earlier work this paper cites.
Mower JP (2005) Prep-mt: predictive rna editor for plant mitochondrial genes. BMC Bioinformatics 6(1):96
2005
Earlier work this paper cites.
Bishop CM (2006) Pattern Recognition and Machine Learning (Information Science and Statistics) (Berlin, Heidelberg: Springer-Verlag), ISBN 0387310738
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
Hochbaum DS (2008) The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research 56(4):992–1009
2008
Earlier work this paper cites.
CPLEX II (2009) V12. 1: User’s manual for CPLEX. International Business Machines Corporation 46(53):157
2009
Earlier work this paper cites.
Kirschbaum D, Adler R, Hong Y, Lerner-Lam A (2009) Evaluation of a preliminary satellite-based landslide hazard algorithm using global landslide inventories. Natural Hazards & Earth System Sciences 9(3)
2009
Earlier work this paper cites.
Caton S, Haas C (2020) Fairness in machine learning: A survey. ArXiv preprint arXiv:2010.04053
2010
Earlier work this paper cites.
Kamiran F, Calders T, Pechenizkiy M (2010) Discrimination aware decision tree learning. 2010 IEEE International Conference on Data Mining , 869–874 (IEEE)
2010
Earlier work this paper cites.
Nijssen S, Fromont E (2010) Optimal constraint-based decision tree induction from itemset lattices. Data Mining and Knowledge Discovery 21(1):9–51
2010
Earlier work this paper cites.
Khalilia M, Chakraborty S, Popescu M (2011) Predicting disease risks from highly imbalanced data using random forest. BMC Medical Informatics and Decision Making 11(1):51
2011
Earlier work this paper cites.
Bixby RE (2012) A brief history of linear and mixed-integer programming computation. Documenta Mathematica 107–121
2012
Earlier work this paper cites.
Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , 214–226, ITCS ’12 (New York, NY, USA: ACM), ISBN 978-1-4503-1115-1, http://doi.acm.org/10.1145/2090236.2090255
2012
Earlier work this paper cites.
Rudin C (2013) Predictive policing: using machine learning to detect patterns of crime. Wired Magazine shorturl.at/aoyHX
2013
Earlier work this paper cites.
Vazirani VV (2013) Approximation algorithms (Springer Science & Business Media)
2013
Cited alongside, same era.
Wei W, Li J, Cao L, Ou Y, Chen J (2013) Effective detection of sophisticated online banking fraud on extremely imbalanced data. World Wide Web 16(4):449–475
2013
Cited alongside, same era.
Gade D, Küçükyavuz S, Sen S (2014) Decomposition algorithms with parametric gomory cuts for two-stage stochastic integer programs. Mathematical Programming 144(1-2):39–64
2014
Cited alongside, same era.
Quinlan JR (2014) C4. 5: programs for machine learning (Elsevier)
2014
Cited alongside, same era.
2015
Cited alongside, same era.
Okada S, Ohzeki M, Taguchi S (2019) Efficient partition of integer optimization problems with one-hot encoding. Scientific Reports 9(1):1–12
2019
Later among the works it cites.
Rudin C (2019) Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence 1(5):206–215
2019
Later among the works it cites.
Shaikhina T, Lowe D, Daga S, Briggs D, Higgins R, Khovanova N (2019) Decision tree and random forest models for outcome prediction in antibody incompatible kidney transplantation. Biomedical Signal Processing and Control 52:456–462
2019
Later among the works it cites.
Verhaeghe H, Nijssen S, Pesant G, Quimper CG, Schaus P (2019) Learning optimal decision trees using constraint programming. The 25th International Conference on Principles and Practice of Constraint Programming (CP2019)
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gurobi I (2015) Gurobi optimizer reference manual. http://www.gurobi.com
2015
Cited alongside, same era.
Miller CC (2015) Can an algorithm hire better than a human. The New York Times 25
2015
Cited alongside, same era.
Therneau T, Atkinson B, Ripley B, Ripley MB (2015) Package ‘rpart’
2015
Cited alongside, same era.
Angwin J, Larson J, Mattu S, Kirchner L (2016) Machine bias. https://www.propublica.org/article/machine-bias-risk-assessments-in-criminal-sentencing
2016
Cited alongside, same era.
Barocas S, Selbst AD (2016) Big data’s disparate impact. California Law Review 104(3):671–732
2016
Cited alongside, same era.
Byrnes N (2016) Artificial intolerance. MIT Tech. Review, https://www.technologyreview.com/2016/03/28/246328/artificial-intolerance/
2016
Cited alongside, same era.
Hardt M, Price E, Srebro N (2016) Equality of opportunity in supervised learning. Advances in Neural Information Processing Systems , 3315–3323
2016
Cited alongside, same era.
Verwer S, Zhang Y (2019) Learning optimal classification trees using a binary linear program formulation. Proceedings of the AAAI Conference on Artificial Intelligence , volume 33, 1625–1632
2019
Later among the works it cites.
Anderson R, Huchette J, Ma W, Tjandraatmadja C, Vielma JP (2020) Strong mixed-integer programming formulations for trained neural networks. Mathematical Programming 183(1-2):3–39
2020
Later among the works it cites.
Bertsimas D, Van Parys B (2020) Sparse high-dimensional regression: Exact scalable algorithms and phase transitions. The Annals of Statistics 48(1):300–323
2020
Later among the works it cites.
Blanquero R, Carrizosa E, Molero-Río C, Romero Morales D (2020) Sparsity in optimal randomized classification trees. European Journal of Operational Research 284(1):255–272
2020
Later among the works it cites.
Ciocan DF, Mišić VV (2020) Interpretable optimal stopping. Management Science Forthcoming
2020
Later among the works it cites.
Lin J, Zhong C, Hu D, Rudin C, Seltzer M (2020) Generalized and scalable optimal sparse decision trees. International Conference on Machine Learning , 6150–6160 (PMLR)
2020
Later among the works it cites.
Liu J, Sen S (2020) Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming. SIAM Journal on Optimization 30(1):823–852
2020
Later among the works it cites.
Mišić VV (2020) Optimization of tree ensembles. Operations Research 68(5):1605–1624
2020
Later among the works it cites.
Nijssen S, Schaus P, et al. (2020) Learning optimal decision trees using caching branch-and-bound search. Thirty-Fourth AAAI Conference on Artificial Intelligence
2020
Later among the works it cites.
Xie W, Deng X (2020) Scalable algorithms for the sparse ridge regression. SIAM Journal on Optimization 30(4):3359–3386
2020
Later among the works it cites.
Atamturk A, Gomez A, Han S (2021) Sparse and smooth signal estimation: Convexification of l0-formulations. Journal of Machine Learning Research 22(52):1–43
2021
Closest in time.
Bertsimas D, Stellato B (2021) The voice of optimization. Machine Learning 110(2):249–277
2021
Closest in time.
Blanquero R, Carrizosa E, Molero-Río C, Romero Morales D (2021) Optimal randomized classification trees. Computers & Operations Research 132:105281
2021
Closest in time.
Carrizosa E, Molero-Río C, Romero Morales D (2021) Mathematical optimization in classification and regression trees. TOP 29(1):5–33
2021
Closest in time.
Demirović E, Stuckey PJ (2021) Optimal decision trees for nonlinear metrics. Proceedings of the AAAI Conference on Artificial Intelligence , volume 35, 3733–3741
2021
Closest in time.
Gangammanavar H, Liu Y, Sen S (2021) Stochastic decomposition for two-stage stochastic linear programs with random cost coefficients. INFORMS Journal on Computing 33(1):51–71
2021
Closest in time.
Günlük O, Kalagnanam J, Li M, Menickelly M, Scheinberg K (2021) Optimal decision trees for categorical data via integer programming. Journal of Global Optimization 81(1):233–260
2021
Closest in time.
Guo C, Bodur M, Aleman DM, Urbach DR (2021) Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS Journal on Computing 33(4):1551–1569
2021
Closest in time.
2021
Closest in time.
Mehrabi N, Morstatter F, Saxena N, Lerman K, Galstyan A (2021) A survey on bias and fairness in machine learning. ACM Computing Surveys (CSUR) 54(6):1–35
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
Hazimeh H, Mazumder R, Saab A (2022) Sparse regression at scale: Branch-and-bound rooted in first-order optimization. Mathematical Programming 196(1-2):347–388
2022
Closest in time.
Justin N, Aghaei S, Gómez A, Vayanos P (2022) Optimal robust classification trees. 36th AAAI Conference on Artificial Intelligence, Workshop on Adversarial Machine Learning and Beyond , https://openreview.net/pdf?id=HbasA9ysA3
2022
Closest in time.
Lozano L, Smith JC (2022) A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Mathematical Programming 191(1):381–404
2022
Closest in time.
MacNeil M, Bodur M (2022) Integer programming, constraint programming, and hybrid decomposition approaches to discretizable distance geometry problems. INFORMS Journal on Computing 34(1):297–314
2022
Closest in time.