Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,218,472 papers from all fields of science
Search
Sign In
Create Free Account
Expectation–maximization algorithm
Known as:
Expectation Maximization
, EM clustering
, Expectation maximization method
Expand
In statistics, an expectation–maximization (EM) algorithm is an iterative method for finding maximum likelihood or maximum a posteriori (MAP…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
Bayesian network
Bitext word alignment
Cluster analysis
Computational anatomy
Expand
Broader (2)
Estimation theory
Missing 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
Ziang Yan
,
Jian Liang
,
Weishen Pan
,
Jin Li
,
Changshui Zhang
arXiv.org
2017
Corpus ID: 12986545
Object detection when provided image-level labels instead of instance-level labels (i.e., bounding boxes) during training is an…
Expand
Highly Cited
2016
Highly Cited
2016
Global Analysis of Expectation Maximization for Mixtures of Two Gaussians
Ji Xu
,
Daniel J. Hsu
,
A. Maleki
Neural Information Processing Systems
2016
Corpus ID: 6310792
Expectation Maximization (EM) is among the most popular algorithms for estimating parameters of statistical models. However, EM…
Expand
Highly Cited
2014
Highly Cited
2014
Expectation-Maximization for Learning Determinantal Point Processes
Jennifer Gillenwater
,
Alex Kulesza
,
E. Fox
,
B. Taskar
Neural Information Processing Systems
2014
Corpus ID: 6690654
A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite…
Expand
Highly Cited
2011
Highly Cited
2011
Expectation-maximization Bernoulli-Gaussian approximate message passing
Jeremy P. Vila
,
Philip Schniter
Asilomar Conference on Signals, Systems and…
2011
Corpus ID: 1100615
The approximate message passing (AMP) algorithm originally proposed by Donoho, Maleki, and Montanari yields a computationally…
Expand
Review
2006
Review
2006
The Expectation Maximization Algorithm A short tutorial
Sean Borman
2006
Corpus ID: 263505872
Revision history 2009-01-09 Corrected grammar in the paragraph which precedes Equation (17). Changed datestamp format in the…
Expand
Highly Cited
2005
Highly Cited
2005
An Expectation-Maximization Algorithm for Analysis of Evolution of Exon-Intron Structure of Eukaryotic Genes
L. Carmel
,
I. Rogozin
,
Y. Wolf
,
E. Koonin
Comparative Genomics
2005
Corpus ID: 6748534
We propose a detailed model of evolution of exon-intron structure of eukaryotic genes that takes into account gene-specific…
Expand
Review
2004
Review
2004
Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher
P. Stoica
,
Y. Selén
IEEE Signal Processing Magazine
2004
Corpus ID: 120473821
Many parameter estimation problems in signal processing can be reduced to the task of minimizing a function of the unknown…
Expand
Highly Cited
2002
Highly Cited
2002
The Expectation Maximization Algorithm
F. Dellaert
2002
Corpus ID: 32155514
The intuition behind EM is an old one: alternate between estimating the unknowns Θ and the hidden variables J. This idea has been…
Expand
Highly Cited
2002
Highly Cited
2002
Optimal designs for space-time linear precoders and decoders
A. Scaglione
,
P. Stoica
,
S. Barbarossa
,
G. Giannakis
,
H. Sampath
IEEE Transactions on Signal Processing
2002
Corpus ID: 15944205
We introduce a new paradigm for the design of transmitter space-time coding that we refer to as linear precoding. It leads to…
Expand
Highly Cited
1990
Highly Cited
1990
Identification and restoration of noisy blurred images using the expectation-maximization algorithm
R. Lagendijk
,
J. Biemond
,
D. Boekee
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 12354303
A maximum-likelihood approach to the blur identification problem is presented. The expectation-maximization algorithm is proposed…
Expand
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)
ACCEPT & CONTINUE