IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v52y2007i2p799-815.html
   My bibliography  Save this article

A graph approach to generate all possible regression submodels

Author

Listed:
  • Gatu, Cristian
  • Yanev, Petko I.
  • Kontoghiorghes, Erricos J.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:csdana:v:52:y:2007:i:2:p:799-815
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(07)00074-6
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kontoghiorghes, E. J. & Clarke, M. R. B., 1995. "An alternative approach for the numerical solution of seemingly unrelated regression equations models," Computational Statistics & Data Analysis, Elsevier, vol. 19(4), pages 369-377, April.
    2. Martin S. Ridout, 1988. "An Improved Branch and Bound Algorithm for Feature Subset Selection," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 37(1), pages 139-147, March.
    3. Cristian Gatu & Erricos Kontoghiorghes, 2005. "Efficient strategies for deriving the subset VAR models," Computational Management Science, Springer, vol. 4(4), pages 253-278, November.
    4. 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.
    5. M. R. B. Clarke, 1981. "A Givens Algorithm for Moving from One Linear Model to Another Without Going Back to the Data," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 30(2), pages 198-203, June.
    6. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    7. 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.
    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. 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.
    10. Smith, D. M. & Bremner, J. M., 1989. "All possible subset regressions using the QR decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 7(3), pages 217-235, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. Fossati, Sebastian, 2012. "Covariate unit root tests with good size and power," Computational Statistics & Data Analysis, Elsevier, vol. 56(11), pages 3070-3079.
    3. McNicholas, P.D. & Murphy, T.B. & McDaid, A.F. & Frost, D., 2010. "Serial and parallel implementations of model-based clustering via parsimonious Gaussian mixture models," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 711-723, March.
    4. Luca Insolia & Ana Kenney & Francesca Chiaromonte & Giovanni Felici, 2022. "Simultaneous feature selection and outlier detection with optimality guarantees," Biometrics, The International Biometric Society, vol. 78(4), pages 1592-1603, December.
    5. Brusco, Michael J., 2014. "A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis," Computational Statistics & Data Analysis, Elsevier, vol. 77(C), pages 38-53.
    6. Yang, Guijun & Wang, Zhigang & Deng, Wei, 2010. "Unbiased generalized quasi-regression," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 779-789, March.
    7. Paroli, Roberta & Spezia, Luigi, 2008. "Bayesian inference in non-homogeneous Markov mixtures of periodic autoregressions with state-dependent exogenous variables," Computational Statistics & Data Analysis, Elsevier, vol. 52(5), pages 2311-2330, January.
    8. Smirnov, Oleg A. & Anselin, Luc E., 2009. "An O(N) parallel method of computing the Log-Jacobian of the variable transformation for models with spatial interaction on a lattice," Computational Statistics & Data Analysis, Elsevier, vol. 53(8), pages 2980-2988, June.
    9. Siniksaran, Enis, 2008. "A geometric interpretation of Mallows' Cp statistic and an alternative plot in variable selection," Computational Statistics & Data Analysis, Elsevier, vol. 52(7), pages 3459-3467, March.
    10. Postiglione, Paolo & Benedetti, Roberto & Lafratta, Giovanni, 2010. "A regression tree algorithm for the identification of convergence clubs," Computational Statistics & Data Analysis, Elsevier, vol. 54(11), pages 2776-2785, November.
    11. Pacheco, Joaquín & Casado, Silvia & Porras, Santiago, 2013. "Exact methods for variable selection in principal component analysis: Guide functions and pre-selection," Computational Statistics & Data Analysis, Elsevier, vol. 57(1), pages 95-111.
    12. 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.

    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. 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.
    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. Shafik, Nivien & Tutz, Gerhard, 2009. "Boosting nonlinear additive autoregressive time series," Computational Statistics & Data Analysis, Elsevier, vol. 53(7), pages 2453-2464, May.
    5. Kapetanios, George, 2007. "Variable selection in regression models using nonstandard optimisation of information criteria," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 4-15, September.
    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. Fossati, Sebastian, 2012. "Covariate unit root tests with good size and power," Computational Statistics & Data Analysis, Elsevier, vol. 56(11), pages 3070-3079.
    8. Coşar Gözükırmızı & Metin Demiralp, 2019. "Solving ODEs by Obtaining Purely Second Degree Multinomials via Branch and Bound with Admissible Heuristic," Mathematics, MDPI, vol. 7(4), pages 1-23, April.
    9. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    10. Paolo Foschi & Erricos J. Kontoghiorghes, 2003. "Estimation of VAR Models: Computational Aspects," Computational Economics, Springer;Society for Computational Economics, vol. 21(1_2), pages 3-22, February.
    11. Amine Lamine & Mahdi Khemakhem & Brahim Hnich & Habib Chabchoub, 2016. "Solving constrained optimization problems by solution-based decomposition search," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 672-695, October.
    12. Siniksaran, Enis, 2008. "A geometric interpretation of Mallows' Cp statistic and an alternative plot in variable selection," Computational Statistics & Data Analysis, Elsevier, vol. 52(7), pages 3459-3467, March.
    13. Weiqiang Pan & Zhilong Shan & Ting Chen & Fangjiong Chen & Jing Feng, 2016. "Optimal pilot design for OFDM systems with non-contiguous subcarriers based on semi-definite programming," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(2), pages 297-305, October.
    14. Coakley, Jerry & Fuertes, Ana-Maria & Smith, Ron, 2006. "Unobserved heterogeneity in panel time series models," Computational Statistics & Data Analysis, Elsevier, vol. 50(9), pages 2361-2380, May.
    15. Wang, Hao, 2010. "Sparse seemingly unrelated regression modelling: Applications in finance and econometrics," Computational Statistics & Data Analysis, Elsevier, vol. 54(11), pages 2866-2877, November.
    16. Pacheco, Joaquín & Casado, Silvia & Núñez, Laura, 2009. "A variable selection method based on Tabu search for logistic regression models," European Journal of Operational Research, Elsevier, vol. 199(2), pages 506-511, December.
    17. Drexl, Andreas, 1990. "Scheduling of project networks by job assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 247, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Yi-Feng Hung & Wei-Chih Chen, 2011. "A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm," Journal of Global Optimization, Springer, vol. 51(1), pages 133-148, September.
    19. Fox, B. L. & Lenstra, J. K. & Rinnooy Kan, A. H. G. & Schrage, L. E., 1977. "Branching From The Largest Upper Bound: Folklore And Facts," Econometric Institute Archives 272158, Erasmus University Rotterdam.
    20. Efstathios Panayi & Gareth Peters, 2014. "Survival Models for the Duration of Bid-Ask Spread Deviations," Papers 1406.5487, arXiv.org.

    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:eee:csdana:v:52:y:2007:i:2:p:799-815. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.