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
Parents
3.1K
The EM Algorithm and Extensions
Debashis Kushary, Geoffrey J. McLachlan, Thriyambakam Krishnan · Technometrics · 1998 · 5.1K citations
1–5 of 3.1K
6.1K
18
h-index
17
h-index
17
h-index
17
h-index
16
h-index
1–5 of 6.1K
1.7K
Harvard University
Cambridge, United States
43 h-index
120 publications
163.8K citations
University of California, Berkeley
Berkeley, United States
38 h-index
107 publications
13K citations
University of Michigan
Ann Arbor, United States
34 h-index
107 publications
10.7K citations
University of California, Los Angeles
Los Angeles, United States
32 h-index
91 publications
18.3K citations
University of Washington
Seattle, United States
26 h-index
63 publications
8.6K citations

Centre National de la Recherche Scientifique
Paris, France
26 h-index
92 publications
5.5K citations
Massachusetts Institute of Technology
Cambridge, United States
22 h-index
52 publications
6.7K citations
Carnegie Mellon University
Pittsburgh, United States
22 h-index
71 publications
4.3K citations
1–8 of 1.7K
126 publications · 21.3K citations
62
h-index
110 publications · 12K citations
47
h-index
40 publications · 59.1K citations
35
h-index
Repository · 88 publications · 3.3K citations
32
h-index
74 publications · 3.9K citations
32
h-index
1–5