Effective and efficient structure learning with pruning and model averaging strategies

DOI10.1016/J.IJAR.2022.09.016OpenAlexW4226399656MaRDI QIDQ2105581FDOQ2105581

Authors: Anthony C. Constantinou, Yang Liu, Neville K. Kitson, Kiattikun Chobtham, Zhigao Guo 

Publication date: 8 December 2022

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.00398

zbMATH Keywords

Bayesian networksprobabilistic graphical modelsdirected acyclic graphsnoisy dataMarkov equivalence

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Order-independent constraint-based causal structure learning
• Causation, prediction, and search
• Learning Bayesian networks: The combination of knowledge and statistical data
• Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
• 10.1162/153244302760200696
• The max-min hill-climbing Bayesian network structure learning algorithm
• Ancestral graph Markov models.
• On scoring maximal ancestral graphs with the max-min hill climbing algorithm
• A Gibbs sampler for learning DAGs

Cited In (2)

• Being Bayesian about learning Bayesian networks from ordinal data
• Being Bayesian about learning Gaussian Bayesian networks from incomplete data

Uses Software

• bnlearn
• TETRAD

This page was built for publication: Effective and efficient structure learning with pruning and model averaging strategies

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