Fast Computation of the EM Algorithm for Mixture Models

Masahiro Kuroda

A chapter in Computational Statistics and Applications from IntechOpen

Abstract: Mixture models become increasingly popular due to their modeling flexibility and are applied to the clustering and classification of heterogeneous data. The EM algorithm is largely used for the maximum likelihood estimation of mixture models because the algorithm is stable in convergence and simple in implementation. Despite such advantages, it is pointed out that the EM algorithm is local and has slow convergence as the main drawback. To avoid the local convergence of the EM algorithm, multiple runs from several different initial values are usually used. Then the algorithm may take a large number of iterations and long computation time to find the maximum likelihood estimates. The speedup of computation of the EM algorithm is available for these problems. We give the algorithms to accelerate the convergence of the EM algorithm and apply them to mixture model estimation. Numerical experiments examine the performance of the acceleration algorithms in terms of the number of iterations and computation time.

Keywords: the EM algorithm; normal mixture models; acceleration of convergence; the vector ? algorithm; restarting procedure; initial value selection; the emEM algorithm (search for similar items in EconPapers)
JEL-codes: C10 (search for similar items in EconPapers)
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.intechopen.com/chapters/79594 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ito:pchaps:244719

DOI: 10.5772/intechopen.101249

Access Statistics for this chapter

More chapters in Chapters from IntechOpen
Bibliographic data for series maintained by Slobodan Momcilovic ().