Let denote eventual death or recovery, respectively; is the time from admission to that terminal event, and . A patient still hospitalized at collection has right censoring: only is known, where is the elapsed time since admission. Both eventual outcomes are then unobserved. A recorded death or discharge is an observed terminal event in this competing risks model; discharge is not censoring of an otherwise observable later in-hospital death. Assume the observation deadline, conditional on relevant admission information, is noninformative for .
Let and . A recorded death observes both and , so its likelihood contribution, omitting factors from the independent observation mechanism, isIts integration over gives the eventual death probability .
A recorded discharge observes and . Its likelihood contribution isThe mixing probability distinguishes the joint outcome-and-time density from the conditional recovery-time density.
For a patient still in hospital, sum over the unobserved eventual outcome. Its likelihood contribution is the mixture survival functionThe probability of eventual death among those still hospitalized is generally different from , because the two conditional time distributions can have different tails.
This is an EM algorithm for a censored lognormal competing-risks mixture. Write and suppose , with mixing weights , . The missing data are and for censored patients; neither is missing for recorded deaths or recoveries. The complete-data log-likelihood, apart from terms independent of the parameters, isThe lognormal Jacobian is also parameter-independent and therefore does not affect the maximization.
At iteration , set for each censored patient and let . Bayes' rule gives the E-step class weightsGiven that class, has a truncated normal distribution above . With the Inverse Mills ratio , compute both moments needed for the E-step:Thus , , and the corresponding second moment is . For an observed outcome at time , use , , and . These specify the full conditional expectation of .
Put and let be the total number of patients. Maximizing that expected complete-data log-likelihood gives the M-stepAll moments on the right are evaluated at the old parameters. Repeat the E-step and M-step until the observed log-likelihood stabilizes, using positive initial variances and mixing weights. The expectation-maximization algorithm increases that likelihood at each exact iteration, but need not find its global maximum; multiple starts help distinguish local optima. The resulting estimates give the case fatality probability andThese are conditional event-time distributions, distinct from the cumulative incidence functions and .
Articles by others on the same topic
There are currently no matching articles.