An effective procedure for feature subset selection in logistic regression based on information criteria
From MaRDI portal
Publication:2044566
DOI10.1007/s10589-021-00288-1zbMath1472.62120OpenAlexW3175414514MaRDI QIDQ2044566
Enrico Civitelli, Alessio Sortino, Matteo Lapucci, Fabio Schoen
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00288-1
logistic regressioninformation criterionblock coordinate descentbest subset selectionsparse optimization
Computational methods for problems pertaining to statistics (62-08) Generalized linear models (logistic models) (62J12) Mixed integer programming (90C11) Linear programming (90C05)
Related Items
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems, An automated exact solution framework towards solving the logistic regression best subset selection problem, Mixed-integer quadratic programming reformulations of multi-task learning models
Uses Software
Cites Work
- LIBLINEAR
- Best subset selection via a modern optimization lens
- Feature subset selection for logistic regression via mixed integer optimization
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- On constrained and regularized high-dimensional regression
- On the limited memory BFGS method for large scale optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Concave programming for minimizing the zero-norm over polyhedral sets
- Estimating the dimension of a model
- Logistic regression: from art to science
- Akaike's information criterion and recent developments in information complexity
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
- Information criteria and statistical modeling.
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Optimization with Sparsity-Inducing Penalties
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- 10.1162/153244303322753751
- An Introduction to Statistical Learning
- Applied Logistic Regression
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Sparse Approximation via Penalty Decomposition Methods
- High Dimensional Thresholded Regression and Shrinkage Effect
- Convergence of a block coordinate descent method for nondifferentiable minimization
- A new look at the statistical model identification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
