2022
DOI: 10.1007/s42519-022-00274-8
|View full text |Cite
|
Sign up to set email alerts
|

A Stochastic Version of the EM Algorithm for Mixture Cure Model with Exponentiated Weibull Family of Lifetimes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 54 publications
0
8
0
Order By: Relevance
“…It will be interesting to see how the NCG algorithm performs in these cases and how it compares with the EM algorithm or a variation of the EM algorithm. [47][48][49] Regarding the complexity order of the NCG algorithm, it has been recently shown that computing the complexity of NCG algorithm is a challenging task for non-convex problems. 50 The only known complexity result is for finite dimensional convex quadratic problems, when the NCG algorithm converges in finitely many steps, much faster than other optimization algorithms.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…It will be interesting to see how the NCG algorithm performs in these cases and how it compares with the EM algorithm or a variation of the EM algorithm. [47][48][49] Regarding the complexity order of the NCG algorithm, it has been recently shown that computing the complexity of NCG algorithm is a challenging task for non-convex problems. 50 The only known complexity result is for finite dimensional convex quadratic problems, when the NCG algorithm converges in finitely many steps, much faster than other optimization algorithms.…”
Section: Discussionmentioning
confidence: 99%
“…The NCG algorithm may be useful for other complicated cure rate models, for example, the Conway‐Maxwell (COM) Poisson cure rate model and the destructive COM‐Poisson cure rate model, 15,22 where a profile likelihood approach has been proposed for the estimation of the COM‐Poisson shape parameter ϕ$$ \phi $$ due to the flatness of the likelihood surface with respect to ϕ$$ \phi $$. It will be interesting to see how the NCG algorithm performs in these cases and how it compares with the EM algorithm or a variation of the EM algorithm 47‐49 . Regarding the complexity order of the NCG algorithm, it has been recently shown that computing the complexity of NCG algorithm is a challenging task for non‐convex problems 50 .…”
Section: Discussionmentioning
confidence: 99%
“…In such a case, the Kaplan-Meier survival curve shows a long plateau that levels off to a non-zero value, indicating the presence of a cured subgroup. [1][2][3][4][5] To capture the mixture patient population, mixture cure model (MCM) and associated estimation methods have been proposed as extensions to the standard survival models; see the recent monograph by Peng and Yu for a book-length account on MCM. 6 The cured statuses of patients or their survival probabilities are often the primary parameters of interest in predictions and prognoses.…”
Section: Introductionmentioning
confidence: 99%
“…As a result, the overall patient population can be regarded as a mixture of these two groups of patients. In such a case, the Kaplan‐Meier survival curve shows a long plateau that levels off to a non‐zero value, indicating the presence of a cured subgroup 1‐5 …”
Section: Introductionmentioning
confidence: 99%
“…Introduced by Boag 1 and exclusively studied by Berkson and Gage, 2 the mixture cure rate model is perhaps the most popular cure rate model. 3 If T * denotes the lifetime of a susceptible (not cured) subject, then, the actual lifetime T for any subject can be modeled by where J is a cure indicator with J = 0 if an individual is cured and J = 1 otherwise. Furthermore, considering S p false( t false) = P false( T > t false) and S u false( t false) = P false( T * > t false) as the respective survival functions corresponding to T and T *, we can express where π = P false( J = 1 false).…”
Section: Introductionmentioning
confidence: 99%