MCMC learning of Bayesian network models by Markov blanket decomposition

Abstract

We propose a Bayesian method for learning Bayesian network models using Markov chain Monte Carlo (MCMC), In contrast to most existing MCMC approaches that define components in term of single edges, our approach is to decompose a Bayesian network model in larger dependence components defined by Markov blankets. The idea is based on the fact that MCMC performs significantly better when choosing the right decomposition, and that edges in the Markov blanket of the vertices form a natural dependence relationship. Using the ALARM and Insurance networks, we show that this decomposition allows MCMC to mix more rapidly, and is less prone to getting stuck in local maxima compared to the single edge approach. © Springer-Verlag Berlin Heidelberg 2005.