Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables

Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David Maxwell Chickering , David Heckerman

Venue:	Machine Learning
Citations:	155 - 9 self

Versions

Version History

Metadata Version 0

Datum	Value	Source
TITLE	Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables	SVM HeaderParse 0.1
AUTHOR NAME	David Maxwell Chickering	SVM HeaderParse 0.1
AUTHOR NAME	David Heckerman	SVM HeaderParse 0.1
AUTHOR ADDR	One Microsoft Way; Redmond, WA	SVM HeaderParse 0.1
ABSTRACT	We discuss Bayesian methods for model averaging and model selection among Bayesiannetwork models with hidden variables. In particular, we examine large-sample approximations for the marginal likelihood of naive-Bayes models in which the root node is hidden. Such models are useful for clustering or unsupervised learning. We consider a Laplace approximation and the less accurate but more computationally efficient approximation known as the Bayesian Information Criterion (BIC), which is equivalent to Rissanen's (1987) Minimum Description Length (MDL). Also, we consider approximations that ignore some off-diagonal elements of the observed information matrix and an approximation proposed by Cheeseman and Stutz (1995). We evaluate the accuracy of these approximations using a Monte-Carlo gold standard. In experiments with artificial and real examples, we find that (1) none of the approximations are accurate when used for model averaging, (2) all of the approximations, with the exception of BIC/MDL, are accurate for model selection, (3) among the accurate approximations, the Cheeseman--Stutz and Diagonal approximations are the most computationally efficient, (4) all of the approximations, with the exception of BIC/MDL, can be sensitive to the prior distribution over model parameters, and (5) the Cheeseman--Stutz approximation can be more accurate than the other approximations, including the Laplace approximation, in situations where the parameters in the maximum a posteriori (MAP) configuration are near a boundary.	SVM HeaderParse 0.1
CITATIONS	50 found	ParsCit 1.0