Computational Efficiency in the Selection of Regression Variables

DOI10.2307/1267353MaRDI QIDQ5590518zbMATH OpenOpenAlexFDO

Authors Ronald R. Hocking, Lynn Roy La Motte

Publication date 1970

Published in Technometrics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1267353

zbMATH Keywords

statistics

Cited in

(10)

• A graph approach to generate all possible regression submodels
• Analysis of the Kleiser-Schumann method
• Sir Clive W. J. Granger model selection
• Tabu Search Variable Selection with Resource Constraints
• Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression
• ON THE RECURSIVE FITTING OF SUBSET AUTOREGRESSIONS
• Computational efficiency in all possible regressions
• A multistage algorithm for best-subset model selection based on the Kullback-Leibler discrepancy
• A variable selection procedure for econometric models
• A direct derivation of the REML likelihood function

This page was built for publication: Computational Efficiency in the Selection of Regression Variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590518)