Learning Bayesian networks for discrete data

Authors:
Faming Liang;Jian Zhang
Affiliations:
Department of Statistics, Texas A&M University, College Station, TX 77843-3143, USA;Department of Mathematics, University of York, York, YO10 5DD, UK
Venue:
Computational Statistics & Data Analysis
Year:
2009

Citing 8
Cited 3

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
an entropy-driven system for construction of probabilistic expert systems from databases

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Stability of Stochastic Approximation under Verifiable Conditions

SIAM Journal on Control and Optimization
Causal discovery from a mixture of experimental and observational data

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Learning bayesian networks structure with continuous variables

ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Knowledge discovery approach to automated cardiac SPECT diagnosis

Artificial Intelligence in Medicine

Diagnose the mild cognitive impairment by constructing Bayesian network with missing data

Expert Systems with Applications: An International Journal
Review: learning bayesian networks: Approaches and issues

The Knowledge Engineering Review
The Bayesian method for causal discovery of latent-variable models from a mixture of experimental and observational data

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.03

Visualization

Abstract

Bayesian networks have received much attention in the recent literature. In this article, we propose an approach to learn Bayesian networks using the stochastic approximation Monte Carlo (SAMC) algorithm. Our approach has two nice features. Firstly, it possesses the self-adjusting mechanism and thus avoids essentially the local-trap problem suffered by conventional MCMC simulation-based approaches in learning Bayesian networks. Secondly, it falls into the class of dynamic importance sampling algorithms; the network features can be inferred by dynamically weighted averaging the samples generated in the learning process, and the resulting estimates can have much lower variation than the single model-based estimates. The numerical results indicate that our approach can mix much faster over the space of Bayesian networks than the conventional MCMC simulation-based approaches.