Sparsity in optimal randomized classification trees
From MaRDI portal
Publication:2301963
DOI10.1016/j.ejor.2019.12.002zbMath1441.62163arXiv2002.09191OpenAlexW2996305695WikidataQ126561979 ScholiaQ126561979MaRDI QIDQ2301963
Dolores Romero Morales, Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río
Publication date: 25 February 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.09191
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (14)
Mathematical optimization in classification and regression trees ⋮ The backbone method for ultra-high dimensional sparse machine learning ⋮ On sparse optimal regression trees ⋮ Margin optimal classification trees ⋮ Interpretable clustering via soft clustering trees ⋮ Proximal variable metric method with spectral diagonal update for large scale sparse optimization ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods ⋮ On optimal regression trees to detect critical intervals for multivariate functional data ⋮ On sparse ensemble methods: an application to short-term predictions of the evolution of COVID-19 ⋮ Unnamed Item ⋮ Optimization problems for machine learning: a survey ⋮ Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution ⋮ On constrained smoothing and out-of-range prediction using \(P\)-splines: a conic optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Supervised classification and mathematical optimization
- Supersparse linear integer models for optimized medical scoring systems
- Auction optimization using regression trees and linear models as integer programs
- Constructing optimal binary decision trees is NP-complete
- Optimization approaches to supervised classification
- Learning decision trees with flexible constraints and objectives using integer optimization
- Optimal decision trees for categorical data via integer programming
- Operations research and data mining
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A random forest guided tour
- Comprehensible credit scoring models using rule extraction from support vector machines
- Optimal randomized classification trees
- Using Neural Network Rule Extraction and Decision Tables for Credit-Risk Evaluation
- Optimal classification trees
- Pyomo -- optimization modeling in Python
- Random forests
This page was built for publication: Sparsity in optimal randomized classification trees