Asymptotic Model Selection for Directed Networks with Hidden Variables (1996)
Cached
Download Links
- [research.microsoft.com]
- [www.research.microsoft.com]
- [ftp.research.microsoft.com]
- [www.isip.msstate.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of Twelth Conference on Uncertainty in Artificial Intelligence |
| Citations: | 37 - 11 self |
BibTeX
@INPROCEEDINGS{Geiger96asymptoticmodel,
author = {Dan Geiger and David Heckerman and Christopher Meek},
title = {Asymptotic Model Selection for Directed Networks with Hidden Variables},
booktitle = {In Proceedings of Twelth Conference on Uncertainty in Artificial Intelligence},
year = {1996},
pages = {283--290},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be used to select models given large samples of data. The standard BIC as well as our extension punishes the complexity of a model according to the dimension of its parameters. We argue that the dimension of a Bayesian network with hidden variables is the rank of the Jacobian matrix of the transformation between the parameters of the network and the parameters of the observable variables. We compute the dimensions of several networks including the naive Bayes model with a hidden root node.
