A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants

Author:

Neal Radford M.,Hinton Geoffrey E.

Publisher

Springer Netherlands

Reference7 articles.

1. Csiszàr I. and Tusnàdy, G. (1984) “Information geometry and alternating minimization procedures”, in E. J. Dudewicz, et al(editors) Recent Results in Estimation Theory and Related Topics(Statistics and Decisions, Supplement Issue No. 1, 1984 ).

2. Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977) “Maximum likelihood from incomplete data via the EM algorithm” (with discussion), Journal of the Royal Statistical Society B, vol. 39, pp. 1–38.

3. Hathaway, R. J. (1986) “Another interpretation of the EM algorithm for mixture distributions”, Statistics and Probability Letters, vol. 4, pp. 53–56.

4. McLachlan, G. J. and Krishnan, T. (1997) The EM Algorithm and Extensions, New York: Wiley.

5. Meng, X. L. and Rubin, D. B. (1992) “Recent extensions of the EM algorithm (with discussion) ”, in J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith (editors), Bayesian Statistics4, Oxford: Clarendon Press.

Cited by 444 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. VEM$$^2$$L: an easy but effective framework for fusing text and structure knowledge on sparse knowledge graph completion;Data Mining and Knowledge Discovery;2024-02-06

2. Heterogeneity Analysis on Multi-state Brain Functional Connectivity and Adolescent Neurocognition;Journal of the American Statistical Association;2024-02

3. Financial Condition Indices in an Incomplete Data Environment;Studies in Nonlinear Dynamics & Econometrics;2023-12-21

4. Risk-Sensitive RL Using Sampling-Based Expectation-Maximization;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13

5. EM Algorithm and Its Extensions;Machine Learning Methods;2023-12-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3