.png){kind=icon}
返回
On simulated EM algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0304-4076(99)00060-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
simulation
EM algorithm
incomplete data
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.2K
被引数:
3.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏Gait video-based prediction of unified Parkinson’s disease rating scale score: a retrospective study
OAAI
OAAI分享收藏
查看更多内容