A traffic flow forecasting model based on dynamic graph learning and temporally adaptive attention
Bibliographic record
Abstract
Accurate traffic flow forecasting is essential for ensuring transportation safety and advancing intelligent transportation systems. Static graph–based methods fail to capture the dynamic characteristics of traffic networks, leading to limitations in joint spatiotemporal modeling and multi-step prediction tasks. To address these challenges, this study proposes a Dynamic Spatiotemporal Interaction Model (D-STIM) for traffic flow forecasting. The model comprises three core modules: Efficient Adaptive Spatiotemporal Learning (EASL), Progressive Interactive Learning (PIL), and Temporally Adaptive Attention (TAA). EASL leverages low-rank factorization to model dynamic graph structures, thereby reducing computational complexity and enhancing structural adaptability. PIL establishes bidirectional interaction through spatial-guided temporal aggregation and temporal-guided spatial aggregation, enabling deep spatiotemporal fusion. TAA integrates positional encoding and temporal bias into the attention mechanism to effectively mitigate information degradation in long-horizon forecasting. Extensive experiments on four real-world traffic datasets demonstrate that D-STIM consistently outperforms mainstream baselines in both prediction accuracy and computational efficiency. Moreover, the proposed model provides practical safety benefits by supporting congestion mitigation, reducing accident risks, and informing proactive traffic management strategies
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.000 | 0.001 |
| 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.001 |
| 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".