Skip to search formSkip to main contentSkip to account menu

Expectation–maximization algorithm

Known as: Expectation Maximization, EM clustering, Expectation maximization method 
In statistics, an expectation–maximization (EM) algorithm is an iterative method for finding maximum likelihood or maximum a posteriori (MAP… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Object detection when provided image-level labels instead of instance-level labels (i.e., bounding boxes) during training is an… 
Highly Cited
2016
Highly Cited
2016
Expectation Maximization (EM) is among the most popular algorithms for estimating parameters of statistical models. However, EM… 
Highly Cited
2014
Highly Cited
2014
A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite… 
Highly Cited
2011
Highly Cited
2011
The approximate message passing (AMP) algorithm originally proposed by Donoho, Maleki, and Montanari yields a computationally… 
Review
2006
Review
2006
Revision history 2009-01-09 Corrected grammar in the paragraph which precedes Equation (17). Changed datestamp format in the… 
Highly Cited
2005
Highly Cited
2005
We propose a detailed model of evolution of exon-intron structure of eukaryotic genes that takes into account gene-specific… 
Review
2004
Review
2004
Many parameter estimation problems in signal processing can be reduced to the task of minimizing a function of the unknown… 
Highly Cited
2002
Highly Cited
2002
The intuition behind EM is an old one: alternate between estimating the unknowns Θ and the hidden variables J. This idea has been… 
Highly Cited
2002
Highly Cited
2002
We introduce a new paradigm for the design of transmitter space-time coding that we refer to as linear precoding. It leads to… 
Highly Cited
1990
Highly Cited
1990
A maximum-likelihood approach to the blur identification problem is presented. The expectation-maximization algorithm is proposed…