Efficient identification of independence networks using mutual information

DOI10.1007/s00180-012-0320-6zbMath1305.65022OpenAlexW1970579242MaRDI QIDQ2255845

Joe Whittaker, Davide Bacciu, T. A. Etchells, 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 networksmutual informationgraphical modelsfalse discovery rateskeletonPC algorithmconstraint based searchdense networksfalse negative reduction

Mathematics Subject Classification ID

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

Uses Software

• BNT
• TETRAD
• ARACNE

Cites Work

• The max-min hill-climbing Bayesian network structure learning algorithm
• Causation, prediction, and search
• Learning Bayesian networks from data: An information-theory based approach
• The control of the false discovery rate in multiple testing under dependency.
• Bayesian Networks and Decision Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item