Predicting recurrence and recurrence‐free survival in high‐grade endometrial cancer using machine learning
Bibliographic record
Abstract
OBJECTIVE: To develop machine-learning models to predict recurrence and time-to-recurrence in high-grade endometrial cancer (HGEC) following surgery and tailored adjuvant treatment. METHODS: Data were retrospectively collected across eight Canadian centers including 1237 patients. Four models were trained to predict recurrence: random forests, boosted trees, and two neural networks. Receiver operating characteristic curves were used to select the best model based on the highest area under the curve (AUC). For time to recurrence, we compared random forests and Least Absolute Shrinkage and Selection Operator (LASSO) model to Cox proportional hazards. RESULTS: The random forest was the best model to predict recurrence in HGEC; the AUCs were 85.2%, 74.1%, and 71.8% in the training, validation, and test sets, respectively. The top five predictors were: stage, uterus height, specimen weight, adjuvant chemotherapy, and preoperative histology. Performance increased to 77% and 80% when stratified by Stage III and IV, respectively. For time to recurrence, there was no difference between the LASSO and Cox proportional hazards models (c-index 71%). The random forest had a c-index of 60.5%. CONCLUSIONS: A bootstrap random forest model may be a more accurate technique to predict recurrence in HGEC using multiple clinicopathologic factors. For time to recurrence, machine-learning methods performed similarly to the Cox proportional hazards model.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.010 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".