MétaCan
Menu
Back to cohort
Record W4411538707 · doi:10.1080/02664763.2025.2520337

A gradient boosting decision tree based estimation method for the mixture cure model

2025· article· en· W4411538707 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Applied Statistics · 2025
Typearticle
Languageen
FieldEngineering
TopicEpoxy Resin Curing Processes
Canadian institutionsQueen's University
FundersNational Social Science Fund of ChinaNatural Sciences and Engineering Research Council of CanadaChina Scholarship Council
KeywordsDecision treeBoosting (machine learning)Computer scienceGradient boostingArtificial intelligenceMachine learningDecision tree modelTree (set theory)StatisticsPattern recognition (psychology)MathematicsEconometricsRandom forest

Abstract

fetched live from OpenAlex

Cure models are useful tools for analyzing censored survival data with a cured fraction. However, existing semiparametric estimation methods still rely on restrictive parametric assumptions, and existing nonparametric estimation methods only work with single covariates. In this work, we propose a gradient boosting decision tree based method to estimate the mixture cure model. The new method inherits the features of the original gradient boosting decision tree method and provides more accurate estimates of the cure probability and the relative risk for uncured subjects than existing methods when there are no a priori parametric assumptions on the forms of complex covariate effects in the model. This is demonstrated with small mean square errors in the estimates of the cure probability, relative risk score, and survival function in a simulation study with large samples. The method also has the potential to deal with high-dimensional covariates. The proposed method is illustrated with a large sample study of colon cancer.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.122
Threshold uncertainty score0.369

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.013
GPT teacher head0.302
Teacher spread0.289 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it