IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v57y2010i1p33-44.html
   My bibliography  Save this article

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

Author

Listed:
  • Michael J. Brusco
  • Douglas Steinley

Abstract

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. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010

Suggested Citation

  • Michael J. Brusco & Douglas Steinley, 2010. "Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 33-44, February.
    • Handle: RePEc:wly:navres:v:57:y:2010:i:1:p:33-44
    DOI: 10.1002/nav.20380
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20380
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20380?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Cristian Gatu & Erricos Kontoghiorghes, 2002. "A branch and bound algorithm for computing the best subset regression models," Computing in Economics and Finance 2002 294, Society for Computational Economics.
    2. J. A. Nelder, 2000. "Functional marginality and response-surface fitting," Journal of Applied Statistics, Taylor & Francis Journals, vol. 27(1), pages 109-112.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Efstathios Panayi & Gareth Peters, 2014. "Survival Models for the Duration of Bid-Ask Spread Deviations," Papers 1406.5487, arXiv.org.
    2. Øyvind Langsrud & Kjetil Jørgensen & Ragni Ofstad & Tormod Næs, 2007. "Analyzing Designed Experiments with Multiple Responses," Journal of Applied Statistics, Taylor & Francis Journals, vol. 34(10), pages 1275-1296.
    3. W. M. Tang & K. F. C. Yiu & H. Wong, 2020. "Subset Selection Using Frequency Decomposition with Applications," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 19(01), pages 195-220, March.
    4. Gatu, Cristian & Kontoghiorghes, Erricos J., 2006. "Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process," Journal of Economic Dynamics and Control, Elsevier, vol. 30(5), pages 721-739, May.
    5. Gatu, Cristian & Kontoghiorghes, Erricos J. & Gilli, Manfred & Winker, Peter, 2008. "An efficient branch-and-bound strategy for subset vector autoregressive model selection," Journal of Economic Dynamics and Control, Elsevier, vol. 32(6), pages 1949-1963, June.
    6. Hofmann, Marc & Gatu, Cristian & Kontoghiorghes, Erricos John, 2007. "Efficient algorithms for computing the best subset regression models for large-scale problems," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 16-29, September.
    7. Hofmann, Marc & Kontoghiorghes, Erricos John, 2010. "Matrix strategies for computing the least trimmed squares estimation of the general linear and SUR models," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3392-3403, December.
    8. Gatu, Cristian & Yanev, Petko I. & Kontoghiorghes, Erricos J., 2007. "A graph approach to generate all possible regression submodels," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 799-815, October.
    9. Khan, Jafar A. & Van Aelst, Stefan & Zamar, Ruben H., 2007. "Building a robust linear model with forward selection and stepwise procedures," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 239-248, September.
    10. Andreas Alfons & Wolfgang Baaske & Peter Filzmoser & Wolfgang Mader & Roland Wieser, 2011. "Robust variable selection with application to quality of life research," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 20(1), pages 65-82, March.
    11. Gluzmann, Pablo & Guzman, Martin, 2017. "Assessing the robustness of the relationship between financial reforms and banking crises," Journal of International Financial Markets, Institutions and Money, Elsevier, vol. 49(C), pages 32-47.
    12. repec:jss:jstsof:34:i12 is not listed on IDEAS

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:57:y:2010:i:1:p:33-44. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.