Machine learning decision tree algorithm role for predicting mortality in critically ill adult COVID-19 patients admitted to the ICU
Bibliographic record
Abstract
BACKGROUND: Coronavirus disease-19 (COVID-19) is caused by the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) and is currently a major cause of intensive care unit (ICU) admissions globally. The role of machine learning in the ICU is evolving but currently limited to diagnostic and prognostic values. A decision tree (DT) algorithm is a simple and intuitive machine learning method that provides sequential nonlinear analysis of variables. It is simple and might be a valuable tool for bedside physicians during COVID-19 to predict ICU outcomes and help in critical decision-making like end-of-life decisions and bed allocation in the event of limited ICU bed capacities. Herein, we utilized a machine learning DT algorithm to describe the association of a predefined set of variables and 28-day ICU outcome in adult COVID-19 patients admitted to the ICU. We highlight the value of utilizing a machine learning DT algorithm in the ICU at the time of a COVID-19 pandemic. METHODS: This was a prospective and multicenter cohort study involving 14 hospitals in Saudi Arabia. We included critically ill COVID-19 patients admitted to the ICU between March 1, 2020, and October 31, 2020. The predictors of 28-day ICU mortality were identified using two predictive models: conventional logistic regression and DT analyses. RESULTS: There were 1468 critically ill COVID-19 patients included in the study. The 28-day ICU mortality was 540 (36.8 %), and the 90-day mortality was 600 (40.9 %). The DT algorithm identified five variables that were integrated into the algorithm to predict 28-day ICU outcomes: need for intubation, need for vasopressors, age, gender, and PaO2/FiO2 ratio. CONCLUSION: DT is a simple tool that might be utilized in the ICU to identify critically ill COVID-19 patients who are at high risk of 28-day ICU mortality. However, further studies and external validation are still required.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.007 | 0.189 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".