Preprint Article Version 1 This version is not peer-reviewed

Tutorial on EM Algorithm

Version 1 : Received: 17 February 2018 / Approved: 20 February 2018 / Online: 20 February 2018 (15:37:19 CET)
Version 2 : Received: 22 February 2018 / Approved: 22 February 2018 / Online: 22 February 2018 (16:28:05 CET)
Version 3 : Received: 27 February 2018 / Approved: 27 February 2018 / Online: 27 February 2018 (15:06:35 CET)

How to cite: Nguyen, L. Tutorial on EM Algorithm. Preprints 2018, 2018020131 (doi: 10.20944/preprints201802.0131.v1). Nguyen, L. Tutorial on EM Algorithm. Preprints 2018, 2018020131 (doi: 10.20944/preprints201802.0131.v1).

Abstract

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it.

Subject Areas

expectation maximum, EM, generalized expectation maximum, GEM, EM convergence

Readers' Comments and Ratings (0)

Leave a public comment
Send a private comment to the author(s)
Rate this article
Views 0
Downloads 0
Comments 0
Metrics 0
Leave a public comment

×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.