New optimization models for optimal classification trees
From MaRDI portal
Publication:6551126
Cites work
- Benchmarking optimization software with performance profiles.
- Column generation based heuristic for learning classification trees
- Constructing optimal binary decision trees is NP-complete
- Greedy function approximation: A gradient boosting machine.
- HHCART: an oblique decision tree
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 1149432 (Why is no real title available?)
- scientific article; zbMATH DE number 1779487 (Why is no real title available?)
- scientific article; zbMATH DE number 7625179 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improving the precision of classification trees
- Linear programming support vector machines
- L’algebre de Boole et ses applications en recherche operationnelle
- Margin optimal classification trees
- Multivariate classification trees based on minimum features discrete support vector machines
- Multivariate decision trees
- Optimal classification trees
- Optimal randomized classification trees
- Random forests
- Robust optimal classification trees under noisy labels
Cited in
(3)
This page was built for publication: New optimization models for optimal classification trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551126)