.png){kind=icon}
.png){kind=icon}
Return
Spatiotemporal interactive learning dynamic adaptive graph convolutional network for traffic forecasting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2025.113115.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Traffic forecasting plays a critical role in tasks such as route planning and traffic management. Recent advancements in graph neural networks have enabled the effective modeling of spatiotemporal correlations, significantly enhancing traffic prediction accuracy. However, most existing research primarily focuses on general spatiotemporal characteristics shared across all nodes, often neglecting the unique attributes of individual nodes. Additionally, these studies tend to overlook the diverse temporal features inherent in the data, limiting their ability to fully capture complex spatiotemporal dependencies. To tackle these challenges, this study introduces the Spatiotemporal Interactive Learning Dynamic Adaptive Graph Convolutional Network (SILDAGCN) for traffic forecasting. Specifically, SILDAGCN incorporates a data embedding module to integrate temporal features into the raw data and extract critical information effectively. Moreover, it employs a dynamic adaptive graph convolutional network designed to capture real-time spatiotemporal dynamics and uncover both shared and node-specific spatiotemporal correlations. This paper also introduces a spatiotemporal feature interaction learning mechanism designed to capture and learn the diverse, evolving characteristics of spatiotemporal dependencies, enabling mutual enhancement through effective feedback. Finally, the output block leverages convolutional operations to enhance the model's information extraction capabilities, producing the final traffic network forecasts. Experimental evaluations on four real-world datasets demonstrate that SILDAGCN achieves accurate traffic flow and demand predictions with relatively low computational cost.
Keywords:
Graph neural network
Traffic flow forecasting
Multi-head attention
Interactive learning mechanism
Dynamic graph
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W