Em Algorithm

EM Algorithm is a statistical estimation method that iteratively maximizes the likelihood function in the presence of incomplete or latent data by alternating between an expectation step (E-step) that computes the expected value of the log-likelihood, and a maximization step (M-step) that updates the parameters to maximize this expected log-likelihood.

3.1K

Publications

317.4K

Citations

6.1K

Authors

1.7K

Institutions

Publications per year

2017–2026

427

Authors

6.1K

  1. NB
    N. Balakrishnan

    McMaster University, Canada

    22 publications · 976 citations

    18

    h-index

  2. DB
    Donald B. Rubin

    Harvard University, United States

    18 publications · 55.3K citations

    17

    h-index

  3. MI
    Michael I. Jordan

    University of California, Berkeley, United States

    19 publications · 2.7K citations

    17

    h-index

  4. GJ
    Geoffrey J. McLachlan

    The University of Queensland, Australia

    29 publications · 6.3K citations

    17

    h-index

  5. KL
    Kenneth Lange

    University of California, Los Angeles, United States

    17 publications · 6.5K citations

    16

    h-index

1–5 of 6.1K

Venues

  1. Journal of the American Statistical Association

    126 publications · 21.3K citations

    62

    h-index

  2. Biometrics

    110 publications · 12K citations

    47

    h-index

  3. 35

    h-index

  4. arXiv (Cornell University)

    Repository · 88 publications · 3.3K citations

    32

    h-index

  5. Statistics in Medicine

    74 publications · 3.9K citations

    32

    h-index

1–5