IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v28y2013i2p621-646.html
   My bibliography  Save this article

Efficient identification of independence networks using mutual information

Author

Listed:
  • Davide Bacciu
  • Terence Etchells
  • Paulo Lisboa
  • Joe Whittaker

Abstract

Conditional independence graphs are now widely applied in science and industry to display interactions between large numbers of variables. However, the computational load of structure identification grows with the number of nodes in the network and the sample size. A tailored version of the PC algorithm is proposed which is based on mutual information tests with a specified testing order, combined with false negative reduction and false positive control. It is found to be competitive with current structure identification methodologies for both estimation accuracy and computational speed and outperforms these in large scale scenarios. The methodology is also shown to approximate dense networks. The comparisons are made on standard benchmarking data sets and an anonymized large scale real life example. Copyright Springer-Verlag 2013

Suggested Citation

  • Davide Bacciu & Terence Etchells & Paulo Lisboa & Joe Whittaker, 2013. "Efficient identification of independence networks using mutual information," Computational Statistics, Springer, vol. 28(2), pages 621-646, April.
    • Handle: RePEc:spr:compst:v:28:y:2013:i:2:p:621-646
    DOI: 10.1007/s00180-012-0320-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00180-012-0320-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00180-012-0320-6?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
    ---><---

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

    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:spr:compst:v:28:y:2013:i:2:p:621-646. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.