Optimal classification trees with leaf-branch and binary constraints
From MaRDI portal
Publication:6568424
DOI10.1016/J.COR.2024.106629MaRDI QIDQ6568424FDOQ6568424
Authors: Enhao Liu, Tengmu Hu, Theodore T. Allen, Christoph Hermes
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Scikit-learn: machine learning in Python
- Title not available (Why is that?)
- Random forests
- Supervised classification and mathematical optimization
- Constructing optimal binary decision trees is NP-complete
- Classification and Regression via Integer Optimization
- Optimal classification trees
- Learning optimal decision trees using constraint programming
- Learning decision trees with flexible constraints and objectives using integer optimization
- Column generation based heuristic for learning classification trees
- Pyomo -- optimization modeling in Python
- Optimal randomized classification trees
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568424)