SMEM Algorithm for Mixture Models
Top Cited Papers
- 1 September 2000
- journal article
- Published by MIT Press in Neural Computation
- Vol. 12 (9) , 2109-2128
- https://doi.org/10.1162/089976600300015088
Abstract
We present a split-and-merge expectation-maximization (SMEM) algorithm to overcome the local maxima problem in parameter estimation of finite mixture models. In the case of mixture models, local maxima often involve having too many components of a mixture model in one part of the space and too few in another, widely separated part of the space. To escape from such configurations, we repeatedly perform simultaneous split-and-merge operations using a new criterion for efficiently selecting the split-and-merge candidates. We apply the proposed algorithm to the training of gaussian mixtures and mixtures of factor analyzers using synthetic and real data and show the effectiveness of using the split- and-merge operations to improve the likelihood of both the training data and of held-out test data. We also show the practical usefulness of the proposed algorithm by applying it to image compression and pattern recognition problems.Keywords
This publication has 6 references indexed in Scilit:
- Deterministic annealing EM algorithmNeural Networks, 1998
- On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion)Journal of the Royal Statistical Society Series B: Statistical Methodology, 1997
- A new competitive learning approach based on an equidistortion principle for designing optimal vector quantizersNeural Networks, 1994
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- PATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSISMultivariate Behavioral Research, 1970
- A clustering technique for summarizing multivariate dataBehavioral Science, 1967