Your browser doesn't support javascript.
loading
Regularized continuous-time Markov Model via elastic net.
Huang, Shuang; Hu, Chengcheng; Bell, Melanie L; Billheimer, Dean; Guerra, Stefano; Roe, Denise; Vasquez, Monica M; Bedrick, Edward J.
Afiliação
  • Huang S; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Hu C; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Bell ML; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Billheimer D; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Guerra S; Asthma and Airway Disease Research Center, University of Arizona, Tucson, Arizona, U.S.A.
  • Roe D; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Vasquez MM; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
  • Bedrick EJ; Department of Epidemiology and Biostatistics, University of Arizona, Tucson, Arizona, U.S.A.
Biometrics ; 74(3): 1045-1054, 2018 09.
Article em En | MEDLINE | ID: mdl-29534304
Continuous-time Markov models are commonly used to analyze longitudinal transitions between multiple disease states in panel data, where participants' disease states are only observed at multiple time points, and the exact state paths between observations are unknown. However, when covariate effects are incorporated and allowed to vary for different transitions, the number of potential parameters to estimate can become large even when the number of covariates is moderate, and traditional maximum likelihood estimation and subset model selection procedures can easily become unstable due to overfitting. We propose a novel regularized continuous-time Markov model with the elastic net penalty, which is capable of simultaneous variable selection and estimation for large number of parameters. We derive an efficient coordinate descent algorithm to solve the penalized optimization problem, which is fully automatic and data driven. We further consider an extension where one of the states is death, and time of death is exactly known but the state path leading to death is unknown. The proposed method is extensively evaluated in a simulation study, and demonstrated in an application to real-world data on airflow limitation state transitions.
Assuntos
Palavras-chave

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Assunto principal: Algoritmos / Cadeias de Markov / Progressão da Doença Tipo de estudo: Health_economic_evaluation / Prognostic_studies / Risk_factors_studies Limite: Humans Idioma: En Revista: Biometrics Ano de publicação: 2018 Tipo de documento: Article País de afiliação: Estados Unidos

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Assunto principal: Algoritmos / Cadeias de Markov / Progressão da Doença Tipo de estudo: Health_economic_evaluation / Prognostic_studies / Risk_factors_studies Limite: Humans Idioma: En Revista: Biometrics Ano de publicação: 2018 Tipo de documento: Article País de afiliação: Estados Unidos