scholarly journals Maximum Likelihood Estimation using the EM Algorithm

2021 ◽  
Vol 8 (9) ◽  
pp. 275-277
Author(s):  
Ahsene Lanani

This paper yields with the Maximum likelihood estimation using the EM algorithm. This algorithm is very used to solve nonlinear equations with missing data. We estimated the linear mixed model parameters and those of the variance-covariance matrix. The considered structure of this matrix is not necessarily linear. Keywords: Algorithm EM; Maximum likelihood; Mixed linear model.

1995 ◽  
Vol 12 (5) ◽  
pp. 515-527 ◽  
Author(s):  
Jeanine J. Houwing-Duistermaat ◽  
Lodewijk A. Sandkuijl ◽  
Arthur A. B. Bergen ◽  
Hans C. van Houwelingen

Psych ◽  
2020 ◽  
Vol 2 (4) ◽  
pp. 209-252
Author(s):  
Marie Beisemann ◽  
Ortrud Wartlick ◽  
Philipp Doebler

The expectation–maximization (EM) algorithm is an important numerical method for maximum likelihood estimation in incomplete data problems. However, convergence of the EM algorithm can be slow, and for this reason, many EM acceleration techniques have been proposed. After a review of acceleration techniques in a unified notation with illustrations, three recently proposed EM acceleration techniques are compared in detail: quasi-Newton methods (QN), “squared” iterative methods (SQUAREM), and parabolic EM (PEM). These acceleration techniques are applied to marginal maximum likelihood estimation with the EM algorithm in one- and two-parameter logistic item response theory (IRT) models for binary data, and their performance is compared. QN and SQUAREM methods accelerate convergence of the EM algorithm for the two-parameter logistic model significantly in high-dimensional data problems. Compared to the standard EM, all three methods reduce the number of iterations, but increase the number of total marginal log-likelihood evaluations per iteration. Efficient approximations of the marginal log-likelihood are hence an important part of implementation.


Sign in / Sign up

Export Citation Format

Share Document