Efficient identification of independence networks using mutual information

DOI10.1007/S00180-012-0320-6MaRDI QIDQ2255845zbMATH OpenOpenAlexFDO

Authors Davide Bacciu, T. A. Etchells, Joe Whittaker, Paulo J. G. Lisboa

Publication date 18 February 2015

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-012-0320-6

zbMATH Keywords

Bayesian networksconstraint based searchdense networksfalse discovery ratefalse negative reductiongraphical modelsmutual informationPC algorithmskeleton

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Recommendations

• Efficient algorithms for conditional independence inference
• The reduced PC-algorithm: improved causal structure learning in large random networks
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• PC algorithm for nonparanormal graphical models
• Graph estimation with joint additive models

Cites work

• Bayesian Networks and Decision Graphs
• Causation, prediction, and search
• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 3519741 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 720689 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Learning Bayesian networks from data: An information-theory based approach
• Probabilistic graphical models.
• The control of the false discovery rate in multiple testing under dependency.
• The max-min hill-climbing Bayesian network structure learning algorithm

Cited in

(5)

• Mutual conditional independence and its applications to model selection in Markov networks
• A novel Chow-Liu algorithm and its application to gene differential analysis
• Efficient Markov Network Structure Discovery Using Independence Tests
• Sufficient and Necessary Graphical Conditions for MISO Identification in Networks With Observational Data
• Information identification in different networks with heterogeneous information sources

Describes a project that uses

Uses Software

• TETRAD
• ARACNE
• BNT

This page was built for publication: Efficient identification of independence networks using mutual information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255845)