An Attention Encoder-Decoder Dual Graph Convolutional Network with Time Series Correlation for Multi-Step Traffic Flow Prediction
Bibliographic record
Abstract
Accurate traffic prediction is a powerful factor of intelligent transportation systems to make assisted decisions. However, existing methods are deficient in modeling long series spatio-temporal characteristics. Due to the complex and nonlinear nature of traffic flow time series, traditional methods of prediction tasks tend to ignore the heterogeneity and long series dependencies of spatio-temporal data. In this paper, we propose an attentional encoder-decoder dual graph convolution model with time-series correlation (AED-DGCN-TSC) for solving the spatio-temporal sequence prediction problem in the traffic domain. First, the time-series correlation module calculates the sequence similarity by fast Fourier transform and inverse fast Fourier transform, while obtaining multiple possible lengths as possible solutions for the sequence period length. Then, K possible periods fetches are selected and the corresponding sequences are weighted and aggregated to the target sequence. Then, the gated dual graph convolution recurrent unit uses the graph convolution operation, which combines the ideas of node embedding, and dual graph, as an operation inside the gated recurrent structure to capture the spatio-temporal heterogeneity relationship of long sequences. The gated decomposition recurrent module decomposes the time series into the period and trend terms, which are modelled by convolutional gated recurrent unit (ConvGRU) and then fused with features, respectively, and output after graph convolution. Finally, multi-step prediction of future traffic flow is performed in the form of encoder-decoder. Experimental evaluations are conducted on two real traffic datasets, and the results demonstrate the effectiveness of the proposed model.
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.000 | 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.001 |
| 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".