Temporal-aware structure-semantic-coupled graph network for traffic forecasting

The spatial–temporal graph neural networks have been a critical approach to capturing the complicated spatial–temporal dependencies inherent in traffic series for more accurate forecasting. However, the issue of graph indistinguishability demands further attention, as graphs learned by existing meth...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information fusion 2024-07, Vol.107, p.102339, Article 102339
Hauptverfasser: Chen, Mao, Han, Liangzhe, Xu, Yi, Zhu, Tongyu, Wang, Jibin, Sun, Leilei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The spatial–temporal graph neural networks have been a critical approach to capturing the complicated spatial–temporal dependencies inherent in traffic series for more accurate forecasting. However, the issue of graph indistinguishability demands further attention, as graphs learned by existing methods tend to converge to implicit and indistinguishable representations, deviating from the genuine distribution. This issue can be attributed to the lack of three primary factors within graphs: the intrinsic graph features, the temporal-distinct features, and the node-distinct features. Aiming to address this problem, we propose a Temporal-Aware Structure-Semantic-Coupled Graph Network (TASSGN) in this paper. Firstly, we design a novel graph learning block to simultaneously learn the structural and semantic aspects of graphs, thereby capturing inherent graph features. Secondly, we propose an innovative Self-Sampling method to sample the relevant history series and present a Temporal-Aware Graphs Encoder to explicitly incorporate temporal information into graph learning and capture temporal-distinct features. Thirdly, sparse graphs are intentionally generated to capture node-distinct features. By combining these three key components together, our method is capable of overcoming the problem of graph indistinguishability and achieving state-of-the-art performances in traffic forecasting. •Graph indistinguishability prevents accurate traffic forecasting.•The Self-Sampling method effectively captures various temporal dependencies.•Structural and semantic learning helps to extract inherent graph features.•Sparse graph construction enhances interpretable and explicit graph learning.•Discriminative graph learning outperforms previous methods in forecasting.
ISSN:1566-2535
1872-6305
DOI:10.1016/j.inffus.2024.102339