Dynamic Graph Convolution and Spatiotemporal Self-Attention Network for Traffic Flow Prediction

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. The code and data are available at https://github.com/lzmmm30/DGSTA.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-04-24
DOI
https://doi.org/10.1109/jiot.2025.3562861
Citations
1
Primary Topic
Traffic Prediction and Management Techniques
Type
article
Field-Weighted Citation Impact
1.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Graph Convolution and Spatiotemporal Self-Attention Network for Traffic Flow Prediction

Tianyu Huang, Zhida Qin, Zhe Liu, Gangyi Ding
1 citations
IEEE Internet of Things Journal
Traffic Prediction and Management Techniques
1.01
article

Dynamic Graph Convolution and Spatiotemporal Self-Attention Network for Traffic Flow Prediction

Tianyu Huang, Zhida Qin, Zhe Liu, Gangyi Ding
article en
1 citations

Abstract

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. The code and data are available at https://github.com/lzmmm30/DGSTA.

IEEE Internet of Things JournalVol. 12(14)
Beijing Institute of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 26%
Traffic Prediction and Management Techniques
1.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.