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.