A quantile variant of the expectation–maximization algorithm and its application to parameter estimation with interval data. Issue 3 (September 2018)

• Record Type: Journal Article
• Authors: Park, Chanseok
• Is Part Of: Journal of algorithms & computational technology. Volume 12:Issue 3(2018)
• Page Start: 253
• Page End: 272
• Publication Date: 2018-09
• Subjects: Expectation–maximization algorithm -- incomplete data -- maximum likelihood -- Monte Carlo expectation–maximization -- missing data -- quantile; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/1748301818779007
• Languages: English
• ISSNs: 1748-3018

Abstract

The expectation–maximization algorithm is a powerful computational technique for finding the maximum likelihood estimates for parametric models when the data are not fully observed. The expectation–maximization is best suited for situations where the expectation in each E-step and the maximization in each M-step are straightforward. A difficulty with the implementation of the expectation–maximization algorithm is that each E-step requires the integration of the log-likelihood function in closed form. The explicit integration can be avoided by using what is known as the Monte Carlo expectation–maximization algorithm. The Monte Carlo expectation–maximization uses a random sample to estimate the integral at each E-step. But the problem with the Monte Carlo expectation–maximization is that it often converges to the integral quite slowly and the convergence behavior can also be unstable, which causes computational burden. In this paper, we propose what we refer to as the quantile variant of the expectation–maximization algorithm. We prove that the proposed method has an accuracy ofO ( 1 / K 2 ), while the Monte Carlo expectation–maximization method has an accuracy ofO p ( 1 / K ) . Thus, the proposed method possesses faster and more stable convergence properties when compared with the Monte Carlo expectation–maximization algorithm. The improved performance is illustrated through the numerical studies. Several practical examples illustrating its use in interval-censored data problems are also provided.