Efficient algorithms for computing the best subset regression models for large-scale problems
No abstract is available for this item.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Cristian Gatu & Erricos Kontoghiorghes, 2005. "Efficient strategies for deriving the subset VAR models," Computational Management Science, Springer, vol. 4(4), pages 253-278, November.
- Gatu, Cristian & Yanev, Petko I. & Kontoghiorghes, Erricos J., 2007. "A graph approach to generate all possible regression submodels," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 799-815, October.
- Fan J. & Li R., 2001. "Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1348-1360, December.
- Smith, D. M. & Bremner, J. M., 1989. "All possible subset regressions using the QR decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 7(3), pages 217-235, February.