Supersparse linear integer models for optimized medical scoring systems
From MaRDI portal
Abstract: Scoring systems are linear classification models that only require users to add, subtract and multiply a few small numbers in order to make a prediction. These models are in widespread use by the medical community, but are difficult to learn from data because they need to be accurate and sparse, have coprime integer coefficients, and satisfy multiple operational constraints. We present a new method for creating data-driven scoring systems called a Supersparse Linear Integer Model (SLIM). SLIM scoring systems are built by solving an integer program that directly encodes measures of accuracy (the 0-1 loss) and sparsity (the -seminorm) while restricting coefficients to coprime integers. SLIM can seamlessly incorporate a wide range of operational constraints related to accuracy and sparsity, and can produce highly tailored models without parameter tuning. We provide bounds on the testing and training accuracy of SLIM scoring systems, and present a new data reduction technique that can improve scalability by eliminating a portion of the training data beforehand. Our paper includes results from a collaboration with the Massachusetts General Hospital Sleep Laboratory, where SLIM was used to create a highly tailored scoring system for sleep apnea screening
Recommendations
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/153244303322753616
- A combinatorial approach to the classification problem
- A lasso for hierarchical interactions
- Advanced Lectures on Machine Learning
- Analysis of the consistency of a mixed integer programming-based multi-category constrained discriminant model
- Binarized support vector machines
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Fine-scale statistics for the multidimensional Farey sequence
- Integer Programming Solution of a Classification Problem
- Integer programming methods for normalisation and variable selection in mathematical programming discriminant analysis models
- Least angle regression. (With discussion)
- Mathematical Programming for Data Mining: Formulations and Challenges
- Mathematical programming formulations for two-group classification with binary variables
- Misclassification minimization
- Regularization and Variable Selection Via the Elastic Net
- Scenario reduction in stochastic programming
- Scenarios for multistage stochastic programs
- Selection of Subsets of Regression Variables
- Solving mixed integer classification problems by decomposition
- Sparse weighted voting classifier selection and its linear programming relaxations
- Structured variable selection with sparsity-inducing norms
- Support Vector Machines with the Ramp Loss and the Hard Margin Loss
Cited in
(39)- Multiple criteria sorting models and methods. I: Survey of the literature
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- scientific article; zbMATH DE number 7415080 (Why is no real title available?)
- Mathematical optimization in classification and regression trees
- On mathematical optimization for clustering categories in contingency tables
- Visualizing the Implicit Model Selection Tradeoff
- Learning certifiably optimal rule lists for categorical data
- Rank-one convexification for sparse regression
- Learning decision catalogues for situated decision making: the case of scoring systems
- Probabilistic scoring lists for interpretable machine learning
- Interpretable optimisation-based approach for hyper-box classification
- Optimal randomized classification trees
- A semidefinite programming method for integer convex quadratic minimization
- scientific article; zbMATH DE number 7378706 (Why is no real title available?)
- scientific article; zbMATH DE number 7387624 (Why is no real title available?)
- A framework for inherently interpretable optimization models
- scientific article; zbMATH DE number 7415078 (Why is no real title available?)
- Sparsity in optimal randomized classification trees
- A guided tour of multiple criteria sorting models and methods
- High dimensional data classification and feature selection using support vector machines
- Towards a trade-off of interpretability, accuracy and scalability: enhanced formulations in linear classification models
- The backbone method for ultra-high dimensional sparse machine learning
- Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
- Investigating consumers' store-choice behavior via hierarchical variable selection
- A survey on the explainability of supervised machine learning
- How to find a good explanation for clustering?
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Designing and computing explanations for comparisons inferred from an additive value model
- Explainable and interpretable machine learning and data mining
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Sparse SVM with hard-margin loss: a Newton-augmented Lagrangian method in reduced dimensions
- Learning optimized risk scores
- Disjunctive Rule Lists
- Best subset selection via cross-validation criterion
- A decision-theoretic approach for model interpretability in Bayesian framework
- Learning non-compensatory sorting models using efficient SAT/MaxSAT formulations
- Algorithms for the unit-cost stochastic score classification problem
- Learning customized and optimized lists of rules with mathematical programming
- On sparse optimal regression trees
This page was built for publication: Supersparse linear integer models for optimized medical scoring systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506427)
