0143 All subsets regression using a genetic algorithm

Sunday, December 12, 2010: 2:15 PM
Pacific, Salon 5 (Town and Country Hotel and Convention Center)
O. Akman , Department of Mathematics, Illinois State University, Normal, IL
Subset regression procedures have been shown to provide better overall performance than stepwise regression procedures. However it is difficult to use them when a large number of candidate variables exists due to the high computational costs caused by the combinatorial nature of evaluating each potential subset. To resolve this difficulty, the use of Genetic Algorithm search algorithm is proposed to reduce the number of subsets that must be evaluated. We also propose using an information complexity based goodness of fit measure which penalizes over-fitting, a common problem associated with the use of R2.

doi: 10.1603/ICE.2016.46224