EM algorithm and variants: an informal tutorial
arXiv:1105.1476
Abstract
The expectation-maximization (EM) algorithm introduced by Dempster et al in 1977 is a very general method to solve maximum likelihood estimation problems. In this informal report, we review the theory behind EM as well as a number of EM variants, suggesting that beyond the current state of the art is an even much wider territory still to be discovered.
Unpublished
Cited by in corpus (4)
- On the consistency of supervised learning with missing values
- An Exploration of How Training Set Composition Bias in Machine Learning Affects Identifying Rare Objects
- From the EM Algorithm to the CM-EM Algorithm for Global Convergence of Mixture Models
- Classification of Pulsars using Extreme Deconvolution