A graph approach to generate all possible regression submodels
From MaRDI portal
Publication:1020883
DOI10.1016/j.csda.2007.02.018zbMath1452.62061OpenAlexW2083978064MaRDI QIDQ1020883
Cristian Gatu, Petko I. Yanev, 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.02.018
Computational methods for problems pertaining to statistics (62-08) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Linear regression; mixed models (62J05)
Related Items
Exact methods for variable selection in principal component analysis: guide functions and pre-selection, 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, Covariate unit root tests with good size and power, Simultaneous feature selection and outlier detection with optimality guarantees, A regression tree algorithm for the identification of convergence clubs, Subset selection in multiple linear regression models: a hybrid of genetic and simulated annealing algorithms, An \(O(N)\) parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice, Editorial: Second special issue on statistical algorithms and software, Unbiased generalized quasi-regression, Serial and parallel implementations of model-based clustering via parsimonious Gaussian mixture models, A fast algorithm for non-negativity model selection, Efficient algorithms for computing the best subset regression models for large-scale problems, Editorial: Special issue on statistical algorithms and software, Bayesian inference in non-homogeneous Markov mixtures of periodic autoregressions with state-dependent exogenous variables, A geometric interpretation of Mallows' \(C_p\) statistic and an alternative plot in variable selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- An alternative approach for the numerical solution of seemingly unrelated regression equations models
- All possible subset regressions using the QR decomposition
- An efficient branch-and-bound strategy for subset vector autoregressive model selection
- Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process
- Efficient algorithms for computing the best subset regression models for large-scale problems
- Parallel reorthogonalization of the QR decomposition after deleting columns
- Algorithms for computing the QR decomposition of a set of matrices with common columns
- Efficient strategies for deriving the subset VAR models
- Developments in Linear Regression Methodology: 1959-1982
- Selection of Subsets of Regression Variables
- Regressions by Leaps and Bounds
- A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
- Branch-and-Bound Methods: A Survey
- Computational Efficiency in the Selection of Regression Variables
- The elements of statistical learning. Data mining, inference, and prediction
- Parallel algorithms for linear models. Numerical methods and estimation problems
