Efficient algorithms for computing the best subset regression models for large-scale problems

DOI10.1016/j.csda.2007.03.017zbMath1452.62497OpenAlexW2111289335MaRDI QIDQ1020780

Marc Hofmann, Cristian Gatu, Erricos John Kontoghiorghes

Publication date: 2 June 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2007.03.017

zbMATH Keywords

branch-and-bound algorithmregression treebest-subset regression

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Linear regression; mixed models (62J05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (23)

Exact methods for variable selection in principal component analysis: guide functions and pre-selection ⋮ Group subset selection for linear regression ⋮ A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ An efficient branch-and-bound strategy for subset vector autoregressive model selection ⋮ Mixed integer second-order cone programming formulations for variable selection in linear regression ⋮ Covariate unit root tests with good size and power ⋮ Two-stage least squares and indirect least squares algorithms for simultaneous equations models ⋮ A regression tree algorithm for the identification of convergence clubs ⋮ Fast robust estimation of prediction error based on resampling ⋮ Bayesian variable selection and model averaging in the arbitrage pricing theory model ⋮ Autoregressive prediction with rolling mechanism for time series forecasting with small sample size ⋮ A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. ⋮ Boosting nonlinear additive autoregressive time series ⋮ Unbiased generalized quasi-regression ⋮ A fast algorithm for non-negativity model selection ⋮ Editorial: 2nd special issue on applications of optimization heuristics to estimation and modelling problems ⋮ Variable selection in regression models using nonstandard optimisation of information criteria ⋮ A graph approach to generate all possible regression submodels ⋮ Bayesian inference in non-homogeneous Markov mixtures of periodic autoregressions with state-dependent exogenous variables ⋮ On properties of predictors derived with a two-step bootstrap model averaging approach -- a simulation study in the linear regression model ⋮ A geometric interpretation of Mallows' \(C_p\) statistic and an alternative plot in variable selection ⋮ Robust model selection using fast and robust bootstrap ⋮ Robust subset selection

Uses Software

• R
• SenSrivastava
• AS 163
• AS 199

Cites Work

• All possible subset regressions using the QR decomposition
• A graph approach to generate all possible regression submodels
• Efficient strategies for deriving the subset VAR models
• Better Subset Regression Using the Nonnegative Garrote
• Regressions by Leaps and Bounds
• A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
• A Branch and Bound Algorithm for Feature Subset Selection
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• The elements of statistical learning. Data mining, inference, and prediction
• Parallel algorithms for linear models. Numerical methods and estimation problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for computing the best subset regression models for large-scale problems