ALL SUBSETS REGRESSION USING A GENETIC SEARCH ALGORITHM

Citation
Gs. Wasserman et A. Sudjianto, ALL SUBSETS REGRESSION USING A GENETIC SEARCH ALGORITHM, Computers & industrial engineering, 27(1-4), 1994, pp. 489-492
Citations number
17
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Interdisciplinary Applications","Engineering, Industrial
ISSN journal
03608352
Volume
27
Issue
1-4
Year of publication
1994
Pages
489 - 492
Database
ISI
SICI code
0360-8352(1994)27:1-4<489:ASRUAG>2.0.ZU;2-6
Abstract
Subset regression procedures have been shown to provide better overall performance than stepwise regression procedures. However, it is diffi cult to use them when a large number of candidate variables exists. Th is is due to the high computational costs associated with the combinat orial nature of evaluating each potential subset. To resolve this diff iculty, the use of a ''Genetic Algorithm'' (GA), a global optimization search procedure, is proposed to reduce the number of subsets which m ust be evaluated. Any of a number of popular criteria, including Mallo ws' Cp, MSE, R(2), AIC, etc., can be used to drive the search strategy associated with GA. Several illustrated examples on its use are provi ded.