The Bayesian Structural EM Algorithm
Nir Friedman · arXiv (Cornell University) · 2013
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a belief network from incomplete data- that is, in the presence of missing values or hidden variables. In a recent paper, I introduced an algorithm called Structural EM that combines the standard Expectation Maximization (EM) algorithm, which optimizes parameters, with structure search for model selection. That algorithm learns networks based on penalized likelihood scores, which include the BIC/MDL score and various approximations to the Bayesian score. In this paper, I extend Structural EM to deal directly with Bayesian model selection. I prove the convergence of the resulting algorithm and show how to apply it for learning a large class of probabilistic models, including Bayesian networks and some variants thereof.
Cited by 511 works. doi:10.48550/arxiv.1301.7373 Open-access PDF
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Inference and missing data
- Optimal Statistical Decisions.
- A Bayesian Method for the Induction of Probabilistic Networks from Data
- Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
- Bayesian classification (AutoClass): theory and results
- Learning classification trees
- Mean Field Theory for Sigmoid Belief Networks
- Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables