Incorporating Machine Learning Driven Factors in the Design of Electronic-triggers to Detect Diagnostic Errors in the Emergency Department
Bibliographic record
Abstract
OBJECTIVES: Electronic health records (EHR)-based triggers (eTriggers) have been used to study diagnostic errors in the emergency department (ED), often with suboptimal performance. Our objective was to investigate incremental value of multi-factor machine learning (ML) approaches to improve eTrigger performance. METHODS: Patients presenting to an academic ED were categorized into trigger-positive and trigger-negative using standard trigger (T) definitions: (T1) ED return visits resulting in admission within 10 days; (T2) care escalation from the inpatient unit to the ICU within 24 hours; and (T3) deaths within 24 hours of admission. We trained and evaluated 6 supervised ML models. RESULTS: A total of 124,053 consecutive encounters (5791 T-positive and 118,262 T-negative) were included. Among the T-positive, 4159 (72%) were associated with T1, 1415 (24%) with T2, and 217 (4%) with T3. The T-based positive predictive values (PPV) were 5.2% for T1, 8.2% for T2, and 6.5% for T3. ML models trained and evaluated on balanced training dataset and imbalanced test set had low classification performances (accuracy: 0.72-0.95; PPV: 0.00-0.16; F1-score: 0.00-0.23). Higher performances were observed in balanced test sets (accuracy: 0.80-0.97; PPV: 0.82-1.00; F1-score: 0.79-0.97). Comparing models trained on clinically annotated data with models trained on T-based labels identified other important factors. CONCLUSIONS: Utilizing machine learning to refine e-triggers slightly improves the identification of diagnostic errors, as evidenced by an increase in PPV values. We identified new potential factors contributing to ED diagnostic errors. These findings open new avenues to construct or modify more accurate e-triggers for diagnostic error identification.
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.006 | 0.021 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".