163 search results - page 1 / 33 » Incremental Mixture Learning for Clustering Discrete Data |
SETN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
ICANN
2007
Springer
13 years 10 months ago
2007
Springer
In this article we present an incremental method for building a mixture model. Given the desired number of clusters K ≥ 2, we start with a two-component mixture and we optimize t...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
NIPS
2001
13 years 5 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...