Estimating Dependency Structure as a Hidden Variable

Marina Meila, Michael I. Jordan

Abstract

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning Tree algorithm to find the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors.
BibTeX
@inproceedings{meila1997estimating,
  author = {Marina Meila and Michael I. Jordan},
  title = {{Estimating Dependency Structure as a Hidden Variable}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {1997},
}

Loading related content...

Figure