Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression

Naval Research Logistics

Volumn 57, Issue 1, 2010, Pages 33-44

  Brusco, Michael J ^a   Steinley, Douglas ^b  

^a FLORIDA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

Author keywords

Polynomial regression; Subset regression; Tabu search; Variable neighborhood search

Indexed keywords

COMPUTATION TIME; DATA SETS; HEURISTIC PROCEDURES; MULTIPLE REGRESSIONS; NEIGHBORHOOD SEARCH; POLYNOMIAL REGRESSION; REGRESSION PARAMETERS; SIMULATION STUDIES; SUBSET SELECTION; SYNTHETIC DATASETS; VARIABLE NEIGHBORHOOD SEARCH;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS; REGRESSION ANALYSIS; SET THEORY;

TABU SEARCH;

EID: 75149194432     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20380     Document Type: Article

References (37)

1. H. Aikake, A new look at the statistical identification model, IEEE Trans Auto Control 19 (1974), 716-723.
2. R.D. Armstrong and P.O. Beck, Penalty calculations and branching rules in a LAV best subset procedure, Naval Res Log Q 32 (1985), 407-415.
3. E.M.L. Beale, M.G. Kendall, and D.W. Mann, The discarding of variables in multivariate analysis, Biometrika 54 (1967), 357-366.
4. L. Breiman, Better subset regression using the nonnegative garrote, Technometrics 37 (1995), 373-384.
5. M.J. Brusco and S. Stahl, "Branch-and-bound applications in combinatorial data analysis," Springer, New York, 2005.
6. M.J. Brusco, D. Steinley, and J.D. Cradit, An exact algorithm for hierarchically well-formulated subsets in second-order polynomial regression, Technometrics 51 (2009), 306-315.
7. H. Chipman, M. Hamada, and C.F.J. Wu, A Bayesian variabl-selection approach for analyzing designed experiments with complex aliasing, Technometrics 39 (1997), 372-381.
8. R. Cook, Exploring partial residual plots, Technometrics 35 (1993), 351-362.
9. Z. Drezner and G.A. Marcoulides, Tabu search model selection in multiple regression analysis, Commun Stat Simul Comp 28 (1999), 349-367.
10. B. Efron, I. Johnstone, T. Hastie, and R. Tibshirani, Least angle regression (with discussion), Ann Stat 32 (2004), 407-499.
11. D.D. Frey and X. Li, Using hierarchical probability models to evaluate robust parameter design methods, J Qual Tech 40 (2008), 59-77.
12. J. Friedman and B. Silverman, Flexible parsimonious smoothing and additive modeling (with discussion), Technometrics 31 (1989), 3-40.
13. G.M. Furnival and R.W. Wilson, Regression by leaps and bounds, Technometrics 16 (1974), 499-512.
14. C. Gatu and E.J. Kontoghiorghes, Branch-and-bound algorithms for computing the best-subset regression models, J Comp Graph Stat 15 (2006), 139-156.
15. F. Glover and M. Laguna, "Tabu search," in: Modern heuristic techniques for combinatorial problems, C. Reeves (Editor), Blackwell, Oxford, 1993, pp. 70-141.
16. D.E. Goldberg, "Genetic algorithms in search, optimization, and machine learning," Addison-Wesley, New York, 1989.
17. G.L. Griepentrog, J.M. Ryan, and L.D. Smith, Linear transformations of polynomial regression models, Am Stat 36 (1982), 171-174.
18. Hansen P. and N. Mladenović, "Variable neighborhood search," Glover F.W. and Kochenberger G.A. (Editors), Kluwer, Norwell, Massachusetts, 2003, pp. 145-184.
19. T. Hastie and R. Tibshirani, "Generalized additive models," Chapman and Hall, New York, 1990.
20. T. Hastie, R. Tibshirani, and J. Friedman, "The elements of statistical learning: Data mining, inference, and prediction," 2nd ed., Springer-Verlag, New York, 2009.
21. R.R. Hocking and R.N. Leslie, Selection of the best subset in regression analysis, Technometrics 9 (1967), 531-540.
22. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671-680.
23. L.R. LaMotte and R.R. Hocking, Computational efficiency in the selection of regression variables, Technometrics 12 (1970), 83-93.
24. MathWorks, Inc., Using MATLAB (Version 7), The Math-Works, Inc, Natick, MA, 2005.
25. A.J. Miller, Subset selection in regression, 2nd ed., Chapman and Hall, London, 2002.
26. N. Mladenović and P. Hansen, Variable neighborhood search, Comp Oper Res 24 (1997), 1097-1100.
27. J.A. Nelder, Functional marginality and response-surface fitting, J Appl Stat 27 (2000), 109-112.
28. S.H. Ng and S.E. Chick, Design of follow-up experiments for improving model discrimination and parameter estimation, Naval Res Log 51 (2004), 1129-1148.
29. A. Ozol-Godfrey, C.M. Anderson-Cook, and D.C. Montgomery, Fraction of design space plots for examining model robustness, J Qual Tech 37 (2005), 223-235.
30. J.L. Peixoto, Hierarchical variable selection in polynomial regression models, Am Stat 41 (1987), 311-313.
31. J.L. Peixoto, A property of well-formulated polynomial regression models, Am Stat 44 (1990), 26-30.
32. G. Schwartz, Estimating the dimension of a model, Ann Stat 6 (1978), 461-464.
33. D.M. Smith, Algorithm AS 268, All possible subset regressions using the QR decomposition, Appl Stat 40 (1991), 502-513.
34. J.M. Sutter and J.H. Kalivas, Comparison of forward selection, backward elimination, and generalized simulated annealing for variable selection, Microchem J 47 (1993), 60-66.
35. R. Tibshirani, Regression shrinkage and selection via the lasso, J R Stat Soc B 58 (1996), 267-288.
36. M. Yuan, V.R. Joseph, and Y. Lin, An efficient variable selection approach for analyzing designed experiments, Technometrics 49 (2007), 430-439.
37. M. Zhu and H.A. Chipman, Darwinian evolution in parallel universes: A parallel genetic algorithm for variable selection, Technometrics 48 (2006), 491-502.