A GNN Approach for Turn-Level Traffic Prediction: Dynamic Relation Awareness and Hypergraph Modeling
Bibliographic record
Abstract
It cannot be emphasized too much to predict traffic flow accurately in modern intelligent transportation systems. Though big progress has been made, few works focus on the turn-level traffic flow prediction, which is important to inspect fine-grained urban traffic dynamics closely. In this work, we develop a GNN (Graph Neural Network) approach built upon Dynamic Relation Awareness and Hypergraph modeling toward turn-level traffic flow prediction, namely DrahGNN. First, we construct a dynamic graph sequence where each snapshot denotes a turn-level traffic flow picture on top of a real-world road network. Second, we innovate a relation-aware spatiotemporal diffusion convolution network to capture road segments’ differences and relatedness explicitly. Third, we construct a hypergraph in each time frame to capture high-order and manifold correlations between road segments and design an attentive two-stage message-passing mechanism for aggregating infor- mation from non-directly connected nodes. We conduct empirical studies on real-world data which demonstrate the effectiveness of our proposed framework.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.004 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".