IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v1y2005i1-2p123-144.html
   My bibliography  Save this article

An implicit enumeration algorithm for mining high dimensional data

Author

Listed:
  • Xinli Bao
  • Hamparsum Bozdogan
  • Vuttichai Chatpattananan
  • Kenneth Gilbert

Abstract

Model selection is an important problem in mining information from large data bases. For example, in selecting a regression model, there may be J independent variables from which to choose, giving 2J feasible possible combinations of models from which to choose. Information criteria such as Akaike's (1973) Information Criterion (AIC) and Bozdogan's (1988, 1990, 1994, 2000, 2004) Information Measure of Complexity (ICOMP) Criterion, provide a method defining the 'best' solution, by providing an estimate of the measure of difference between a given model and the true model. In this paper, we introduce a new exact implicit enumeration (IE) algorithm to identify the subset of variables that minimises the information criterion. The IE algorithm uses efficient bounding strategies for the nonlinear objective function of the model selection problem. In computational tests, the IE algorithm outperforms the existing exact algorithms from the literature. The IE algorithm also has the advantage of being the only exact algorithm that can be used with all of the existing information criteria, including ICOMP. ICOMP has the advantage that it explicitly takes into account the effect of the covariance of the variables on parameter estimation in the model selection process and that it makes also no assumption that the parameter estimates are unbiased.

Suggested Citation

  • Xinli Bao & Hamparsum Bozdogan & Vuttichai Chatpattananan & Kenneth Gilbert, 2005. "An implicit enumeration algorithm for mining high dimensional data," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 1(1/2), pages 123-144.
  • Handle: RePEc:ids:ijores:v:1:y:2005:i:1/2:p:123-144
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=7437
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Eylem Deniz & Oguz Akbilgic & J. Andrew Howe, 2011. "Model selection using information criteria under a new estimation method: least squares ratio," Journal of Applied Statistics, Taylor & Francis Journals, vol. 38(9), pages 2043-2050, November.
    2. 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.

    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:ids:ijores:v:1:y:2005:i:1/2:p:123-144. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.