Being Bayesian about learning Gaussian Bayesian networks from incomplete data

DOI10.1016/j.ijar.2023.108954MaRDI QIDQ6178704

Unnamed Author

Publication date: 4 September 2023

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

zbMATH Keywords

incomplete dataMarkov chain Monte Carlo (MCMC)BGe scoreGaussian Bayesian networksconditional Gaussians

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
• Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
• Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
• Addendum on the scoring of Gaussian directed acyclic graphical models
• The EM algorithm for graphical association models with missing data
• Estimating the dimension of a model
• Probability propagation
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Improving Markov chain Monte Carlo model search for data mining
• Consistent model selection of discrete Bayesian networks from incomplete data
• Learning Bayesian networks from incomplete data with the node-average likelihood
• Bayesian network structural learning from complex survey data: a resampling based approach
• Effective and efficient structure learning with pruning and model averaging strategies
• Inference and missing data
• 10.1162/153244302760200696
• Bayesian Graphical Models for Discrete Data
• Efficient Sampling and Structure Learning of Bayesian Networks

This page was built for publication: Being Bayesian about learning Gaussian Bayesian networks from incomplete data