Neighborhood Search Heuristics for Selecting Hierarchically Well-Formulated Subsets in Polynomial Regression

作者：Brusco Michael J^*; Steinley Douglas

来源：Naval Research Logistics, 2010, 57(1): 33-44.

DOI：10.1002/nav.20380

• polynomial regression
• subset regression
• tabu search
• variable neighborhood search

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well-formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets.

• 出版日期2010-2