IDEAS home Printed from https://ideas.repec.org/p/sce/scecf2/294.html
   My bibliography  Save this paper

A branch and bound algorithm for computing the best subset regression models

Author

Listed:
  • Cristian Gatu
  • Erricos Kontoghiorghes

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:sce:scecf2:294
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Efstathios Panayi & Gareth Peters, 2014. "Survival Models for the Duration of Bid-Ask Spread Deviations," Papers 1406.5487, arXiv.org.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.

    More about this item

    Keywords

    model selection; least-squares; QR decomposition; branch and bound;
    All these keywords.

    JEL classification:

    • C0 - Mathematical and Quantitative Methods - - General

    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:sce:scecf2:294. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    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.