Estimating Dependency Structure as a Hidden Variable
Author(s)
Meila, Marina; Jordan, Michael I.; Morris, Quaid
DownloadAIM-1611.ps (161.1Kb)
Additional downloads
Metadata
Show full item recordAbstract
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 EMand the Minimum Spanning Tree algorithm to find the ML and MAP mixtureof trees for a variety of priors, including the Dirichlet and the MDL priors.
Date issued
1997-06-01Other identifiers
AIM-1611
CBCL-151
Series/Report no.
AIM-1611CBCL-151