Event-Aware Imputation and Prediction of Urban Traffic Using Deep Spatiotemporal Learning Models
Bibliographic record
Abstract
This dissertation presents a comprehensive investigation into the dual challenges of missing traffic data and the complexities of traffic speed prediction during social events, a topic of growing relevance in urban mobility systems. Urban centers are increasingly experiencing non-recurring disruptions caused by concerts, sports games, festivals, and other social activities, which introduce sharp deviations in regular traffic patterns. At the same time, traffic data, which are foundational for intelligent transportation systems (ITS), often suffer from incompleteness due to sensor failures, transmission errors, and insufficient probe vehicle coverage. This research addressed these intertwined challenges by developing a unified framework combining robust imputation methods with deep learning-based event-aware prediction architectures. The first contribution is the development of a two-stage imputation pipeline that integrates ensemble-based and generative approaches. Random Forest models are employed to provide fast, robust estimates, while Generative Adversarial Imputation Networks (GAIN) refine the results, capturing complex dependencies and uncertainty. Experiments on Hamilton, Ontario data demonstrate that the framework reduces imputation error (MAPE) by 20–30\% compared to traditional methods, while maintaining scalability under varying missingness levels. The second major contribution is the development of an Event-Aware LSTM (EA-LSTM) model that explicitly incorporates structured social event features—such as event type, timing, location, and attendance—into a spatiotemporal architecture combining Graph Convolutional Networks, bidirectional LSTMs, and attention mechanisms. The EA-LSTM significantly improves prediction accuracy during disruptions, reducing average error to 3.4\% network-wide and under 9\% near event venues, outperforming conventional deep learning baselines. The findings demonstrate that integrating contextual event information enhances both traffic imputation and prediction, leading to more robust, interpretable, and scalable models. The research provides practical insights for the deployment of real-time ITS applications, offering tools to support congestion management, dynamic signal control, and event traffic planning in complex urban environments.
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.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 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".