Foundations and Trends® in Signal Processing > Vol 4 > Issue 3
Cite

Theory and Use of the EM Algorithm

  • Maya R. Gupta 1
  • Yihua Chen 2

[1]Maya R. Gupta, Department of Electrical Engineering, University of Washington, USA, gupta@ee.washington.edu [2]Yihua Chen, Department of Electrical Engineering, University of Washington, USA, yhchen@ee.washington.edu

Short description

Introduces the expectation-maximization (EM) algorithm and provides an intuitive and mathematically rigorous understanding of this method. Theory and Use of the EM Algorithm is designed to be useful to both the EM novice and the experienced EM user looking to better understand the method and its use.

Keywords

Subscribers Download

(non-subscribers see Book Details tab if available)

Table of contents

1 The Expectation-Maximization Method
2 Analysis of EM
3 Learning Mixtures
4 More EM Examples
5 EM Variants
6 Conclusions and Some Historical Notes
Acknowledgments
References

Foundations and Trends® in Signal Processing

(Vol 4, Issue 3, 2010, pp 223-296)

DOI: 10.1561/2000000034

Abstract

This introduction to the expectation–maximization (EM) algorithm provides an intuitive and mathematically rigorous understanding of EM. Two of the most popular applications of EM are described in detail: estimating Gaussian mixture models (GMMs), and estimating hidden Markov models (HMMs). EM solutions are also derived for learning an optimal mixture of fixed models, for estimating the parameters of a compound Dirichlet distribution, and for dis-entangling superimposed signals. Practical issues that arise in the use of EM are discussed, as well as variants of the algorithm that help deal with these challenges.

Table of contents

1: The Expectation-Maximization Method
2: Analysis of EM
3: Learning Mixtures
4: More EM Examples
5: EM Variants
6: Conclusions and Some Historical Notes
Acknowledgements
References
Cover image for Theory and Use of the EM Algorithm

Theory and Use of the EM Algorithm

80 pages

DOI: 10.1561/9781601984319

E-ISBN: 978-1-60198-431-9

ISBN: 978-1-60198-430-2

Description

Theory and Use of the EM Algorithm introduces the expectation-maximization (EM) algorithm and provides an intuitive and mathematically rigorous understanding of this method. It describes in detail two of the most popular applications of EM: estimating Gaussian mixture models (GMMs), and estimating hidden Markov models (HMMs). It also covers the use of EM for learning an optimal mixture of fixed models, for estimating the parameters of a compound Dirichlet distribution, and for disentangling superimposed signals. It discusses problems that arise in practice with EM, and variants of the algorithm that help deal with these challenges. Theory and Use of the EM Algorithm is designed to be useful to both the EM novice and the experienced EM user looking to better understand the method and its use.