Stochastic approximation Monte Carlo EM for change-point analysis

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In the expectation-maximization (EM) algorithm for maximum likelihood estimation from incomplete data, Markov chain Monte Carlo (MCMC) methods have been used in change-point inference for a long time when the expectation step is intractable. However, the conventional MCMC algorithms tend to get trapped in local mode in simulating from the posterior distribution of change points. To overcome this problem, in this paper we propose a stochastic approximation Monte Carlo version of EM (SAM-CEM), which is a combination of adaptive Markov chain Monte Carlo and EM utilizing a maximum likelihood method. SAMCEM is compared with the stochastic approximation version of EM and reversible jump Markov chain Monte Carlo version of EM on simulated and real datasets. The numerical results indicate that SAMCEM can outperform among the three methods by producing much more accurate parameter estimates and the ability to achieve change-point positions and estimates simultaneously.

키워드

Change-point problemexpectation-maximizationMarkov chain Monte Carlostochastic approximation Monte CarloMAXIMUM-LIKELIHOODALGORITHMCONVERGENCE
제목
Stochastic approximation Monte Carlo EM for change-point analysis
저자
Lim, Hwa KyungLee, JaejunCheon, Sooyoung
DOI
10.1080/00949655.2016.1192630
발행일
2017-01
유형
Article
저널명
Journal of Statistical Computation and Simulation
87
1
페이지
69 ~ 87