• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A gentle tutorial on the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models (1997)

Cached

  • Download as a PDF

Download Links

  • [www.icsi.berkeley.edu]
  • [www.ee.columbia.edu]
  • [www.cs.bham.ac.uk]
  • [www.cse.ucsc.edu]
  • [www10.informatik.uni-erlangen.de]
  • [www.cse.unr.edu]
  • [www.cs.unr.edu]
  • [crow.ee.washington.edu]
  • [vorlon.cwru.edu]
  • [www.cse.cuhk.edu.hk]
  • [www3.cs.pitt.edu]
  • [ssli.ee.washington.edu]
  • [www.cs.brown.edu]
  • [www.inf.ed.ac.uk]
  • [facartes.unal.edu.co]
  • [users.cs.dal.ca]
  • [www.cs.kun.nl]
  • [www.cs.dal.ca]
  • [www.cs.ru.nl]
  • [www.cs.pitt.edu]
  • [www-poleia.lip6.fr]
  • [www-connex.lip6.fr]
  • [www.dcs.shef.ac.uk]
  • [www.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jeff A. Bilmes
Citations:327 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Bilmes97agentle,
    author = {Jeff A. Bilmes},
    title = {A gentle tutorial on the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models},
    institution = {},
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We describe the maximum-likelihood parameter estimation problem and how the Expectation-form of the EM algorithm as it is often given in the literature. We then develop the EM parameter estimation procedure for two applications: 1) finding the parameters of a mixture of Gaussian densities, and 2) finding the parameters of a hidden Markov model (HMM) (i.e., the Baum-Welch algorithm) for both discrete and Gaussian mixture observation models. We derive the update equations in fairly explicit detail but we do not prove any convergence properties. We try to emphasize intuition rather than mathematical rigor. ii 1 Maximum-likelihood Recall the definition of the maximum-likelihood estimation problem. We have a density function ¢¡¤£¦ ¥ §© ¨ that is governed by the set of parameters § (e.g.,   might be a set of Gaussians and § could be the means and covariances). We also have a data set of size � , supposedly drawn from this distribution, i.e., ���� � £�������������£��© �. That is, we assume that these data vectors are independent and

Citations

6231 Maximum likelihood from incomplete data via the EM algorithm - Dempster, Laird - 1977
3909 Neural networks for pattern recognition - Bishop - 1995
1180 Fundamentals of speech recognition - Rabiner - 1993
634 Hierarchical mixtures of experts and the EM algorithm - Jordan, Jacobs - 1994
425 Mixture densities, maximum likelihood, and the EM algorithm - Redner, Walker - 1984
245 On the convergence properties of the EM algorithm - Wu - 1983
114 On convergence properties of the EM algorithm for Gaussian mixtures - Xu, Jordan - 1996
89 Convergence results for the em approach to mixtures of experts architectures - Jordan, Xu - 1995
49 Learning from incomplete data - Ghahramani, Jordan
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University