All possible subset regressions using the triangular decomposition
From MaRDI portal
Recommendations
- Computational efficiency in all possible regressions
- scientific article; zbMATH DE number 4106066
- A graph approach to generate all possible regression submodels
- Efficient algorithms for computing the best subset regression models for large-scale problems
- Subset Regression with Stepwise Directed Search
Cites work
- Algorithm AS 164: Least Squares Subject to Linear Constraints
- All Possible Regressions with Less Computation
- All possible subset regressions using the QR decomposition
- scientific article; zbMATH DE number 3678917 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Least squares computations based on the cholesky decomposition of the correlation matrix
- Regressions by Leaps and Bounds
- The Cholesky Factorization of the Inverse Correlation or Covariance Matrix in Multiple Regression
Cited in
(6)- A graph approach to generate all possible regression submodels
- Complete subset regressions
- Complete subset regressions with large-dimensional sets of predictors
- Simultaneous variable selection and outlier identification in linear regression using the mean-shift outlier model
- Computational efficiency in all possible regressions
- scientific article; zbMATH DE number 4106066 (Why is no real title available?)
This page was built for publication: All possible subset regressions using the triangular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493703)
