bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition

References

• Aghaei S, Gomez A, Vayanos P (2020) Learning optimal classification trees: Strong max-flow formulations. Preprint, submitted May 13, https://arxiv.org/abs/2002.09142.Google Scholar
• Aglin G, Nijssen S, Schaus P (2020) Learning optimal decision trees using caching branch-and-bound search. Proc. Conf. AAAI Artificial Intelligence, vol. 34, 3146–3153.Google Scholar
• Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. Proc. 1993 ACM SIGMOD Internat. Conf. Management Data, 207–216.Google Scholar
• Alaradi M, Hilal S (2020) Tree-based methods for loan approval. 2020 Internat. Conf. Data Analytics Bus. Indust. Way Toward Sustainable Econom., 1–6.Google Scholar
• Angelino E, Larus-Stone N, Alabi D, Seltzer M, Rudin C (2017) Learning certifiably optimal rule lists. Proc. 23rd ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, (Association for Computing Machinery, New York), 35–44.Google Scholar
• Bertsimas D, Dunn J (2017) Optimal classification trees. Machine Learn. 106(7):1039–1082.Crossref, Google Scholar
• Bertsimas D, Chang A, Rudin C (2012) An integer optimization approach to associative classification. Proc. Neural Inform. Processing Systems, 269–277.Google Scholar
• Bertsimas D, Dunn J, Pawlowski C, Zhuo YD (2019) Robust classification. INFORMS J. Optim. 1(1):2–34.Link, Google Scholar
• Borgelt C (2012) Frequent item set mining. Wiley Interdisciplinary Rev. Data Mining Knowledge Discovery 2(6):437–456.Crossref, Google Scholar
• Breiman L, Friedman J, Stone CJ, Olshen RA (1984) Classification and Regression Trees (Taylor & Francis).Google Scholar
• Dua D, Graff C (2017) UCI machine learning repository. Accessed December 15, 2021, http://archive.ics.uci.edu/ml.Google Scholar
• FICO (2018) Explainable machine learning challenge. Accessed December 15, 2021, https://community.fico.com/s/explainable-machine-learning-challenge.Google Scholar
• Ghiasi MM, Zendehboudi S, Mohsenipour AA (2020) Decision tree-based diagnosis of coronary artery disease: Cart model. Comput. Methods Programs Biomedicine 192:105400.Crossref, Google Scholar
• Goh ST, Rudin C (2014) Box drawings for learning with imbalanced data. Proc. 20th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, (Association for Computing Machinery, New York), 333–342.Google Scholar
• Holte RC (1993) Very simple classification rules perform well on most commonly used datasets. Machine Learn. 11(1):63–90.Crossref, Google Scholar
• Hu X, Rudin C, Seltzer MI (2019) Optimal sparse decision trees. Preprint, submitted April 29, https://arxiv.org/abs/1904.12847.Google Scholar
• Hyafil L, Rivest RL (1976) Constructing optimal binary decision trees is NP-complete. Inform. Processing Lett. 5(1):15–17.Crossref, Google Scholar
• James G, Witten D, Hastie T, Tibshirani R (2014) An Introduction to Statistical Learning: With Applications in R (Springer Publishing Company, Inc.).Google Scholar
• Kass GV (1980) An exploratory technique for investigating large quantities of categorical data. J. Roy. Statist. Soc. Ser. C Appl. Statist. 29(2):119–127.Google Scholar
• Letham B, Rudin C, McCormick TH, Madigan D (2015) Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model. Ann. Appl. Statist. 9(3):1350–1371.Crossref, Google Scholar
• Lin J, Zhong C, Hu D, Rudin C, Seltzer M (2020) Generalized and scalable optimal sparse decision trees. Internat. Conf. Machine Learn., 6150–6160.Google Scholar
• Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. Proc. Fourth Internat. Conf. Knowledge Discovery Data Mining, 80–86.Google Scholar
• Loh WY (2009) Improving the precision of classification trees. Ann. Appl. Statist. 3(4):1710–1737.Crossref, Google Scholar
• Malioutov D, Varshney K (2013) Exact rule learning via boolean compressed sensing. Dasgupta S, McAllester D, eds. Proc. 30th Internat. Conf. Machine Learn., vol. 28 (PMLR, Atlanta), 765–773.Google Scholar
• Mandala IGNN, Nawangpalupi CB, Praktikto FR (2012) Assessing credit risk: An application of data mining in a rural bank. Procedia Econom. Finance 4:406–412.Crossref, Google Scholar
• Nijssen S, Fromont E (2007) Mining optimal decision trees from itemset lattices. Proc. 13th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 530–539.Google Scholar
• Nijssen S, Fromont E (2010) Optimal constraint-based decision tree induction from itemset lattices. Data Mining Knowledge Discovery 21(1):9–51.Crossref, Google Scholar
• Quinlan JR (1993) C4.5: Programs for Machine Learning (Morgan Kaufmann Publishers Inc., San Francisco).Google Scholar
• Quinlan JR, Cameron-Jones RM (1995) Oversearching and layered search in empirical learning. Proc. 14th Internat. Joint Conf. Artificial Intelligence, vol, 2 (Morgan Kaufmann Publishers Inc., San Francisco), 1019–1024.Google Scholar
• Rijnbeek PR, Kors JA (2010) Finding a short and accurate decision rule in disjunctive normal form by exhaustive search. Machine Learn. 80(1):33–62.Crossref, Google Scholar
• Sorensen EH, Miller KL, Ooi CK (2000) The decision tree approach to stock selection. J. Portfolio Management 27(1):42–52.Crossref, Google Scholar
• Street WN (2005) Oblique multicategory decision trees using nonlinear programming. INFORMS J. Comput. 17(1):25–31.Link, Google Scholar
• Tan P-N, Steinbach M, Kumar V (2005) Introduction to Data Mining, 1st ed. (Pearson).Google Scholar
• Tanner L, Schreiber M, Low JGH, Ong A, Tolfvenstam T, Lai YL, Ng LC, et al. (2008) Decision tree algorithms predict the diagnosis and outcome of dengue fever in the early phase of illness. PLOS Neglected Tropical Diseases 2(3):1–9.Crossref, Google Scholar
• Verhaeghe H, Nijssen S, Pesant G, Quimper C-G, Schaus P (2020) Learning optimal decision trees using constraint programming. Constraints 25:1–25.Crossref, Google Scholar
• Verwer S, Zhang Y (2017) Learning decision trees with flexible constraints and objectives using integer optimization. Salvagnin D, Lombardi M, eds. Integration of AI and OR Techniques in Constraint Programming (Springer International Publishing, Cham, Switzerland), 94–103.Crossref, Google Scholar
• Verwer S, Zhang Y (2019) Learning optimal classification trees using a binary linear program formulation. Proc. 33rd AAAI Conf. Artificial Intelligence (AAAI Press), 1625–1632.Google Scholar
• Wang T, Rudin C, Doshi-Velez F, Liu Y, Klampfl E, MacNeille P (2017) A Bayesian framework for learning rule sets for interpretable classification. J. Machine Learn. Res. 18(70):1–37.Google Scholar
• Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans. Evolutionary Comput. 1(1):67–82.Crossref, Google Scholar
• Yang H, Rudin C, Seltzer M (2017) Scalable Bayesian rule lists. Precup D, the YW, eds. Proc. 34th Internat. Conf. Machine Learn., vol. 70 (PMLR), 3921–3930.Google Scholar
• Zhu H, Murali P, Phan DT, Nguyen LM, Kalagnanam J (2020) A scalable MIP-based method for learning optimal multivariate decision trees. Larochelle H, Ranzato MA, Hadsell R, Balcan MF, Lin HT, eds. Adv. Neural Inform. Processing Systems 33: Annual Conf. Neural Inform. Processing Systems 2020.Google Scholar