.png){kind=icon}
Return
On simulated EM algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0304-4076(99)00060-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The EM algorithm is a popular and useful algorithm for finding the maximum likelihood estimator in incomplete data problems. Each iteration of the algorithm consists of two simple steps: an E-step, in which a conditional expectation is calculated, and an M-step, where the expectation is maximized. In some problems, however, the EM algorithm cannot be applied since the conditional expectation required in the E-step cannot be calculated. Instead the expectation may be estimated by simulation. We call this a simulated EM algorithm. The simulations can, at least in principle, be done in two ways. Either new independent random variables are drawn in each iteration, or the same uniforms are re-used in each iteration. In this paper the properties of these two versions of the simulated EM algorithm an discussed and compared. (C) 2000 Elsevier Science S.A. All rights reserved.
Keywords:
simulation
EM algorithm
incomplete data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
5.2K
Citations:
3.0W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveGait video-based prediction of unified Parkinson’s disease rating scale score: a retrospective study
OAAI
OAAIShareSave
View more