TY - JOUR
T1 - A decomposition dynamic graph convolutional recurrent network for traffic forecasting
AU - Weng, Wenchao
AU - Fan, Jin
AU - Wu, Huifeng
AU - Hu, Yujie
AU - Tian, Hao
AU - Zhu, Fu
AU - Wu, Jia
PY - 2023/10
Y1 - 2023/10
N2 - Our daily lives are greatly impacted by traffic conditions, making it essential to have accurate predictions of traffic flow within a road network. Traffic signals used for forecasting are usually generated by sensors along roads, which can be represented as nodes on a graph. These sensors typically produce normal signals representing normal traffic flows and abnormal signals indicating unknown traffic disruptions. Graph convolution networks are widely used for traffic prediction due to their ability to capture correlations between network nodes. However, existing approaches use a predefined or adaptive adjacency matrix that does not accurately reflect real-world relationships between signals. To address this issue, we propose a decomposition dynamic graph convolutional recurrent network (DDGCRN) for traffic forecasting. DDGCRN combines a dynamic graph convolution recurrent network with an RNN-based model that generates dynamic graphs based on time-varying traffic signals, allowing for the extraction of both spatial and temporal features. Additionally, DDGCRN separates abnormal signals from normal traffic signals and models them using a data-driven approach to further improve predictions. Results from our analysis of six real-world datasets demonstrate the superiority of DDGCRN compared to the current state-of-the-art. The source codes are available at: https://github.com/wengwenchao123/DDGCRN.
AB - Our daily lives are greatly impacted by traffic conditions, making it essential to have accurate predictions of traffic flow within a road network. Traffic signals used for forecasting are usually generated by sensors along roads, which can be represented as nodes on a graph. These sensors typically produce normal signals representing normal traffic flows and abnormal signals indicating unknown traffic disruptions. Graph convolution networks are widely used for traffic prediction due to their ability to capture correlations between network nodes. However, existing approaches use a predefined or adaptive adjacency matrix that does not accurately reflect real-world relationships between signals. To address this issue, we propose a decomposition dynamic graph convolutional recurrent network (DDGCRN) for traffic forecasting. DDGCRN combines a dynamic graph convolution recurrent network with an RNN-based model that generates dynamic graphs based on time-varying traffic signals, allowing for the extraction of both spatial and temporal features. Additionally, DDGCRN separates abnormal signals from normal traffic signals and models them using a data-driven approach to further improve predictions. Results from our analysis of six real-world datasets demonstrate the superiority of DDGCRN compared to the current state-of-the-art. The source codes are available at: https://github.com/wengwenchao123/DDGCRN.
KW - Traffic forecasting
KW - Dynamic graph generation
KW - Residual decomposition
KW - Segmented learning
KW - Graph convolution network
UR - http://www.scopus.com/inward/record.url?scp=85159053072&partnerID=8YFLogxK
U2 - 10.1016/j.patcog.2023.109670
DO - 10.1016/j.patcog.2023.109670
M3 - Article
AN - SCOPUS:85159053072
SN - 0031-3203
VL - 142
SP - 1
EP - 11
JO - Pattern Recognition
JF - Pattern Recognition
M1 - 109670
ER -