Abstract

Accurate traffic flow prediction is critical for traffic management and route guidance, enabling urban traffic to be free-flowing conditions and maximizing transport efficiency. In current prediction methods, the simple and fixed spatial graph only uses the prior knowledge of the traffic network, resulting in weak prediction performance. This paper proposes an Improved Graph Convolution Res-Recurrent Network (IGCRRN), which relies on uncertain spatio-temporal information for traffic flow prediction. In particular, a spatial dependence matrix that combines the origin graph matrix and the data-generated embedding node matrix is created. In this way, the spatial connection relationship can be obtained from the static graph information and changing traffic flow series, making the improved graph convolution block infer and quantify the different contributions in both spatial dependence and temporal dependence in a data-driven manner. In addition, the residual structure is employed to model the multi-level spatial dependence, and the IGCRRN-cell units based on the residual connection block and LSTM are designed to make the model automatically capture the spatio-temporal dependence in the traffic flow sequence. Experiments are conducted on two real traffic datasets, and the experiment results show that our proposed spatial dependence matrix can investigate the valuable information and consider the heterogeneity in the traffic flow. The IGCRRN model outperforms the baseline and state-of-the-art methods in prediction performance.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.