z-logo
Premium
Analysis of multivariate recurrent event data with time‐dependent covariates and informative censoring
Author(s) -
Zhao Xingqiu,
Liu Li,
Liu Yanyan,
Xu Wei
Publication year - 2012
Publication title -
biometrical journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.108
H-Index - 63
eISSN - 1521-4036
pISSN - 0323-3847
DOI - 10.1002/bimj.201100194
Subject(s) - censoring (clinical trials) , covariate , bivariate analysis , multivariate statistics , statistics , event data , proportional hazards model , multivariate analysis , pairwise comparison , event (particle physics) , mathematics , econometrics , computer science , physics , quantum mechanics
Multivariate recurrent event data are usually encountered in many clinical and longitudinal studies in which each study subject may experience multiple recurrent events. For the analysis of such data, most existing approaches have been proposed under the assumption that the censoring times are noninformative, which may not be true especially when the observation of recurrent events is terminated by a failure event. In this article, we consider regression analysis of multivariate recurrent event data with both time‐dependent and time‐independent covariates where the censoring times and the recurrent event process are allowed to be correlated via a frailty. The proposed joint model is flexible where both the distributions of censoring and frailty variables are left unspecified. We propose a pairwise pseudolikelihood approach and an estimating equation‐based approach for estimating coefficients of time‐dependent and time‐independent covariates, respectively. The large sample properties of the proposed estimates are established, while the finite‐sample properties are demonstrated by simulation studies. The proposed methods are applied to the analysis of a set of bivariate recurrent event data from a study of platelet transfusion reactions.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here