## Unsupervised learning of finite mixture models (2002)

### Download From

IEEE### Download Links

- [www.cse.msu.edu]
- [dataclustering.cse.msu.edu]
- [www.cse.msu.edu]
- [www.lx.it.pt]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Transactions on Pattern Analysis and Machine Intelligence |

Citations: | 267 - 20 self |

### BibTeX

@ARTICLE{Figueiredo02unsupervisedlearning,

author = {Mario A. T. Figueiredo and Senior Member and Anil K. Jain},

title = {Unsupervised learning of finite mixture models},

journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},

year = {2002},

volume = {24},

pages = {381--396}

}

### Years of Citing Articles

### OpenURL

### Abstract

AbstractÐThis paper proposes an unsupervised algorithm for learning a finite mixture model from multivariate data. The adjective ªunsupervisedº is justified by two properties of the algorithm: 1) it is capable of selecting the number of components and 2) unlike the standard expectation-maximization (EM) algorithm, it does not require careful initialization. The proposed method also avoids another drawback of EM for mixture fitting: the possibility of convergence toward a singular estimate at the boundary of the parameter space. The novelty of our approach is that we do not use a model selection criterion to choose one among a set of preestimated candidate models; instead, we seamlessly integrate estimation and model selection in a single algorithm. Our technique can be applied to any type of parametric mixture model for which it is possible to write an EM algorithm; in this paper, we illustrate it with experiments involving Gaussian mixtures. These experiments testify for the good performance of our approach. Index TermsÐFinite mixtures, unsupervised learning, model selection, minimum message length criterion, Bayesian methods, expectation-maximization algorithm, clustering. 1