Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,804,739 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.
2010
2010
The expectation-maximization algorithm: Gaussian case
I. Iatan
International Conference on Networking and…
2010
Corpus ID: 6763393
There are some situations when in the pattern recognition applications can appear some objects which are missing data. This thing…
Expand
Highly Cited
2009
Highly Cited
2009
Sum-Rate Maximization for Two-Way MIMO Amplify-and-Forward Relaying Systems
Kyoung-Jae Lee
,
Kwangwon Lee
,
Hakjea Sung
,
Inkyu Lee
IEEE Vehicular Technology Conference
2009
Corpus ID: 14224634
This paper considers two-way relaying systems with a multiple-input multiple-output (MIMO) relay between two MIMO terminal nodes…
Expand
Highly Cited
2008
Highly Cited
2008
Accepted for publication in The Astronomical Journal Preprint typeset using L ATEX style emulateapj v. 10/09/06 CLEAN KINEMATIC SAMPLES IN DWARF SPHEROIDALS: AN ALGORITHM FOR EVALUATING MEMBERSHIP…
2008
Corpus ID: 15002005
Highly Cited
2008
Highly Cited
2008
Better Alignments = Better Translations?
Kuzman Ganchev
,
João Graça
,
B. Taskar
Annual Meeting of the Association for…
2008
Corpus ID: 633088
Automatic word alignment is a key step in training statistical machine translation systems. Despite much recent work on word…
Expand
Highly Cited
2007
Highly Cited
2007
Comparison of Large Margin Training to Other Discriminative Methods for Phonetic Recognition by Hidden Markov Models
Fei Sha
,
L. Saul
IEEE International Conference on Acoustics…
2007
Corpus ID: 1692444
In this paper we compare three frameworks for discriminative training of continuous-density hidden Markov models (CD-HMMs…
Expand
Highly Cited
2003
Highly Cited
2003
On the performance of graph-based scheduling algorithms for packet radio networks
A. Behzad
,
I. Rubin
GLOBECOM '03. IEEE Global Telecommunications…
2003
Corpus ID: 28126241
Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent…
Expand
Highly Cited
2002
Highly Cited
2002
Estimation of wavefield power distribution in the remotely sensed environment: Bayesian maximum entropy approach
Y. Shkvarko
IEEE Transactions on Signal Processing
2002
Corpus ID: 27016351
The problem of estimating, from one random realization of the remotely sensed signal, the spatial spectrum pattern (SSP) of the…
Expand
Highly Cited
2001
Highly Cited
2001
The Hand Mouse: GMM hand-color classification and mean shift tracking
T. Kurata
,
T. Okuma
,
M. Kourogi
,
K. Sakaue
Proceedings IEEE ICCV Workshop on Recognition…
2001
Corpus ID: 14222337
This paper describes an algorithm to detect and track a hand in each image taken by a wearable camera. We primarily use color…
Expand
Highly Cited
1997
Highly Cited
1997
The role of linear semi-infinite programming in signal-adapted QMF bank design
P. Moulin
,
M. Anitescu
,
K. Kortanek
,
F. Potra
IEEE Transactions on Signal Processing
1997
Corpus ID: 15248391
We consider the problem of designing a perfect-reconstruction, FIR, quadrature-mirror filter (QMF) bank (H, G) adapted to input…
Expand
Highly Cited
1989
Highly Cited
1989
The value of food: effects of open and closed economies
A. Houston
,
J. McNamara
Animal Behaviour
1989
Corpus ID: 53171633
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