Predicting Waiting Times for Medical Tasks in a Pediatric Hospital Using Machine Learning: Comprehensive, Retrospective, Real-World Study
Bibliographic record
Abstract
Background: The shortage of pediatric medical resources and overcrowding in children's hospitals are severe issues in China. Accurately predicting waiting times can help optimize hospital operational efficiency. Objective: This study aims to develop machine learning models to predict waiting times for various laboratory and radiology examinations at a pediatric hospital. Methods: Time stamp data from laboratory and radiology examinations were retrospectively collected from the pediatric hospital information system between November 1, 2024, and March 13, 2025. Two queue-related and 4 time-based features were extracted using queue theory. Linear regression and 8 machine learning models were trained to predict waiting times for each medical task. Hyperparameters were fine-tuned using randomized search and 10-fold cross-validation, and the bootstrap method was used for model evaluation. Mean absolute error, mean square error, root mean square error, and the coefficient of determination (R²) were used as evaluation metrics. Shapley additive explanations values were used to assess feature importance. Results: A total of 230,864 time-stamped records were included after data preprocessing. The median waiting time was 4.817 (IQR 1.867-12.050) minutes for all medical tasks. Waiting times for radiology examinations were generally longer than those for laboratory tests. Tree-based algorithms, such as random forest and classification and regression trees, performed best in predicting laboratory test waiting times, with R² values ranging from mean 0.880(SD 0.003) to mean 0.934 (SD 0.003). However, the machine learning models did not perform well in predicting radiology examination waiting times, with R2 ranging from 0.114 (SD 0.005) to 0.719 (SD 0.004). Feature importance analysis revealed that queue-related predictors, especially the number of queuing patients, were the most important in predicting waiting times. Conclusions: Task-specific prediction models are more appropriate for accurately predicting waiting times across various medical tasks. Guided by queue theory principles, we developed machine learning models for the waiting time prediction of each medical task and highlighted the importance of queue-related predictors.
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.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.002 |
| 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".