Optimal classification trees with leaf-branch and binary constraints
From MaRDI portal
Publication:6568424
DOI10.1016/j.cor.2024.106629MaRDI QIDQ6568424
Theodore T. Allen, Tengmu Hu, Christoph Hermes, Enhao Liu
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Supervised classification and mathematical optimization
- Learning optimal decision trees using constraint programming
- Constructing optimal binary decision trees is NP-complete
- Learning decision trees with flexible constraints and objectives using integer optimization
- Column generation based heuristic for learning classification trees
- Optimal randomized classification trees
- Classification and Regression via Integer Optimization
- Optimal classification trees
- Pyomo -- optimization modeling in Python
- Random forests
- Cyber vulnerability maintenance policies that address the incomplete nature of inspection
This page was built for publication: Optimal classification trees with leaf-branch and binary constraints