The EM algorithm for graphical association models with missing data
Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
Mixture reduction via predictive scores
Statistics and Computing
Learning Bayesian networks from incomplete databases
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Asymptotic model selection for directed networks with hidden variables*
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Sequence Learning via Bayesian Clustering by Dynamics
Sequence Learning - Paradigms, Algorithms, and Applications
Algebraic statistics in model selection
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Asymptotic Model Selection for Naive Bayesian Networks
The Journal of Machine Learning Research
Latent models for cross-covariance
Journal of Multivariate Analysis
Effective dimensions of hierarchical latent class models
Journal of Artificial Intelligence Research
Effective dimensions of partially observed polytrees
International Journal of Approximate Reasoning
Algebraic geometry of Bayesian networks
Journal of Symbolic Computation
Learning Bayesian networks using evolutionary algorithm and a variant of MDL score
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
Dimension correction for hierarchical latent class models
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Asymptotic model selection for naive Bayesian networks
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Cross-covariance modelling via DAGs with hidden variables
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Automated analytic asymptotic evaluation of the marginal likelihood for latent models
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Hi-index | 0.00 |
In this paper we investigate the geometry of the likelihood of the unknown parameters in a simple class of Bayesian directed graphs with hidden variables. This enables us, before any numerical algorithms are employed, to obtain certain insights in the nature of the unidentifiability inherent in such models, the way posterior densities will be sensitive to prior densities and the typical geometrical form these posterior densities might take. Many of these insights carry over into more complicated Bayesian networks with systematic missing data.