Optimization of Mixture Models: Comparison of Different Strategies
- 29 Downloads
Mixture model parameters are usually computed with maximum likelihood using an Expectation-Maximization (EM) algorithm. However, it is wellknown that this method can sometimes converge toward a critical point of the solution space which is not the global maximum. To minimize this problem, different strategies using different combinations of algorithms can be used. In this paper, we compare by the mean of numerical simulations strategies using EM, Classification EM, Stochastic EM, and Genetic algorithms for the optimization of mixture models. Our results indicate that two-stage procedures combining both an exploration phase and an optimization phase provide the best results, especially when these methods axe applied on several sets of initial conditions rather than on one single starting point.
KeywordsMixture models Mixture Transition Distribution model (MTD) Expectation-Maximization (EM) algorithm Classification EM (CEM) Stochastic EM (SEM) Genetic Algorithm (GA)
Unable to display preview. Download preview PDF.
- Berchtold A. (2001), Mixture Modeling of Non-Gaussian Probability Distributions, Proceedings of the 10th International Symposium on Applied Stochastic Models and Data Analysis, 188–193, Compiègne, France.Google Scholar
- Böhning, D. (2001), The Potential of Recent Developments in Nonparametric Mixture Distributions, Proceedings of the 10th International Symposium on Applied Stochastic Models and Data Analysis, 6–13, Compiègne, France.Google Scholar
- Celeux, G., Diebolt, J. (1985), The SEM algorithm: a probabilistic teacher algorithm derived from the EM algorithm for the mixture problem, Computational Statistics Quarterly, 2, 73–82.Google Scholar
- Davis, L. et al. (1991), Handbook of Genetic Algorithms, Davis Editor, Van Nostrand Reinhold, New York.Google Scholar
- Holland, J.H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.Google Scholar