A Bayesian Approach in Estimating Transition Probabilities of a Discrete-time Markov Chain for Ignorable Intermittent Missing Data. Issue 7 (8th August 2016)

• Record Type: Journal Article
• Authors: Ma, Junsheng; Yu, Xiaoying; Symanski, Elaine; Doody, Rachelle; Chan, Wenyaw
• Is Part Of: Communications in statistics. Volume 45:Issue 7(2016)
• Page Start: 2598
• Page End: 2616
• Publication Date: 2016-08-08
• Subjects: Bayesian -- EM algorithm -- Markov chain -- Missing data -- Rejection algorithm; Mathematical statistics -- Periodicals; Mathematical statistics -- Data processing -- Periodicals; Digital computer simulation -- Periodicals; 519.5
• DOI: 10.1080/03610918.2014.911895
• Languages: English
• ISSNs: 0361-0918

Abstract

Abstract : This article focuses on data analyses under the scenario of missing at random within discrete-time Markov chain models. The naive method, nonlinear (NL) method, and Expectation-Maximization (EM) algorithm are discussed. We extend the NL method into a Bayesian framework, using an adjusted rejection algorithm to sample the posterior distribution, and estimating the transition probabilities with a Monte Carlo algorithm. We compare the Bayesian nonlinear (BNL) method with the naive method and the EM algorithm with various missing rates, and comprehensively evaluate estimators in terms of biases, variances, mean square errors, and coverage probabilities (CPs). Our simulation results show that the EM algorithm usually offers smallest variances but with poorest CP, while the BNL method has smaller variances and better/similar CP as compared to the naive method. When the missing rate is low (about 9%, MAR), the three methods are comparable. Whereas when the missing rate is high (about 25%, MAR), overall, the BNL method performs slightly but consistently better than the naive method regarding variances and CP. Data from a longitudinal study of stress level among caregivers of individuals with Alzheimer's disease is used to illustrate these methods.