Graph convolutional networks with learnable spatial weightings for traffic forecasting applications
Bibliographic record
Abstract
How to select a suitable spatial weighting scheme for convolutional graph neural networks (ConvGNNs) is challenging. In this study, we propose a ConvGNN, termed learnable graph convolutional (LGC) network, which learns spatial weightings between a road and its k-hop neighbours as learnable parameters in the spatial convolutional operator. A dynamic LGC (DLGC) network is further proposed to learn the dynamics of spatial weightings by explicitly considering the temporal correlations of spatial weightings at different times of the day. A multi-temporal DLGC (MTDLGC) network is developed for forecasting traffic variables in road networks. Results of case study suggest that the MT-DLGC network can achieve higher prediction accuracy than other state-of-the-art baselines. Both LGC and DLGC networks can be used as general spatial weighting schemes for baselines with better forecasting performance than existing spatial weighting schemes, e.g., graph attention. The source code of this study is available publicly at https://github.com/Mayaohong/MTDLGC.
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.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".