Learning optimal decision trees using constraint programming

DOI10.1007/s10601-020-09312-3OpenAlexW3096182600MaRDI QIDQ823772

Hélène Verhaeghe, Gilles Pesant, Siegfried Nijssen, Pierre Schaus, Claude-Guy Quimper

Publication date: 16 December 2021

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-020-09312-3

zbMATH Keywords

decision treecachingand/or search treeCoverSize

Mathematics Subject Classification ID

Statistics (62-XX) Applications of statistics (62Pxx) Multivariate analysis (62Hxx)

Related Items

Learning optimal decision trees using constraint programming, On Tackling Explanation Redundancy in Decision Trees, bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition, Shattering inequalities for learning optimal decision trees, SAT-based optimal classification trees for non-binary data, On optimal regression trees to detect critical intervals for multivariate functional data, Unnamed Item, Optimal policy trees, Optimal survival trees, Learning Optimal Decision Sets and Lists with SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Learning optimal decision trees using constraint programming
• AND/OR search spaces for graphical models
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Constructing optimal binary decision trees is NP-complete
• A SAT-based approach to learn explainable decision sets
• Lower bounds on learning decision lists and trees
• MiniCP: a lightweight solver for constraint programming
• An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
• Elements of Information Theory
• Embedding Decision Trees and Random Forests in Constraint Programming
• Principles and Practice of Constraint Programming – CP 2004
• Optimal classification trees