Learning mixtures of DAG models
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
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.