Optimal classification trees with leaf-branch and binary constraints

DOI10.1016/J.COR.2024.106629MaRDI QIDQ6568424zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106629

zbMATH Keywords

machine learningdecision tree modelmixed Integer optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• Classification and Regression via Integer Optimization
• Column generation based heuristic for learning classification trees
• Constructing optimal binary decision trees is NP-complete
• Cyber vulnerability maintenance policies that address the incomplete nature of inspection
• Learning decision trees with flexible constraints and objectives using integer optimization
• Learning optimal decision trees using constraint programming
• Optimal classification trees
• Optimal randomized classification trees
• Pyomo -- optimization modeling in Python
• Random forests
• Scikit-learn: machine learning in Python
• Supervised classification and mathematical optimization

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)