Sciweavers

3 search results - page 1 / 1
» Greedy Learning of Binary Latent Trees
Sort
View
PAMI
2011
12 years 11 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
ICTAI
2010
IEEE
13 years 1 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
13 years 10 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh