Learning optimal decision trees using constraint programming
From MaRDI portal
Publication:823772
DOI10.1007/S10601-020-09312-3OpenAlexW3096182600MaRDI QIDQ823772FDOQ823772
Authors: Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus
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
Cites Work
- MiniCP: a lightweight solver for constraint programming
- Title not available (Why is that?)
- Elements of Information Theory
- Handbook of constraint programming.
- An evolutionary algorithm for polishing mixed integer programming solutions
- Constructing optimal binary decision trees is NP-complete
- AND/OR search spaces for graphical models
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Embedding decision trees and random forests in constraint programming
- Lower bounds on learning decision lists and trees
- A SAT-based approach to learn explainable decision sets
- Principles and Practice of Constraint Programming – CP 2004
- Optimal classification trees
- Learning optimal decision trees using constraint programming
Cited In (17)
- Learning optimal decision trees using constraint programming
- Optimal policy trees
- An improved column-generation-based matheuristic for learning classification trees
- Optimal classification trees with leaf-branch and binary constraints
- Title not available (Why is that?)
- Learning Optimal Decision Sets and Lists with SAT
- Using POMDPs for learning cost sensitive decision trees
- On optimal regression trees to detect critical intervals for multivariate functional data
- SAT-based optimal classification trees for non-binary data
- Learning decision trees with flexible constraints and objectives using integer optimization
- On Tackling Explanation Redundancy in Decision Trees
- bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
- An optimal constrained pruning strategy for decision trees
- Shattering inequalities for learning optimal decision trees
- Optimal survival trees
- Optimal multivariate decision trees
- Algorithms for learning parsimonious context trees
This page was built for publication: Learning optimal decision trees using constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q823772)