Multisource Data Fusion With Graph Convolutional Neural Networks for Node‐Level Traffic Flow Prediction
Bibliographic record
Abstract
With the rapid development of transport technology and the increasing complexity of traffic patterns, integrating multiple data sources for traffic flow prediction has become crucial to overcome the defects of a single data source. This paper introduces a multisource data fusion approach with graph convolutional neural networks (GCNs) for node‐level traffic flow prediction. Specifically, it extracts different types of traffic flows from multiple data sources and constructs a unified graph structure by using global traffic nodes to interpolate the traffic flow. In addition, a GCN combined with gated recurrent units (GRUs) is proposed for spatiotemporal modeling of data fusion and traffic flow prediction. The main contributions are: (1) The approach significantly improved prediction accuracy by leveraging multiple data sources compared to a single source. (2) A unified graph structure was created via global traffic nodes to interpolate traffic flow and address data sparsity. (3) The proposed model demonstrates an over 11% improvement in accuracy compared to other baseline models, as measured by the weighted mean absolute percentage error (WMAPE). It also exhibits stability in multitime scale predictions, highlighting the effectiveness of multisource data fusion, data imputation, and node‐level prediction capabilities. The approach provides valuable insights for managing urban traffic data from multiple sources and predicting traffic flow, and it shows stability in multitime scale predictions.
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".