Book chapter · 2026

EM Algorithm

Yudi Pawitan

Oxford University Press eBooks, 355–378 · Published 31 March 2026 · DOI 10.1093/oso/9780198950929.003.0012

View at the publisherCite this paper

In brief

“EM Algorithm” is a 2026 book chapter by Yudi Pawitan, published in Oxford University Press eBooks. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
References
5
Authors
1

Abstract

This chapter introduces the expectation–maximization (EM) algorithm, a powerful iterative method for obtaining maximum likelihood estimates when data are incomplete or latent variables are involved. The algorithm alternates between an E-step, which computes the expected value of the complete-data log-likelihood given current parameter estimates, and an M-step, which maximizes this expectation to update the parameters.… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Pawitan, Y. (2026). EM Algorithm. Oxford University Press eBooks, 355–378. https://doi.org/10.1093/oso/9780198950929.003.0012

MLA 9

Pawitan, Yudi. “EM Algorithm.” Oxford University Press eBooks, 2026, pp. 355–378. https://doi.org/10.1093/oso/9780198950929.003.0012.

Chicago

Pawitan, Yudi. 2026. “EM Algorithm.” Oxford University Press eBooks: 355–378. https://doi.org/10.1093/oso/9780198950929.003.0012.

Harvard

Pawitan, Y. (2026) ‘EM Algorithm’, Oxford University Press eBooks, pp. 355–378. doi:10.1093/oso/9780198950929.003.0012.

IEEE

Y. Pawitan, “EM Algorithm,” Oxford University Press eBooks, pp. 355–378, 2026, doi: 10.1093/oso/9780198950929.003.0012.

BibTeX

@incollection{pawitan2026algorithm,
  title     = {{EM Algorithm}},
  author    = {Pawitan, Yudi},
  booktitle = {Oxford University Press eBooks},
  publisher = {Oxford University Press},
  year      = {2026},
  pages     = {355--378},
  doi       = {10.1093/oso/9780198950929.003.0012},
  url       = {https://doi.org/10.1093/oso/9780198950929.003.0012}
}

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

Topic and keywords

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

  • expectation-maximization algorithm
  • maximum likelihood estimation
  • missing data
  • latent variables
  • linear models
  • multinomial distribution
  • genetic models
  • numerical stability

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?

Pawitan, Y. (2026). EM Algorithm. Oxford University Press eBooks, 355–378. https://doi.org/10.1093/oso/9780198950929.003.0012

How many times has this paper been cited?

0 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?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Yudi Pawitan.

What is the DOI of this paper?

10.1093/oso/9780198950929.003.0012. The permanent link is https://doi.org/10.1093/oso/9780198950929.003.0012.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.