Effective and efficient structure learning with pruning and model averaging strategies

DOI10.1016/J.IJAR.2022.09.016MaRDI QIDQ2105581zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Bayesian networksdirected acyclic graphsMarkov equivalencenoisy dataprobabilistic graphical models

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

• Being Bayesian about learning Gaussian Bayesian networks from incomplete data
• Being Bayesian about learning Bayesian networks from ordinal data
• A BGe score for tied-covariance mixture Gaussian Bayesian networks

Describes a project that uses

Uses Software

• TETRAD
• bnlearn

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)