Structural learning for Bayesian networks by testing complete separators in prime blocks

DOI10.1016/j.csda.2011.06.017zbMath1271.62048OpenAlexW2050063154MaRDI QIDQ1942894

Ping-feng Xu, Man-Lai Tang, Jian-hua Guo

Publication date: 14 March 2013

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2011.06.017

zbMATH Keywords

conditional independencestructural learningcomplete separatorprime blocksupporting edge

Mathematics Subject Classification ID

Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (1)

A new algorithm for decomposition of graphical models

Uses Software

• BNT
• TETRAD
• Hailfinder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The max-min hill-climbing Bayesian network structure learning algorithm
• A note on minimal d-separation trees for structural learning
• Towards scalable and data efficient learning of Markov boundaries
• Causation, prediction, and search
• A characterization of Markov equivalence classes for acyclic digraphs
• Adaptive probabilistic networks with hidden variables
• Learning Bayesian networks from data: An information-theory based approach
• Learning Bayesian networks: The combination of knowledge and statistical data
• Optimal decomposition by clique separators
• Decomposition of structural learning about directed acyclic graphs
• High-dimensional graphs and variable selection with the Lasso
• Decomposition of search for \(v\)-structures in DAGs
• Bayesian Networks and Decision Graphs
• Probabilistic Networks and Expert Systems
• 10.1162/153244302760200696

This page was built for publication: Structural learning for Bayesian networks by testing complete separators in prime blocks