EM algorithm and variants: an informal tutorial
Computation
2012-09-10 v2
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.
Keywords
Cite
@article{arxiv.1105.1476,
title = {EM algorithm and variants: an informal tutorial},
author = {Alexis Roche},
journal= {arXiv preprint arXiv:1105.1476},
year = {2012}
}
Comments
Unpublished