Estimating Dependency Structure as a Hidden Variable
Marina Meilă, Michael I. Jordan · DSpace@MIT (Massachusetts Institute of Technology) · 1997
This publication can be retrieved by anonymous ftp to publications.ai.mit.edu. This paper introduces a probability model,themixture oftrees that can account for sparse, dynamically changing dependence relationships. We present a family of e cient algorithms that use EM and the Minimum Spanning Tree algorithm to nd the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors.
Cited by 39 works. Open-access PDF
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Molecular Biology of the Gene
- Machine Learning, Neural and Statistical Classification
- Approximating discrete probability distributions with dependence trees
- Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
- 10.2 Maximum Likelihood from Incomplete Data
- On structuring probabilistic dependences in stochastic language modelling
- Building classifiers using Bayesian networks
- Interpretation of Artificial Neural Networks: Mapping Knowledge-Based Neural Networks into Rules