Group-based trajectory modeling under non-random attrition: A sensitivity analysis and application to frailty trajectories

Group-based trajectory modeling (GBTM) is used to identify trajectories but suffers from attrition bias when dropout is nonrandom. We evaluate an extended GBTM that models attrition as a latent-class process. Monte Carlo simulations compare the extended model with conventional GBTM across trajectory separation and missing-data mechanisms, and test a parsimonious version with a constant dropout rate within classes. conventional GBTM is adequate for separated trajectories but biased when they overlap and attrition is nonrandom. The extended GBTM remains unbiased, as shown in Manitoba frailty data. Implications: modeling attrition improves robustness; the parsimonious extension remains reliable under complex dropout. • Compared extended GBTM with conventional GBTM under simulated non-random attrition. • Conventional GBTM bias emerged when trajectory classes overlapped and attrition was non-random; robust only under well-separated trajectories. • Parsimonious extended GBTM (constant dropout rate within classes) consistently produced unbiased estimates of class proportions and trajectory shapes across all scenarios. • Empirical application to frailty data reclassified 11% of the sample into a high-risk worsening group, illustrating the practical impact of accounting for attrition.

Authors

Institutions

Publication Details

Journal
Methods in Psychology
Published
2025-12-27
DOI
https://doi.org/10.1016/j.metip.2025.100225
Primary Topic
Anomaly Detection Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Group-based trajectory modeling under non-random attrition: A sensitivity analysis and application to frailty trajectories

Depeng Jiang, Robert B. Tate, Philip St. John, Chendong Li
Methods in Psychology
Anomaly Detection Techniques and Applications
article

Group-based trajectory modeling under non-random attrition: A sensitivity analysis and application to frailty trajectories

Depeng Jiang, Robert B. Tate, Philip St. John, Chendong Li
article en

Abstract

Group-based trajectory modeling (GBTM) is used to identify trajectories but suffers from attrition bias when dropout is nonrandom. We evaluate an extended GBTM that models attrition as a latent-class process. Monte Carlo simulations compare the extended model with conventional GBTM across trajectory separation and missing-data mechanisms, and test a parsimonious version with a constant dropout rate within classes. conventional GBTM is adequate for separated trajectories but biased when they overlap and attrition is nonrandom. The extended GBTM remains unbiased, as shown in Manitoba frailty data. Implications: modeling attrition improves robustness; the parsimonious extension remains reliable under complex dropout. • Compared extended GBTM with conventional GBTM under simulated non-random attrition. • Conventional GBTM bias emerged when trajectory classes overlapped and attrition was non-random; robust only under well-separated trajectories. • Parsimonious extended GBTM (constant dropout rate within classes) consistently produced unbiased estimates of class proportions and trajectory shapes across all scenarios. • Empirical application to frailty data reclassified 11% of the sample into a high-risk worsening group, illustrating the practical impact of accounting for attrition.

Methods in PsychologyVol. 14
University of Manitoba (CA), Texas A&M University (US)
Openalex Percentile: Top 18%
Anomaly Detection Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.