TY - JOUR
T1 - Dynamic Graph Convolution and Spatio-Temporal Self-Attention Network for Traffic Flow Prediction
AU - Liu, Zemu
AU - Qin, Zhida
AU - Huang, Tianyu
AU - Ding, Gangyi
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2025
Y1 - 2025
N2 - As a typical spatio-temporal series prediction task, traffic flow prediction has found wide application in Intelligent Transportation Systems (ITS). Despite some progress, several unresolved issues persist. Many existing works calculate the dependencies between nodes based on stable long-term traffic data. However, the short-term dependencies are dynamically changing over time, and neglecting them would cause a decrease in predictive performance. In this paper, we propose a novel Dynamic Graph Convolution and Spatio-Temporal Self-Attention (DGSTA) network for traffic flow prediction. Specifically, considering the large amount of short-term and the dynamic dependencies between nodes, we design a new dynamic graph convolution module, which generates adjacency matrices for each time step in a day to dynamically capture the changing short-term dependencies. Additionally, we utilize a multi-head spatio-temporal self-attention module to respectively extract static spatial and temporal correlations between nodes. Furthermore, we design a sequential embedding to explicitly model the long-term correlation between nodes. Extensive experiments conducted on three real-world datasets demonstrate that DGSTA exhibits high competitiveness.
AB - As a typical spatio-temporal series prediction task, traffic flow prediction has found wide application in Intelligent Transportation Systems (ITS). Despite some progress, several unresolved issues persist. Many existing works calculate the dependencies between nodes based on stable long-term traffic data. However, the short-term dependencies are dynamically changing over time, and neglecting them would cause a decrease in predictive performance. In this paper, we propose a novel Dynamic Graph Convolution and Spatio-Temporal Self-Attention (DGSTA) network for traffic flow prediction. Specifically, considering the large amount of short-term and the dynamic dependencies between nodes, we design a new dynamic graph convolution module, which generates adjacency matrices for each time step in a day to dynamically capture the changing short-term dependencies. Additionally, we utilize a multi-head spatio-temporal self-attention module to respectively extract static spatial and temporal correlations between nodes. Furthermore, we design a sequential embedding to explicitly model the long-term correlation between nodes. Extensive experiments conducted on three real-world datasets demonstrate that DGSTA exhibits high competitiveness.
KW - graph attention network (GAT)
KW - graph convolution network (GCN)
KW - Traffic flow prediction
UR - http://www.scopus.com/inward/record.url?scp=105003652932&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2025.3562861
DO - 10.1109/JIOT.2025.3562861
M3 - Article
AN - SCOPUS:105003652932
SN - 2327-4662
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
ER -