Enhancing Traffic Speed Prediction Accuracy: The Multialgorithmic Ensemble Model With Spatiotemporal Feature Engineering
Bibliographic record
Abstract
Accurate traffic speed prediction is crucial for efficient traffic management and planning in urban areas. Traditional traffic prediction models often fall short due to their inability to capture the complex and dynamic nature of traffic flow. There is a need for more advanced models that can effectively handle dynamic traffic conditions. This study introduces the multialgorithmic ensemble model (MAEM), a novel framework designed to improve traffic speed prediction accuracy by integrating graph neural networks (GNNs), bidirectional gated recurrent units (Bi‐GRUs), and long short‐term memory (LSTM) networks, to effectively analyze the spatiotemporal characteristics of the traffic network. The methodology involves constructing a virtual graph based on road segment correlations and applying a combination of spatial and temporal feature extraction techniques. The model is further enhanced with an attention mechanism to focus on critical time intervals. The dataset used for this study consists of one‐year aggregated probe vehicle traffic data of 4788 road segments in the City of Hamilton, Ontario. The results demonstrate significant performance, achieving the mean absolute percentage error (MAPE) of 3.5% and root‐mean‐square error (RMSE) of 2.4 km/h, indicating the potential of the proposed framework to significantly enhance traffic speed prediction accuracy and provide a reliable tool for urban traffic management and planning.
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.001 | 0.002 |
| 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.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 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".