Consistent and efficient reconstruction of latent tree models
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees without any redundant hidden nodes. Our first algorithm, re...
Main Authors: | , , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-10-04T13:54:29Z.
|
Subjects: | |
Online Access: | Get fulltext |