{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:16:18Z","timestamp":1776410178800,"version":"3.51.2"},"reference-count":174,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["30992574"],"award-info":[{"award-number":["30992574"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Artif. Intell."],"abstract":"<jats:p>This article provides a birds-eye view on the role of decision trees in machine learning and data science over roughly four decades. It sketches the evolution of decision tree research over the years, describes the broader context in which the research is situated, and summarizes strengths and weaknesses of decision trees in this context. The main goal of the article is to clarify the broad relevance to machine learning and artificial intelligence, both practical and theoretical, that decision trees still have today.<\/jats:p>","DOI":"10.3389\/frai.2023.1124553","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T07:04:13Z","timestamp":1690355053000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":179,"title":["Decision trees: from efficient prediction to responsible AI"],"prefix":"10.3389","volume":"6","author":[{"given":"Hendrik","family":"Blockeel","sequence":"first","affiliation":[]},{"given":"Laurens","family":"Devos","sequence":"additional","affiliation":[]},{"given":"Beno\u00eet","family":"Fr\u00e9nay","sequence":"additional","affiliation":[]},{"given":"G\u00e9raldin","family":"Nanfack","sequence":"additional","affiliation":[]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1609\/aaai.v33i01.33011418","article-title":"Learning optimal and fair decision trees for non-discriminative decision-making","author":"Aghaei","year":"2019","journal-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence"},{"key":"B2","doi-asserted-by":"publisher","first-page":"3146","DOI":"10.1609\/aaai.v34i04.5711","article-title":"Learning optimal decision trees using caching branch-and-bound search","author":"Aglin","year":"","journal-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence"},{"key":"B3","doi-asserted-by":"publisher","first-page":"5222","DOI":"10.24963\/ijcai.2020\/750","article-title":"Pydl8.5: a library for learning optimal decision trees","author":"Aglin","year":"","journal-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence"},{"key":"B4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-031-26419-1_24","article-title":"Learning optimal decision trees under memory constraints","author":"Aglin","year":"2022","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2022), Part V"},{"key":"B5","doi-asserted-by":"publisher","first-page":"13518","DOI":"10.1109\/CVPR46437.2021.01331","article-title":"Learning decision trees recurrently through communication","author":"Alaniz","year":"2021","journal-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition"},{"key":"B6","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1145\/3531146.3533168","article-title":"Counterfactual shapley additive explanations","author":"Albini","year":"2022","journal-title":"2022 ACM Conference on Fairness, Accountability, and Transparency"},{"key":"B7","first-page":"12997","article-title":"Provably robust boosted decision stumps and trees against adversarial attacks","author":"Andriushchenko","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B8","doi-asserted-by":"publisher","first-page":"3195","DOI":"10.1609\/aaai.v34i04.5717","article-title":"Efficient inference of optimal decision trees","author":"Avellaneda","year":"2020","journal-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence"},{"key":"B9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/TSMCC.2011.2157494","article-title":"A survey of evolutionary algorithms for decision-tree induction","volume":"42","author":"Barros","year":"2012","journal-title":"IEEE Trans. Syst. Man, Cyber"},{"key":"B10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-14231-9","volume-title":"Automatic Design of Decision-Tree Induction Algorithms","author":"Barros","year":"2015"},{"key":"B11","article-title":"Interpretability via model extraction. arXiv:1706.09773","author":"Bastani","year":"2017"},{"key":"B12","first-page":"2499","article-title":"Verifiable reinforcement learning via policy extraction","author":"Bastani","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B13","doi-asserted-by":"publisher","first-page":"2712","DOI":"10.1609\/aaai.v32i1.11715","article-title":"Estimating the class prior in positive and unlabeled data through decision tree induction","author":"Bekker","year":"2018","journal-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence"},{"key":"B14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF00994659","article-title":"Monotonicity maintenance in information-theoretic machine learning algorithms","volume":"19","author":"Ben-David","year":"1995","journal-title":"Mach. Learn"},{"key":"B15","first-page":"849","article-title":"A streaming parallel decision tree algorithm","volume":"11","author":"Ben-Haim","year":"2010","journal-title":"J. Mach. Lear. Res"},{"key":"B16","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","article-title":"Optimal classification trees","volume":"106","author":"Bertsimas","year":"2017","journal-title":"Mach. Lear"},{"key":"B17","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1007\/s10994-021-06117-0","article-title":"Optimal survival trees","volume":"111","author":"Bertsimas","year":"2022","journal-title":"Mach. Lear"},{"key":"B18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-04244-7_16","article-title":"Minimising decision tree size as combinatorial optimisation","author":"Bessiere","year":"2009","journal-title":"Principles and Practice of Constraint Programming - CP 2009"},{"key":"B19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","article-title":"Top-down induction of first-order logical decision trees","volume":"101","author":"Blockeel","year":"1998","journal-title":"Artif. Intell"},{"key":"B20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/1102351.1102359","article-title":"Multi-instance tree learning","author":"Blockeel","year":"2005","journal-title":"Proceedings of the 22nd International Conference on Machine Learning"},{"key":"B21","first-page":"55","article-title":"Top-down induction of clustering trees","author":"Blockeel","year":"1998","journal-title":"Proceedings of the 15th International Conference on Machine Learning"},{"key":"B22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1214\/09-SS047","article-title":"A review of survival trees","volume":"5","author":"Bou-Hamad","year":"2011","journal-title":"Stat. Surv"},{"key":"B23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","article-title":"Bagging predictors","volume":"24","author":"Breiman","year":"1996","journal-title":"Mach. Lear"},{"key":"B24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Lear"},{"key":"B25","volume-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"B26","doi-asserted-by":"publisher","first-page":"102843","DOI":"10.1016\/j.cose.2022.102843","article-title":"Beyond robustness: Resilience verification of tree-based classifiers","volume":"121","author":"Calzavara","year":"2022","journal-title":"Comput. Secur"},{"key":"B27","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-59013-0_21","article-title":"Certifying decision trees against evasion attacks by program analysis","author":"Calzavara","year":"","journal-title":"Computer Security-ESORICS 2020: 25th European Symposium on Research in Computer Security"},{"key":"B28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13635-021-00127-0","article-title":"Feature partitioning for robust tree ensembles and their certification in adversarial scenarios","volume":"2021","author":"Calzavara","year":"2021","journal-title":"EURASIP J. Inform. Secur"},{"key":"B29","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1007\/s10618-020-00694-9","article-title":"Treant: training evasion-aware decision trees","volume":"34","author":"Calzavara","year":"","journal-title":"Data Mining Knowl. Discov"},{"key":"B30","doi-asserted-by":"publisher","first-page":"6903","DOI":"10.1609\/aaai.v35i8.16851","article-title":"Counterfactual explanations for oblique decision trees: Exact, efficient algorithms","author":"Carreira-Perpi n\u00e1n","year":"2021","journal-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence"},{"key":"B31","first-page":"1122","article-title":"Robust decision trees against adversarial examples","author":"Chen","year":"","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"B32","first-page":"12317","article-title":"Robustness verification of tree-based models","author":"Chen","year":"","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B33","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1145\/2939672.2939785","article-title":"Xgboost: A scalable tree boosting system","author":"Chen","year":"2016","journal-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B34","first-page":"2291","article-title":"Cost-aware robust tree ensembles for security applications","author":"Chen","year":"2021","journal-title":"30th USENIX Security Symposium (USENIX Security 21)"},{"key":"B35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-010-5190-y","article-title":"Adaptive partitioning schemes for bipartite ranking","volume":"83","author":"Cl\u00e9men\u00e7on","year":"2011","journal-title":"Mach. Lear"},{"key":"B36","first-page":"2457","article-title":"Trepan reloaded: A knowledge-driven approach to explaining artificial neural networks","author":"Confalonieri","year":"2020","journal-title":"24th European Conference on Artificial Intelligence"},{"key":"B37","doi-asserted-by":"publisher","first-page":"4765","DOI":"10.1007\/s10462-022-10275-5","article-title":"Recent advances in decision trees: an updated survey","volume":"56","author":"Costa","year":"2023","journal-title":"Artif. Intell. Rev"},{"key":"B38","first-page":"1","article-title":"Optimization with non-differentiable constraints with applications to fairness, recall, churn, and other goals","volume":"20","author":"Cotter","year":"2019","journal-title":"J. Mach. Lear. Res"},{"key":"B39","first-page":"24","article-title":"Extracting tree-structured representations of trained networks","author":"Craven","year":"1995","journal-title":"Proceedings of the 8th International Conference on Neural Information Processing Systems"},{"key":"B40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-4929-3","volume-title":"Decision Forests for Computer Vision and Medical Image Analysis","author":"Criminisi","year":"2013"},{"key":"B41","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1561\/0600000035","article-title":"Decision forests: A unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning","volume":"7","author":"Criminisi","year":"2012","journal-title":"Found. Trends Comput. Graph. Vision"},{"key":"B42","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/2783258.2783281","article-title":"Optimal action extraction for random forests and boosted trees","author":"Cui","year":"2015","journal-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B43","first-page":"1","article-title":"Murtree: Optimal decision trees via dynamic programming and search","volume":"23","author":"Demirovic","year":"2022","journal-title":"J. Mach. Lear. Res"},{"key":"B44","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1007\/978-3-030-46150-8_35","article-title":"Fast gradient boosting decision trees with bit-level data structures","volume-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2019), Part I","author":"Devos","year":"2020"},{"key":"B45","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/1.9781611976700.51","article-title":"Verifying tree ensembles by reasoning about potential instances","author":"Devos","year":"","journal-title":"Proceedings of the 2021 SIAM International Conference on Data Mining"},{"key":"B46","first-page":"2654","article-title":"Versatile verification of tree ensembles","author":"Devos","year":"","journal-title":"Proceedings of the 38th International Conference on Machine Learning"},{"key":"B47","first-page":"10380","article-title":"Adversarial risk and robustness: General definitions and implications for the uniform distribution","volume-title":"Advances in Neural Information Processing Systems","author":"Diochnos","year":"2018"},{"key":"B48","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/347090.347107","article-title":"Mining high-speed data streams","author":"Domingos","year":"2000","journal-title":"Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B49","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s11704-019-8208-z","article-title":"A survey on ensemble learning","volume":"14","author":"Dong","year":"2020","journal-title":"Front Comput. Sci"},{"key":"B50","article-title":"Towards a rigorous science of interpretable machine learning. arXiv:1702.08608","author":"Doshi-Velez","year":"2017"},{"key":"B51","first-page":"1","article-title":"Building decision tree classifier on private data","author":"Du","year":"2002","journal-title":"Proceedings of the 14th IEEE International Conference on Privacy, Security and Data Mining"},{"key":"B52","first-page":"5742","article-title":"Robust counterfactual explanations for tree-based ensembles","author":"Dutta","year":"2022","journal-title":"Proceedings of the 39th International Conference on Machine Learning"},{"key":"B53","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1609\/aaai.v33i01.33012446","article-title":"Verifying robustness of gradient boosted models","author":"Einziger","year":"2019","journal-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence"},{"key":"B54","first-page":"891","article-title":"Anytime learning of decision trees","volume":"8","author":"Esmeir","year":"2007","journal-title":"J. Mach. Lear. Res"},{"key":"B55","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10994-009-5147-1","article-title":"A comparison of pruning criteria for probability trees","volume":"78","author":"Fierens","year":"2010","journal-title":"Mach. Lear"},{"key":"B56","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-540-74958-5_54","article-title":"Learning directed probabilistic logical models: Ordering-search versus structure-search","author":"Fierens","year":"2007","journal-title":"Proceedings of the 18th European Conference on Machine Learning"},{"key":"B57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3337064","article-title":"Decision tree classification with differential privacy: A survey","volume":"52","author":"Fletcher","year":"2019","journal-title":"ACM Comput. Surv"},{"key":"B58","first-page":"124","article-title":"The alternating decision tree learning algorithm","author":"Freund","year":"1999","journal-title":"Proceedings of the 16th International Conference on Machine Learning"},{"key":"B59","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: A gradient boosting machine","volume":"29","author":"Friedman","year":"2001","journal-title":"Ann. Stat"},{"key":"B60","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-94-011-5014-9_15","article-title":"Learning bayesian networks with local structure","volume-title":"Learning in Graphical Models","author":"Friedman","year":"1998"},{"key":"B61","article-title":"Distilling a neural network into a soft decision tree","author":"Frosst","year":"2018","journal-title":"Proceedings of the First International Workshop on Comprehensibility and Explanation in AI and ML"},{"key":"B62","volume-title":"Preference Learning","author":"F\u00fcrnkranz","year":"2010"},{"key":"B63","article-title":"Green accelerated Hoeffding tree. arXiv:2205.03184","author":"Garcia-Martin","year":"2022"},{"key":"B64","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1022445500761","article-title":"Building decision trees with constraints","volume":"7","author":"Garofalakis","year":"2003","journal-title":"Data Min. Knowl. Disc"},{"key":"B65","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009839829793","article-title":"Rainforest-a framework for fast decision tree construction of large datasets","volume":"4","author":"Gehrke","year":"2000","journal-title":"Data Min. Knowl. Disc"},{"key":"B66","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1007\/s10994-017-5642-8","article-title":"Adaptive random forests for evolving data stream classification","volume":"106","author":"Gomes","year":"2017","journal-title":"Mach. Lear"},{"key":"B67","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/ICDM.2019.00124","article-title":"Fair adversarial gradient tree boosting","author":"Grari","year":"2019","journal-title":"Proceedings of the 2019 IEEE International Conference on Data Mining"},{"key":"B68","article-title":"Why do tree-based models still outperform deep learning on typical tabular data?","author":"Grinsztajn","year":"2022","journal-title":"NeurIPS 2022 Datasets and Benchmarks"},{"key":"B69","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-022-00831-6","article-title":"Counterfactual explanations and how to find them: literature review and benchmarking","volume":"3","author":"Guidotti","year":"2022","journal-title":"Data Min. Knowl. Disc"},{"key":"B70","first-page":"8127","article-title":"Fast provably robust decision trees and boosting","author":"Guo","year":"2022","journal-title":"Proceedings of the 39th International Conference on Machine Learning"},{"key":"B71","author":"Gurobi Optimization","year":"2022","journal-title":"Gurobi Optimizer Reference Manual"},{"key":"B72","first-page":"4138","article-title":"The tree ensemble layer: Differentiability meets conditional computation","author":"Hazimeh","year":"2020","journal-title":"Proceedings of the 37th International Conference on Machine Learning"},{"key":"B73","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0933-3657(02)00085-4","article-title":"Bagging tree classifiers for laser scanning images: a data- and simulation-based strategy","volume":"27","author":"Hothorn","year":"2003","journal-title":"Artif. Intell. Med"},{"key":"B74","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.24963\/ijcai.2020\/163","article-title":"Learning optimal decision trees with maxsat and its integration in adaboost","author":"Hu","year":"2020","journal-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence"},{"key":"B75","first-page":"7265","article-title":"Optimal sparse decision trees","author":"Hu","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B76","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1109\/TFUZZ.2009.2026640","article-title":"Why fuzzy decision trees are good rankers","volume":"17","author":"H\u00fcllermeier","year":"2009","journal-title":"IEEE Trans. Fuzzy Syst"},{"key":"B77","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision trees is np-complete","volume":"5","author":"Hyafil","year":"1976","journal-title":"Inform. Proces. Lett"},{"key":"B78","first-page":"1819","article-title":"Soft decision trees","author":"Irsoy","year":"2012","journal-title":"Proceedings of the 21st International Conference on Pattern Recognition"},{"key":"B79","doi-asserted-by":"publisher","first-page":"3582","DOI":"10.1109\/ICPR.2014.616","article-title":"Budding trees","author":"Irsoy","year":"2014","journal-title":"Proceedings of the 22nd International Conference on Pattern Recognition"},{"key":"B80","article-title":"Towards end-to-end secure and efficient federated learning for xgboost","author":"Jin","year":"2022","journal-title":"Proceedings of the AAAI International Workshop on Trustable, Verifiable and Auditable Federated Learning"},{"key":"B81","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10994-014-5453-0","article-title":"Regression conformal prediction with random forests","volume":"97","author":"Johansson","year":"2014","journal-title":"Mach. Lear"},{"key":"B82","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000083","article-title":"Advances and open problems in federated learning","volume":"14","author":"Kairouz","year":"2021","journal-title":"Found. Trends Mach. Learn"},{"key":"B83","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/ICDM.2010.50","article-title":"Discrimination aware decision tree learning","author":"Kamiran","year":"2010","journal-title":"Proceedings of the 10th IEEE International Conference on Data Mining"},{"key":"B84","doi-asserted-by":"publisher","first-page":"2855","DOI":"10.24963\/ijcai.2020\/395","article-title":"Dace: distribution-aware counterfactual explanation by mixed-integer linear optimization","author":"Kanamori","year":"2021","journal-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence"},{"key":"B85","first-page":"2387","article-title":"Evasion and hardening of tree ensemble classifiers","author":"Kantchelian","year":"2016","journal-title":"Proceedings of the 33rd International Conference on Machine Learning"},{"key":"B86","first-page":"3149","article-title":"LightGBM: A highly efficient gradient boosting decision tree","author":"Ke","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B87","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-031-26419-1_27","article-title":"Time constrained dl8.5 using limited discrepancy search","author":"Kiossou","year":"2022","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2022), Part V"},{"key":"B88","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.patcog.2012.09.023","article-title":"Tree ensembles for predicting structured output","volume":"46","author":"Kocev","year":"2013","journal-title":"Patt. Recogn"},{"key":"B89","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1109\/ICCV.2015.172","article-title":"Deep neural decision forests","author":"Kontschieder","year":"2015","journal-title":"Proceedings of the IEEE International Conference on Computer Vision"},{"key":"B90","article-title":"Fast inference of tree ensembles on arm devices","author":"Koschel","year":"2023","journal-title":"arXiv"},{"key":"B91","first-page":"812","article-title":"Structural regression trees","author":"Kramer","year":"1996","journal-title":"Proceedings of the 13th National Conference on Artificial Intelligence"},{"key":"B92","article-title":"Oblique decision trees from derivatives of ReLU networks","author":"Lee","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"B93","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10844-017-0457-4","article-title":"Semi-supervised classification trees","volume":"49","author":"Levati\u0107","year":"2017","journal-title":"J. Intell. Inform. Syst"},{"key":"B94","article-title":"A survey of neural trees. arXiv:2209.03415","author":"Li","year":"2022"},{"key":"B95","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1609\/aaai.v34i01.5422","article-title":"Privacy-preserving gradient boosting decision trees","author":"Li","year":"2020","journal-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence"},{"key":"B96","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ins.2012.05.023","article-title":"Learning very fast decision tree from uncertain data streams with positive and unlabeled samples","volume":"213","author":"Liang","year":"2012","journal-title":"Inform. Sci"},{"key":"B97","first-page":"6150","article-title":"Generalized and scalable optimal sparse decision trees","author":"Lin","year":"2020","journal-title":"Proceedings of the 37th International Conference on Machine Learning"},{"key":"B98","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1561\/2400000035","article-title":"Algorithms for verifying deep neural networks","volume":"4","author":"Liu","year":"2021","journal-title":"Found. Trends? Optimiz"},{"key":"B99","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/ICDM.2008.17","article-title":"Isolation forest","author":"Liu","year":"2008","journal-title":"Proceedings of the 8th IEEE International Conference on Data Mining"},{"key":"B100","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-71273-4_36","article-title":"Quickscorer: Efficient traversal of large ensembles of decision trees","author":"Lucchese","year":"2017","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2017), Part III"},{"key":"B101","doi-asserted-by":"publisher","first-page":"5313","DOI":"10.1609\/aaai.v36i5.20468","article-title":"Focus: Flexible optimizable counterfactual explanations for tree ensembles","author":"Lucic","year":"2022","journal-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence"},{"key":"B102","article-title":"Explainable ai for trees: From local explanations to global understanding. arXiv:1905.04610","author":"Lundberg","year":"2019"},{"key":"B103","article-title":"Towards deep learning models resistant to adversarial attacks","author":"Madry","year":"2018","journal-title":"Proceedings of the 6th International Conference on Learning Representations"},{"key":"B104","doi-asserted-by":"publisher","first-page":"9604","DOI":"10.1609\/aaai.v36i9.21194","article-title":"Fast sparse decision tree optimization via reference ensembles","author":"McTavish","year":"2022","journal-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence"},{"key":"B105","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0014141","article-title":"Sliq: A fast scalable classifier for data mining","author":"Mehta","year":"1996","journal-title":"Advances in Database Technology-EDBT'96: 5th International Conference on Extending Database Technology"},{"key":"B106","first-page":"1271","article-title":"A communication-efficient parallel algorithm for decision tree","volume":"29","author":"Meng","year":"","journal-title":"Adv. Neural Infor. Proc. Syst"},{"key":"B107","first-page":"1235","article-title":"MLlib: Machine Learning in Apache Spark","volume":"17","author":"Meng","year":"","journal-title":"J. Mach. Learn. Res"},{"key":"B108","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-031-26412-2_16","article-title":"Maviper: Learning decision tree policies for interpretable multi-agent reinforcement learning","author":"Milani","year":"2022","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2022), Part IV"},{"key":"B109","doi-asserted-by":"publisher","first-page":"e127","DOI":"10.7717\/peerj-cs.127","article-title":"Accelerating the XGBoost algorithm using GPU computing","volume":"3","author":"Mitchell","year":"2017","journal-title":"PeerJ Comput. Sci"},{"key":"B110","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1009744630224","article-title":"Automatic construction of decision trees from data: A multi-disciplinary survey","volume":"2","author":"Murthy","year":"1998","journal-title":"Data Mining Knowl. Disc"},{"key":"B111","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.63","article-title":"A system for induction of oblique decision trees","volume":"2","author":"Murthy","year":"1994","journal-title":"J. Artif. Intell. Res"},{"key":"B112","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3506734","article-title":"Constraint enforcement on decision trees: A survey","volume":"54","author":"Nanfack","year":"2021","journal-title":"ACM Comput. Surv"},{"key":"B113","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.24963\/ijcai.2018\/189","article-title":"Learning optimal decision trees with SAT","author":"Narodytska","year":"2018","journal-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence"},{"key":"B114","doi-asserted-by":"publisher","first-page":"14933","DOI":"10.1109\/CVPR46437.2021.01469","article-title":"Neural prototype trees for interpretable fine-grained image recognition","author":"Nauta","year":"2021","journal-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition"},{"key":"B115","first-page":"653","article-title":"Relational dependency networks","volume":"8","author":"Neville","year":"2007","journal-title":"J. Mach. Lear. Res"},{"key":"B116","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/1281192.1281250","article-title":"Mining optimal decision trees from itemset lattices","author":"Nijssen","year":"2007","journal-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B117","first-page":"1729","article-title":"Efficient non-greedy optimization of decision trees","author":"Norouzi","year":"2015","journal-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems"},{"key":"B118","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00114778","article-title":"The use of background knowledge in decision tree induction","volume":"6","author":"N\u00fa\u00f1ez","year":"1991","journal-title":"Mach. Lear"},{"key":"B119","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.1609\/aaai.v33i01.33012496","article-title":"Deep neural networks constrained by decision rules","author":"Okajima","year":"2019","journal-title":"Proceedings of the 33th AAAI Conference on Artificial Intelligence"},{"key":"B120","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0165-0114(03)00089-7","article-title":"A complete fuzzy decision tree technique","volume":"138","author":"Olaru","year":"2003","journal-title":"Fuzzy Sets Syst"},{"key":"B121","first-page":"8422","article-title":"Optimal counterfactual explanations in tree ensembles","author":"Parmentier","year":"2021","journal-title":"Proceedings of the 38th International Conference on Machine Learning"},{"key":"B122","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/568574.568577","article-title":"Classification trees for problems with monotonicity constraints","volume":"4","author":"Potharst","year":"2002","journal-title":"SIGKDD Explor"},{"key":"B123","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1024099825458","article-title":"Tree induction for probability-based ranking","volume":"52","author":"Provost","year":"2003","journal-title":"Mach. Lear"},{"key":"B124","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Lear"},{"key":"B125","first-page":"343","article-title":"Learning with continuous classes","author":"Quinlan","year":"1992","journal-title":"Proceedings of the 5th Australian Joint Conference on Artificial Intelligence"},{"key":"B126","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/2020408.2020507","article-title":"Density estimation trees","author":"Ram","year":"2011","journal-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page"},{"key":"B127","doi-asserted-by":"publisher","first-page":"5478","DOI":"10.1609\/aaai.v34i04.5998","article-title":"Abstract interpretation of decision tree ensemble classifiers","author":"Ranzato","year":"2020","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"B128","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1145\/3449639.3459286","article-title":"Genetic adversarial training of decision trees","author":"Ranzato","year":"2021","journal-title":"Proceedings of the 2021 Genetic and Evolutionary Computation Conference"},{"key":"B129","article-title":"Model-agnostic interpretability of machine learning","volume-title":"ICML Workshop on Human Interpretability in Machine Learning, WHI '16","author":"Ribeiro","year":""},{"key":"B130","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1145\/2939672.2939778","article-title":"\u2018Why should I trust you?': Explaining the predictions of any classifier","author":"Ribeiro","year":"","journal-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B131","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.inffus.2015.06.005","article-title":"Decision forest: Twenty years of research","volume":"27","author":"Rokach","year":"2016","journal-title":"Inf. Fusion"},{"key":"B132","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/CVPR.2014.18","article-title":"Neural decision forests for semantic image labelling","author":"Rota Bulo","year":"2014","journal-title":"Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"B133","doi-asserted-by":"publisher","first-page":"e1249","DOI":"10.1002\/widm.1249","article-title":"Ensemble learning: A survey","volume":"8","author":"Sagi","year":"2018","journal-title":"WIREs Data Min. Knowl. Disc"},{"key":"B134","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1587\/transinf.2019EDP7120","article-title":"Formal verification of a decision-tree ensemble model and detection of its violation ranges","author":"Sato","year":"2020","journal-title":"IEICE Trans. Inf. Syst"},{"key":"B135","first-page":"544","article-title":"Sprint: A scalable parallel classifier for data mining","author":"Shafer","year":"1996","journal-title":"Proceedings of the 22th International Conference on Very Large Data Bases"},{"key":"B136","first-page":"595","article-title":"Implementing decision trees and forests on a gpu","volume-title":"Computer Vision-ECCV 2008, Part IV, Lecture Notes in Computer Science","author":"Sharp","year":"2008"},{"key":"B137","first-page":"35","article-title":"Quantized training of gradient boosting decision trees","author":"Shi","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B138","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/1471-2105-8-25","article-title":"Bias in random forest variable importance measures: Illustrations, sources and a solution","volume":"8","author":"Strobl","year":"2007","journal-title":"BMC Bioinform"},{"key":"B139","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11733492_13","article-title":"Constraint based induction of multi-objective regression trees","author":"Struyf","year":"2006","journal-title":"Proceedings of the 4th International Conference on Knowledge Discovery in Inductive Databases, KDID'05"},{"key":"B140","article-title":"Intriguing properties of neural networks. arXiv:1312.6199","author":"Szegedy","year":"2013"},{"key":"B141","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-36755-1_37","article-title":"Ranking with predictive clustering trees","author":"Todorovski","year":"2002","journal-title":"Proceedings of the 13th European Conference on Machine Learning"},{"key":"B142","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/3097983.3098039","article-title":"Interpretable predictions of tree-based ensembles via actionable feature tweaking","author":"Tolomei","year":"2017","journal-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"B143","doi-asserted-by":"publisher","first-page":"102450","DOI":"10.1016\/j.scico.2020.102450","article-title":"Formal verification of input-output mappings of tree ensembles","volume":"194","author":"T\u00f6rnblom","year":"2020","journal-title":"Sci. Comput. Program"},{"key":"B144","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/1963405.1963461","article-title":"Parallel boosted regression trees for web search ranking","author":"Tyree","year":"2011","journal-title":"Proceedings of the 20th international conference on World Wide Web"},{"key":"B145","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1022699900025","article-title":"Incremental induction of decision trees","volume":"4","author":"Utgoff","year":"1989","journal-title":"Mach. Lear"},{"key":"B146","first-page":"35","article-title":"Fair and optimal decision trees: A dynamic programming approach","author":"van der Linden","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B147","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/FCCM.2012.47","article-title":"Accelerating a random forest classifier: Multi-Core, GP-GPU, or FPGA?","author":"Van Essen","year":"2012","journal-title":"2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines"},{"key":"B148","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-61527-7_33","article-title":"Missing value imputation with MERCS: A faster alternative to missforest","author":"Van Wolputte","year":"2020","journal-title":"Proceedings of the 23rd International Conference, on Discovery Science"},{"key":"B149","doi-asserted-by":"publisher","first-page":"4276","DOI":"10.1609\/aaai.v32i1.11735","article-title":"MERCS: multi-directional ensembles of regression and classification trees","author":"Van Wolputte","year":"2018","journal-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence"},{"key":"B150","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10994-008-5077-3","article-title":"Decision trees for hierarchical multi-label classification","volume":"73","author":"Vens","year":"2008","journal-title":"Mach. Lear"},{"key":"B151","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10601-020-09312-3","article-title":"Learning optimal decision trees using constraint programming","volume":"25","author":"Verhaeghe","year":"2020","journal-title":"Constr. Int. J"},{"key":"B152","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1609\/aaai.v33i01.33011624","article-title":"Learning optimal classification trees using a binary linear program formulation","author":"Verwer","year":"2019","journal-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence"},{"key":"B153","first-page":"10586","article-title":"Efficient training of robust decision trees against adversarial examples","author":"Vos","year":"2021","journal-title":"Proceedings of the 38th International Conference on Machine Learning"},{"key":"B154","doi-asserted-by":"publisher","first-page":"8520","DOI":"10.1609\/aaai.v36i8.20829","article-title":"Robust optimal classification trees against adversarial examples","author":"Vos","year":"2022","journal-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence"},{"key":"B155","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-031-26409-2_13","article-title":"Adversarially robust decision tree relabeling","author":"Vos","year":"2023","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECMLPKDD 2022), Part III"},{"key":"B156","first-page":"10104","article-title":"On Lp-norm robustness of ensemble decision stumps and trees","author":"Wang","year":"2020","journal-title":"Proceedings of the 37th International Conference on Machine Learning"},{"key":"B157","first-page":"35","article-title":"On the safety of interpretable machine learning: A maximum deviation approach","author":"Wei","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B158","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/IPDPS.2018.00033","article-title":"Efficient gradient boosted decision tree training on GPUs","author":"Wen","year":"2018","journal-title":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"},{"key":"B159","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/ChinaGrid.2009.39","article-title":"Mrec4.5: C4.5 ensemble classification with mapreduce","author":"Wu","year":"2009","journal-title":"2009 Fourth ChinaGrid Annual Conference"},{"key":"B160","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1609\/aaai.v32i1.11501","article-title":"Beyond sparsity: Tree regularization of deep models for interpretability","author":"Wu","year":"2018","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"B161","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3523061","article-title":"An efficient learning framework for federated XGBoost using secret sharing and distributed optimization","volume":"13","author":"Xie","year":"2022","journal-title":"ACM Trans. Intell. Syst. Technol"},{"key":"B162","article-title":"Privacy-preserving machine learning: Methods, challenges and directions. arXiv:2108.04417","author":"Xu","year":"2021"},{"key":"B163","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1007\/s10994-021-06094-4","article-title":"One-stage tree: end-to-end tree builder and pruner","volume":"111","author":"Xu","year":"2022","journal-title":"Mach. Lear"},{"key":"B164","first-page":"8588","article-title":"A closer look at accuracy vs. robustness","author":"Yang","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B165","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/3219819.3219857","article-title":"Rapidscorer: Fast tree ensemble evaluation by maximizing compactness in data level parallelization","author":"Ye","year":"2018","journal-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &Data Mining"},{"key":"B166","first-page":"83","volume-title":"Preference Learning, chapter Decision Tree Modeling for Ranking Data","author":"Yu","year":"2011"},{"key":"B167","first-page":"12298","article-title":"Learning binary decision trees by argmin differentiation","author":"Zantedeschi","year":"2021","journal-title":"Proceedings of the 38th International Conference on Machine Learning"},{"key":"B168","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/ICDM.2001.989601","article-title":"A comparison of stacking with meta decision trees to bagging, boosting, and stacking with other methods","author":"\u017denko","year":"2001","journal-title":"Proceedings of the 2001 IEEE International Conference on Data Mining"},{"key":"B169","first-page":"16165","article-title":"An efficient adversarial attack for tree ensembles","author":"Zhang","year":"","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B170","doi-asserted-by":"publisher","first-page":"2957","DOI":"10.1007\/s11280-020-00813-y","article-title":"Decision-based evasion attacks on tree ensemble classifiers","volume":"23","author":"Zhang","year":"","journal-title":"World Wide Web"},{"key":"B171","article-title":"Gpu-acceleration for large-scale tree boosting. arXiv:1706.08359","author":"Zhang","year":"2017"},{"key":"B172","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.24963\/ijcai.2019\/205","article-title":"FAHT: an adaptive fairness-aware decision tree classifier","author":"Zhang","year":"2019","journal-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence"},{"key":"B173","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s11336-014-9413-1","article-title":"Rationale and applications of survival tree and survival ensemble methods","volume":"3","author":"Zhou","year":"2015","journal-title":"Psychometrika"},{"key":"B174","doi-asserted-by":"crossref","DOI":"10.1201\/b12207","volume-title":"Ensemble Methods: Foundations and Algorithms","author":"Zhou","year":"2012"}],"container-title":["Frontiers in Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2023.1124553\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T07:05:46Z","timestamp":1690355146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2023.1124553\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":174,"alternative-id":["10.3389\/frai.2023.1124553"],"URL":"https:\/\/doi.org\/10.3389\/frai.2023.1124553","relation":{},"ISSN":["2624-8212"],"issn-type":[{"value":"2624-8212","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,26]]},"article-number":"1124553"}}