### Abstract

Original language | English |
---|---|

Pages (from-to) | 649-660 |

Journal | Structural Equation Modeling |

Volume | 23 |

Issue number | 5 |

DOIs | |

Publication status | Published - 2016 |

### Fingerprint

### Cite this

*Structural Equation Modeling*,

*23*(5), 649-660. https://doi.org/10.1080/10705511.2016.1191015

}

*Structural Equation Modeling*, vol. 23, no. 5, pp. 649-660. https://doi.org/10.1080/10705511.2016.1191015

**Bias-adjusted three-step latent Markov modeling with covariates.** / Di Mari, R.; Oberski, D.L.; Vermunt, J.K.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

T1 - Bias-adjusted three-step latent Markov modeling with covariates

AU - Di Mari, R.

AU - Oberski, D.L.

AU - Vermunt, J.K.

PY - 2016

Y1 - 2016

N2 - Latent Markov models with covariates can be estimated via 1-step maximum likelihood. However, this 1-step approach has various disadvantages, such as that the inclusion of covariates in the model might alter the formation of the latent states and that parameter estimation could become infeasible with large numbers of time points, responses, and covariates. This is why researchers typically prefer performing the analysis in a stepwise manner; that is, they first construct the measurement model, then obtain the latent state classifications, and subsequently study the relationship between covariates and latent state memberships. However, such a stepwise approach yields downward-biased estimates of the covariate effects on initial state and transition probabilities. This article, shows how to overcome this problem using a generalization of the bias-corrected 3-step estimation method proposed for latent class analysis (Asparouhov & Muthén, 2014; Bolck, Croon, & Hagenaars, 2004; Vermunt, 2010). We give a formal derivation of the generalization to latent Markov models and discuss how it can be used with many time points by incorporating it into a Baum–Welch type of expectation-maximization algorithm. We evaluate the method through a simulation study and illustrate it using an application on household financial portfolio change. Our study shows that the proposed correction method yields unbiased parameter estimates and accurate standard errors, except for situations with very poorly separated classes and a small sample.

AB - Latent Markov models with covariates can be estimated via 1-step maximum likelihood. However, this 1-step approach has various disadvantages, such as that the inclusion of covariates in the model might alter the formation of the latent states and that parameter estimation could become infeasible with large numbers of time points, responses, and covariates. This is why researchers typically prefer performing the analysis in a stepwise manner; that is, they first construct the measurement model, then obtain the latent state classifications, and subsequently study the relationship between covariates and latent state memberships. However, such a stepwise approach yields downward-biased estimates of the covariate effects on initial state and transition probabilities. This article, shows how to overcome this problem using a generalization of the bias-corrected 3-step estimation method proposed for latent class analysis (Asparouhov & Muthén, 2014; Bolck, Croon, & Hagenaars, 2004; Vermunt, 2010). We give a formal derivation of the generalization to latent Markov models and discuss how it can be used with many time points by incorporating it into a Baum–Welch type of expectation-maximization algorithm. We evaluate the method through a simulation study and illustrate it using an application on household financial portfolio change. Our study shows that the proposed correction method yields unbiased parameter estimates and accurate standard errors, except for situations with very poorly separated classes and a small sample.

U2 - 10.1080/10705511.2016.1191015

DO - 10.1080/10705511.2016.1191015

M3 - Article

VL - 23

SP - 649

EP - 660

JO - Structural Equation Modeling

JF - Structural Equation Modeling

SN - 1070-5511

IS - 5

ER -