Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

Greedy Learning of Binary Latent Trees


Harmeling,  S.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Harmeling, S., & Williams, C. K. (2011). Greedy Learning of Binary Latent Trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(6), 1087-1097. doi:10.1109/TPAMI.2010.145.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-4CCD-E
Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are hierarchical latent class (HLC) models. Zhang (2004) proposed a search algorithm for learning such models that can find good solutions but is often computationally expensive. As an alternative we investigate two greedy procedures: the BIN-G algorithm determines both the structure of the tree and the cardinality of the latent variables in a bottom-up fashion. The BIN-A algorithm first determines the tree structure using agglomerative hierarchical clustering, and then determines the cardinality of the latent variables as for BIN-G. We show that even with restricting ourselves to binary trees we obtain HLC models of comparable quality to Zhang‘s solutions, while being faster to compute. This claim is validated by a comprehensive comparison on several datasets. Furthermore, we demonstrate that our methods are able to estimate int erpretable latent structures on real-world data with a large number of variables. By applying our method to a restricted version of the 20 newsgroups data these models turn out to be related to topic models, and on data from the PASCAL Visual Object Classes (VOC) 2007 challenge we show how such tree-structured models help us understand how objects co-occur in images.