Dynamic Correlation Adjacency-Matrix-Based Graph Neural Networks for Traffic Flow Prediction.

Junhua Gu, Zhihao Jia, Taotao Cai, Xiangyu Song, Adnan Mahmood
Author Information
  1. Junhua Gu: School of Artificial Intelligence, Hebei University of Technology, Tianjin 300000, China.
  2. Zhihao Jia: School of Artificial Intelligence, Hebei University of Technology, Tianjin 300000, China. ORCID
  3. Taotao Cai: School of Mathematics, Physics and Computing, University of Southern Queensland, Toowoomba 4350, Australia.
  4. Xiangyu Song: School of Software and Electrical Engineering, Swinburne University of Technology, Melbourne 3122, Australia.
  5. Adnan Mahmood: School of Computing, Macquarie University, Sydney 2109, Australia. ORCID

Abstract

Modeling complex spatial and temporal dependencies in multivariate time series data is crucial for traffic forecasting. Graph convolutional networks have proved to be effective in predicting multivariate time series. Although a predefined graph structure can help the model converge to good results quickly, it also limits the further improvement of the model due to its stationary state. In addition, current methods may not converge on some datasets due to the graph structure of these datasets being difficult to learn. Motivated by this, we propose a novel model named Dynamic Correlation Graph Convolutional Network (DCGCN) in this paper. The model can construct adjacency matrices from input data using a correlation coefficient; thus, dynamic correlation graph convolution is used for capturing spatial dependencies. Meanwhile, gated temporal convolution is used for modeling temporal dependencies. Finally, we performed extensive experiments to evaluate the performance of our proposed method against ten existing well-recognized baseline methods using two original and four public datasets.

Keywords

References

  1. Neural Comput. 1997 Nov 15;9(8):1735-80 [PMID: 9377276]

Word Cloud

Created with Highcharts 10.0.0graphmodeltemporaldependenciesmultivariatetimeseriesGraphdatasetsspatialdatatrafficnetworksstructurecanconvergeduemethodsDynamicCorrelationadjacencyusingcorrelationdynamicconvolutionusedModelingcomplexcrucialforecastingconvolutionalprovedeffectivepredictingAlthoughpredefinedhelpgoodresultsquicklyalsolimitsimprovementstationarystateadditioncurrentmaydifficultlearnMotivatedproposenovelnamedConvolutionalNetworkDCGCNpaperconstructmatricesinputcoefficientthuscapturingMeanwhilegatedmodelingFinallyperformedextensiveexperimentsevaluateperformanceproposedmethodtenexistingwell-recognizedbaselinetwooriginalfourpublicAdjacency-Matrix-BasedNeuralNetworksTrafficFlowPredictionmatrixneuralprediction

Similar Articles

Cited By