Optimal multivariate decision trees
From MaRDI portal
Publication:6541864
DOI10.1007/s10601-023-09367-yzbMATH Open1547.90123MaRDI QIDQ6541864
Justin J. Boutilier, Zachary Zhou, Carla Michini
Publication date: 21 May 2024
Published in: Constraints (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning optimal decision trees using constraint programming
- Partitioning procedures for solving mixed-variables programming problems
- Constructing optimal binary decision trees is NP-complete
- Logic-based Benders decomposition
- A SAT-based approach to learn explainable decision sets
- Robust trainability of single neurons
- Learning decision trees with flexible constraints and objectives using integer optimization
- Optimal decision trees for categorical data via integer programming
- Sparsity in optimal randomized classification trees
- SAT-based encodings for optimal decision trees with explicit paths
- Optimal randomized classification trees
- Combinatorial Optimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Identifying Minimally Infeasible Subsystems of Inequalities
- Optimal classification trees
- Random forests
- SAT-based optimal classification trees for non-binary data
This page was built for publication: Optimal multivariate decision trees