ScholarGate
Get started

Method evidence record

EM Algorithm

The Expectation-Maximization (EM) algorithm is an iterative optimization procedure for finding maximum likelihood or maximum a posteriori estimates of parameters in statistical models with latent variables or missing data. Introduced by Dempster, Laird, and Rubin in their landmark 1977 paper, EM alternates between computing the expected complete-data log-likelihood (E-step) and maximizing it with respect to the parameters (M-step), guaranteeing monotone non-decreasing likelihood at each iteration.

Evidence statusSources recorded, not reviewedBibliographic sources are present. Claim-level evidence review has not been performed.

Source record

Recorded

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

Expectation-Maximization Algorithm

Taxonomic method recordml-modelstatistics

  1. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–38. · DOI 10.1111/j.2517-6161.1977.tb01600.x

Open full method1 recorded citation, copied from the method source record.

Curated claims

Assessed

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Suggested2

Generated from the method graph and shown as machine-suggested relations. No evidence claim is inferred.