Expectation-maximization Algorithm

The Expectation-Maximization Algorithm is a iterative optimization algorithm belonging to the class of methods for estimating parameters in statistical models with latent variables, distinguished by its two-step structure that alternates between computing expected values of unobserved variables given current parameter estimates (Expectation step) and maximizing a likelihood function to update the parameters (Maximization step).

4.1K

Publications

318.2K

Citations

10K

Authors

2.6K

Institutions

Publications per year

2017–2026

1.1K

Authors

10K

  1. BH
    Biao Huang

    University of Alberta, Canada

    20 publications · 850 citations

    17

    h-index

  2. JA
    Jeffrey A. Fessler

    University of Michigan, United States

    14 publications · 1.6K citations

    14

    h-index

  3. SP
    Suvra Pal

    The University of Texas at Arlington, United States

    14 publications · 389 citations

    14

    h-index

  4. PD
    Paul D. McNicholas

    University of Guelph, Canada

    16 publications · 1.1K citations

    13

    h-index

  5. NB
    N. Balakrishnan

    McMaster University, Canada

    12 publications · 478 citations

    12

    h-index

1–5 of 10K

Venues

  1. IEEE Transactions on Medical Imaging

    75 publications · 13K citations

    45

    h-index

  2. IEEE Transactions on Signal Processing

    91 publications · 8.9K citations

    44

    h-index

  3. Journal of the American Statistical Association

    48 publications · 9.4K citations

    35

    h-index

  4. Neural Computation

    48 publications · 10.8K citations

    33

    h-index

  5. Physics in Medicine and Biology

    51 publications · 3K citations

    32

    h-index

1–5