The latency time of an infectious disease is de"ned as the time from infection to disease onset. This paper applies the proportional hazards model to estimate the e!ect of covariates on latency when the time of disease onset is exact or right-censored but the time of infection is interval-censored.
Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model
โ Scribed by Wei Pan; Rick Chappell
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 1008 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0167-9473
No coin nor oath required. For personal study only.
โฆ Synopsis
The iterative convex minorant (ICM) algorithm (Groeneboom and Wellner, 1992) is widely believed to be much faster than the EM algorithm (Turnbull, 1976) in computing the NPMLE of the distribution function for interval censored data. Our formulation of the ICM helps to explore its connection with the gradient projection (GP) method that is commonly used in the constrained optimization area. Difficulties in extending the ICM to left truncated and interval censored data are also explained. Simulations were conducted to assess the performance of these methods. In particular, the GP is shown to be much faster than the EM. Due to its generality and simplicity the GP method is easily applied to the Cox proportional hazards model with left truncated and interval censored data. The methodology is illustrated by using the Massachusetts Health Care Panel Study dataset. (~) 1998 Elsevier Science B.V. All rights reserved.
๐ SIMILAR VOLUMES
A strong i.i.d. representation is obtained for the product-limit estimator of the survival function based on left truncated and right censored data. This extends the result of Chao and Lo (1988, Ann. Statist. 16, 661-668) for truncated data. An improved rate of the approximation is also obtained on
We analytically compute the asymptotic Fourier coefficients for several classes of functions to answer two questions. The numerical question is to explain the success of the Weideman-Cloot algorithm for solving differential equations on an infinite interval. Their method combines Fourier expansion w