GraphSAGE-Based Dynamic Spatial–Temporal Graph Convolutional Network for Traffic Prediction
Bibliographic record
Abstract
Traffic networks exhibit complex spatial-temporal dependencies, and accurately capturing such dependencies is critical to improving prediction accuracy. Recently, many deep learning models have been proposed for spatial-temporal dependency modeling. While numerous deep learning models have been developed for spatial-temporal dependency modeling, most rely on different types of convolutions to extract spatial and temporal correlations separately. To address this limitation, we propose a novel deep learning framework for traffic prediction called GraphSAGE-based Dynamic Spatial-Temporal Graph Convolutional Network (DST-GraphSAGE), which can capture dynamic spatial and temporal dependencies simultaneously. Our model utilizes a spatial-temporal GraphSAGE module to extract localized spatial-temporal correlations from past observations of a node’s spatial neighbors. Meanwhile, the attention mechanism is incorporated to dynamically learn weights between traffic nodes based on graph features. Additionally, to capture long-term trends in traffic data, we employ dilated causal convolution as the temporal convolution layer. A series of numerical experiments are conducted on five real-world datasets, which demonstrates the effectiveness of our model for spatial-temporal dependency modeling.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".