Survival models and longitudinal medical events for hospital readmission forecasting
Bibliographic record
Abstract
BACKGROUND: The rate of 30-day all-cause hospital readmissions can affect the funding a hospital receives. An accurate and reliable readmission prediction model could save money and increase quality-of-care. Few projects have explored formulating this task as a survival prediction problem, where models can exploit a real-valued time-to-readmission target. This paper demonstrates the effectiveness of a survival-inspired readmission model, especially when paired with a longitudinal patient representation that is agnostic to disease-cohort and predictive task. METHODS: We forecast readmissions for a population-level cohort of 421,088 patients discharged in 2015 and 2016 from hospitals in Alberta, Canada. Clinical features and sequences of historical medical codes (calculated from at least four full years prior to discharge) from linked administrative sources serve as model inputs. We trained binary 30-day readmission models (XGBoost and a Deep Neural Network) and time-to-event readmission models (CoxPH and N-MTLR) with and without machine-learned medical knowledge at initialization, then compared against the popular LACE-based model using the AUROC score at 30 days (AUROC@30). Survival models are additionally evaluated using concordance, Integrated Brier, and L1-loss scores. RESULTS: All models that utilize sequence features markedly out-perform even the best models trained on only clinical features. Further, a time-to-event target improves predictive performance at 30 days, given the same model inputs and architecture. N-MTLR, using solely sequence inputs and initialized with pre-learned medical knowledge, achieves an average AUROC@30 of 0.8460 over five folds with a standard deviation of 0.003. All trained models match or out-perform the LACE baseline of 0.6587±0.003. CONCLUSION: Sequences of administrative medical codes contain rich predictive information for forecasting readmissions, and embedding medical knowledge a priori using machine learning provides readmission models an advantageous foundation for training. When combined with a model that can leverage a time-to-event target, excellent performance is possible on the 30-day all-cause readmission task using only administrative data.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".