z-logo
Premium
A hidden Markov model approach to analyze longitudinal ternary outcomes when some observed states are possibly misclassified
Author(s) -
Benoit Julia S.,
Chan Wenyaw,
Luo Sheng,
Yeh HungWen,
Doody Rachelle
Publication year - 2016
Publication title -
statistics in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.996
H-Index - 183
eISSN - 1097-0258
pISSN - 0277-6715
DOI - 10.1002/sim.6861
Subject(s) - covariate , categorical variable , identifiability , computer science , hidden markov model , expectation–maximization algorithm , statistics , econometrics , artificial intelligence , maximum likelihood , mathematics , machine learning
Understanding the dynamic disease process is vital in early detection, diagnosis, and measuring progression. Continuous‐time Markov chain (CTMC) methods have been used to estimate state‐change intensities but challenges arise when stages are potentially misclassified. We present an analytical likelihood approach where the hidden state is modeled as a three‐state CTMC model allowing for some observed states to be possibly misclassified. Covariate effects of the hidden process and misclassification probabilities of the hidden state are estimated without information from a ‘gold standard’ as comparison. Parameter estimates are obtained using a modified expectation‐maximization (EM) algorithm, and identifiability of CTMC estimation is addressed. Simulation studies and an application studying Alzheimer's disease caregiver stress‐levels are presented. The method was highly sensitive to detecting true misclassification and did not falsely identify error in the absence of misclassification. In conclusion, we have developed a robust longitudinal method for analyzing categorical outcome data when classification of disease severity stage is uncertain and the purpose is to study the process' transition behavior without a gold standard. Copyright © 2016 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here