Building Latent Class Growth Trees

被引:8
作者
van den Bergh, Mattis [1 ]
Vermunt, Jeroen K. [1 ]
机构
[1] Tilburg Univ, Tilburg, Netherlands
关键词
hierarchical clustering; latent class growth analysis; latent class growth trees; longitudinal data; mixture models; MIXTURE; MODEL; NUMBER;
D O I
10.1080/10705511.2017.1389610
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Researchers use latent class growth (LCG) analysis to detect meaningful subpopulations that display different growth curves. However, especially when the number of classes required to obtain a good fit is large, interpretation of the encountered class-specific curves might not be straightforward. To overcome this problem, we propose an alternative way of performing LCG analysis, which we call LCG tree (LCGT) modeling. For this purpose, a recursive partitioning procedure similar to divisive hierarchical cluster analysis is used: Classes are split until a certain criterion indicates that the fit does not improve. The advantage of the LCGT approach compared to the standard LCG approach is that it gives a clear insight into how the latent classes are formed and how solutions with different numbers of classes relate. The practical use of the approach is illustrated using applications on drug use during adolescence and mood regulation during the day.
引用
收藏
页码:331 / 342
页数:12
相关论文
共 29 条
[1]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[2]  
[Anonymous], 2001, SPRINGER SERIES STAT, DOI [DOI 10.1007/978-0-387-21606-5, 10.1007/978-0-387-21606-5]
[3]  
[Anonymous], HDB QUANTITATIVE MET
[4]  
[Anonymous], 2004, FINITE MIXTURE MODEL
[5]  
[Anonymous], 2002, HIERARCHICAL LINEAR
[6]  
[Anonymous], 2013, Technical Guide for Latent GOLD 5.0: Basic, Advanced
[7]   Exploring Dynamics in Mood Regulation-Mixture Latent Markov Modeling of Ambulatory Assessment Data [J].
Crayen, Claudia ;
Eid, Michael ;
Lischetzke, Tanja ;
Courvoisier, Delphine S. ;
Vermunt, Jeroen K. .
PSYCHOSOMATIC MEDICINE, 2012, 74 (04) :366-376
[8]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[9]  
Elliot D.S., 1989, MULTIPLE PROBLEM YOU
[10]  
Everitt B.S., 2011, Cluster Analysis, V5th, P71, DOI DOI 10.1002/9780470977811.CH4