AR(1) latent class models for longitudinal count data. (21st August 2018)

• Record Type: Journal Article
• Authors: Henderson, Nicholas C.; Rathouz, Paul J.
• Is Part Of: Statistics in medicine. Volume 37:Number 29(2018)
• Page Start: 4441
• Page End: 4456
• Publication Date: 2018-08-21
• Subjects: discrete AR(1) processes -- finite mixture model -- negative binomial -- repeated measures; Medical statistics -- Periodicals; Statistique médicale -- Périodiques; Statistiques médicales -- Périodiques; 610.727
• DOI: 10.1002/sim.7931
• Languages: English
• ISSNs: 0277-6715

Abstract

Abstract : In a variety of applications involving longitudinal or repeated‐measurements data, it is desired to uncover natural groupings or clusters that exist among study subjects. Motivated by the need to recover clusters of longitudinal trajectories of conduct problems in the field of developmental psychopathology, we propose a method to address this goal when the response data in question are counts. We assume the subject‐specific observations are generated from a first‐order autoregressive process that is appropriate for count data. A key advantage of our approach is that the class‐specific likelihood function arising from each subject's data can be expressed in closed form, circumventing common computational issues associated with random effects models. To further improve computational efficiency, we propose an approximate EM procedure for estimating the model parameters where, within each EM iteration, the maximization step is approximated by solving an appropriately chosen set of estimating equations. We explore the effectiveness of our procedures through simulations based on a four‐class model, placing a special emphasis on recovery of the latent trajectories. Finally, we analyze data and recover trajectories of conduct problems in an important nationally representative sample. The methods discussed here are implemented in the R package inarmix, which is available from the Comprehensive R Archive Network (http://cran.r-project.org ).