A comparative evaluation of established and contemporary deep learning traffic prediction methods
Bibliographic record
Abstract
Traffic prediction is an essential component in intelligent transportation systems. Various methods have been developed to solve this challenging problem over the years, including time series models, regression models, and, more recently, deep learning models. This chapter provides an unbiased comparison of these methods under a variety of settings and also addresses the critical question of whether deep learning approaches can offer significant improvements over classical machine learning methods. A traffic simulation model of the Greater Toronto Area was used to generate traffic data for a stretch of highway as well as an urban region. Using these datasets, the methods were compared under five scenarios with different prediction horizons, the presence of missing data, and the presence of traffic events unseen in the training data. Experimental results showed that deep learning methods of traffic prediction, including graph convolutional neural networks, are effective for traffic prediction. Graph neural networks with shared parameters were compact, resistant to overfitting, and performed well in all of the experiments. However, ensemble methods such as random forest regression can generate more accurate predictions at the cost of higher resource consumption during training, which may become a challenge in large transportation networks. Overall, deep learning architectures should be carefully designed by restricting the input to features with known influences on the predictions, which can guide parameter learning and improve performance.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".