Loss-optimal classification trees: a generalized framework and the logistic case
From MaRDI portal
Publication:6592928
Recommendations
Cites work
- A brief history of linear and mixed-integer programming computation
- A Recursive Partitioning Decision Rule for Nonparametric Classification
- An improved column-generation-based matheuristic for learning classification trees
- Benchmarking optimization software with performance profiles.
- Constructing optimal binary decision trees is NP-complete
- Feature subset selection for logistic regression via mixed integer optimization
- 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 845714 (Why is no real title available?)
- Logistic model trees
- Margin optimal classification trees
- Margin trees for high-dimensional classification
- Mathematical optimization in classification and regression trees
- Multivariate classification trees based on minimum features discrete support vector machines
- Multivariate decision trees
- New optimization models for optimal classification trees
- On sparse optimal regression trees
- Optimal classification trees
- Optimal decision trees for categorical data via integer programming
- Optimal randomized classification trees
- Optimization with sparsity-inducing penalties
- Random forests
- Scikit-learn: machine learning in Python
- Sparsity in optimal randomized classification trees
- Support-vector networks
- The Elements of Statistical Learning
- Trading accuracy for simplicity in decision trees
- Tree-Structured Classification Via Generalized Discriminant Analysis
This page was built for publication: Loss-optimal classification trees: a generalized framework and the logistic case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6592928)