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

A graph approach to generate all possible subset regression models

Author

Listed:
  • Cristian Gatu

    (Computer Science Department University of Neuchatel)

  • Petko Yanev

    (CNR, Italy)

  • Erricos J. Kontoghiorghes

    (University of Cyprus)

Abstract

A regression graph which can be employed to enumerate and evaluate all possible subset regression models is introduced. The graph can be seen as a generalization of a previously introduced regression tree. Specifically, the regression tree describes a non-unique shortest path for traversing the graph. Furthermore, all the subtrees of the graph containing all the nodes are equivalent in the sense that they provide all subset models with the same minimum computational complexity. Complexity measures of generating all sub-models by traversing the regression graph are presented. The relationship between the regression graph and the regression trees is investigated. That is, it shows how the various minimum spanning (regression) trees can be obtained from the regression graph. The merits of the derived regression trees are discussed. A branch-and-bound strategy that computes the best subset models without traversing the whole graph is described

Suggested Citation

  • Cristian Gatu & Petko Yanev & Erricos J. Kontoghiorghes, 2006. "A graph approach to generate all possible subset regression models," Computing in Economics and Finance 2006 282, Society for Computational Economics.
    • Handle: RePEc:sce:scecfa:282
    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.

    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:scecfa:282. 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.