Learning Latent Tree Graphical 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. Unlike many existing me...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
CrossRef test prefix
2012
|
| Online Access: | http://hdl.handle.net/1721.1/71241 https://orcid.org/0000-0003-0149-5888 |