Preprint · 2011 · Open access

EM algorithm and variants: an informal tutorial

Alexis Roche

arXiv (Cornell University) · Published 7 May 2011 · DOI 10.48550/arxiv.1105.1476

Open PDFView at the publisherCite this paper

In brief

“EM algorithm and variants: an informal tutorial” is a 2011 preprint by Alexis Roche, published in arXiv (Cornell University). OpenAlex counts 43 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
43
Most cited in
2024 (6)
References
30
Authors
1

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.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Roche, A. (2011). EM algorithm and variants: an informal tutorial. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1105.1476

MLA 9

Roche, Alexis. “EM algorithm and variants: an informal tutorial.” arXiv (Cornell University), 2011. https://doi.org/10.48550/arxiv.1105.1476.

Chicago

Roche, Alexis. 2011. “EM algorithm and variants: an informal tutorial.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1105.1476.

Harvard

Roche, A. (2011) ‘EM algorithm and variants: an informal tutorial’, arXiv (Cornell University). doi:10.48550/arxiv.1105.1476.

IEEE

A. Roche, “EM algorithm and variants: an informal tutorial,” arXiv (Cornell University), 2011, doi: 10.48550/arxiv.1105.1476.

BibTeX

@misc{roche2011algorithm,
  title     = {{EM algorithm and variants: an informal tutorial}},
  author    = {Roche, Alexis},
  howpublished = {arXiv (Cornell University)},
  year      = {2011},
  doi       = {10.48550/arxiv.1105.1476},
  url       = {https://doi.org/10.48550/arxiv.1105.1476}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201722
201855
201933
202033
202155
202222
202322
202466
202511
202655

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models

  • expectation-maximization algorithm
  • maximum likelihood estimation
  • missing data
  • iterative optimization
  • statistical inference

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Roche, A. (2011). EM algorithm and variants: an informal tutorial. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1105.1476

How many times has this paper been cited?

43 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Alexis Roche.

What is the DOI of this paper?

10.48550/arxiv.1105.1476, permanently at https://doi.org/10.48550/arxiv.1105.1476. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.