Virtual Nodes Improve Long-term Traffic Prediction
Xiaoyang Cao, Dingyi Zhuang, Jinhua Zhao, Shenhao Wang

TL;DR
This paper introduces a novel graph neural network framework with virtual nodes that significantly improves long-term traffic prediction accuracy by enhancing information flow and interpretability in urban traffic systems.
Contribution
The study proposes a semi-adaptive adjacency matrix with virtual nodes to address over-squashing and improve long-term traffic forecasting in spatio-temporal graph neural networks.
Findings
Virtual nodes improve long-term prediction accuracy.
Enhanced layer-wise sensitivity reduces over-squashing.
Visualization shows focus on key traffic areas.
Abstract
Effective traffic prediction is a cornerstone of intelligent transportation systems, enabling precise forecasts of traffic flow, speed, and congestion. While traditional spatio-temporal graph neural networks (ST-GNNs) have achieved notable success in short-term traffic forecasting, their performance in long-term predictions remains limited. This challenge arises from over-squashing problem, where bottlenecks and limited receptive fields restrict information flow and hinder the modeling of global dependencies. To address these challenges, this study introduces a novel framework that incorporates virtual nodes, which are additional nodes added to the graph and connected to existing nodes, in order to aggregate information across the entire graph within a single GNN layer. Our proposed model incorporates virtual nodes by constructing a semi-adaptive adjacency matrix. This matrix integrates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTraffic Prediction and Management Techniques · Neural Networks and Applications
