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)

Related topics

Related topics

41 relations
Bayesian networkBitext word alignmentCluster analysisComputational anatomy

Broader (2)

Estimation theoryMissing data

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Weakly- and Semi-Supervised Object Detection with Expectation-Maximization Algorithm
Object detection when provided image-level labels instead of instance-level labels (i.e., bounding boxes) during training is an… 
Highly Cited
2007
Highly Cited
2007
Physical Network Coding in Two-Way Wireless Relay Channels
It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on… 
Highly Cited
2007
Highly Cited
2007
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when… 
Review
2006
Review
2006
The Expectation Maximization Algorithm A short tutorial
Revision history 2009-01-09 Corrected grammar in the paragraph which precedes Equation (17). Changed datestamp format in the… 
Highly Cited
2006
Highly Cited
2006
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
This paper considers a wireless cooperative cellular data network with a base station and many subscribers in which the… 
Highly Cited
2005
Highly Cited
2005
An Expectation-Maximization Algorithm for Analysis of Evolution of Exon-Intron Structure of Eukaryotic Genes
We propose a detailed model of evolution of exon-intron structure of eukaryotic genes that takes into account gene-specific… 
Highly Cited
2005
Highly Cited
2005
A Spectral Clustering Approach To Finding Communities in Graph
Clustering nodes in a graph is a useful general technique in data mining of large network data sets. In this context, Newman and… 
Review
2004
Review
2004
Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher
Many parameter estimation problems in signal processing can be reduced to the task of minimizing a function of the unknown… 
Highly Cited
1991
Highly Cited
1991
Acoustical and environmental robustness in automatic speech recognition
This dissertation describes a number of algorithms developed to increase the robustness of automatic speech recognition systems… 
Highly Cited
1988
Highly Cited
1988
Value Maximization and the Acquisition Process
L ike the rest of us, corporate managers have many personal goals and ambitions, only one of which is to get rich. The way they… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)