Optimizing Prehospital Stroke Diagnosis: Integrating Machine Learning with the FAST Scoring System
Bibliographic record
Abstract
Strokes are a leading cause of disability and death worldwide, and timely diagnosis is critical for effective treatment. Prehospital stroke diagnosis by emergency medical services (EMS) is essential for ensuring prompt care. The FAST (Face, Arms, Speech, and Time) scoring system is a common tool used to identify stroke symptoms quickly. However, the traditional FAST system has limitations, including reliance on subjective assessments and potential misdiagnoses due to symptom variability. This study aims to optimize the FAST scoring system and compare its performance with various machine learning models to enhance stroke prediction accuracy. A dataset from an ambulance service, including prehospital data such as age, sex, and FAST test results, was used. Data preprocessing involved handling missing values, encoding categorical variables, and applying the Synthetic Minority Over-sampling Technique (SMOTE) to balance the dataset. A grid search was conducted to test different weighting schemes for the FAST system. Machine learning models, including Logistic Regression, Random Forest, Support Vector Machine (SVM), XGBoost, and Decision Tree, were trained and evaluated using cross-validation on the training set and tested on a separate test set. The traditional FAST system showed an accuracy of 62.95%. Optimizing the FAST system through grid search marginally increased accuracy to 64.36%. However, machine learning models, particularly Random Forest, significantly outperformed the FAST system, achieving a test set accuracy of 88.54%. XGBoost also demonstrated strong performance with an accuracy of 77.07%, while Logistic Regression, SVM, and Decision Tree showed lower accuracies. These findings suggest that integrating machine learning models into EMS protocols could substantially improve the accuracy of prehospital stroke diagnosis, leading to quicker and more accurate identification and treatment of stroke patients. Although the optimized FAST system offers slight improvements, machine learning models present a promising avenue for enhancing stroke prediction and improving patient outcomes in emergency settings while acknowledging practicality issues.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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".