Shattering inequalities for learning optimal decision trees
From MaRDI portal
Publication:2170186
DOI10.1007/978-3-031-08011-1_7zbMath1502.68254OpenAlexW4285132286MaRDI QIDQ2170186
Carla Michini, Justin J. Boutilier, Zachary Zhou
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_7
Related Items
Uses Software
Cites Work
- 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
- Learning decision trees with flexible constraints and objectives using integer optimization
- Optimal decision trees for categorical data via integer programming
- SAT-based encodings for optimal decision trees with explicit paths
- Combinatorial Optimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Identifying Minimally Infeasible Subsystems of Inequalities
- Optimal classification trees
- Random forests
This page was built for publication: Shattering inequalities for learning optimal decision trees