Traffic Flow Prediction Using Novel Spatial-Temporal Multi-Head Attention Graph Convolution Networks

被引:1
作者
Cheng, Yuan [1 ]
Peng, Cheng [1 ]
Wang, Ze [1 ]
Liu, Baiqi [1 ]
Feng, Jiandong [1 ]
Li, Ao [1 ]
机构
[1] Harbin Univ Sci & Technol, Dept Comp Sci & Technol, Harbin, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
artificial intelligence and advanced computing applications; data analysis; data and data science; deep learning; neural networks; traffic flow;
D O I
10.1177/03611981241283449
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
For urban development, accurate traffic flow prediction is crucial. Traffic flow prediction data can be used for optimizing public transportation systems, reducing congestion, planning road networks, and improving overall city infrastructure management. Despite numerous spatiotemporal methods used to forecast traffic flow, information aggregation at each site neither produce optimal results, because of the use non-Euclidean distance data. For more accurate results of traffic flow prediction, we propose a spatial-temporal multi-head attention graph convolution network (STMAGCN). It extracts temporal features using temporal convolutional layers and enriches nodes with spatial attention and multi-head attention mechanisms. By combining them, we can extract space characteristics more effectively. We also introduce a novel graph structure construction method that employs graph-based transformations to convert non-connected data points into a comprehensive graph structure, facilitating the effective application of our STMAGCN. This approach improves the predictive efficiency and accuracy of our model by ensuring seamless integration of disparate data sources. Experimental results indicate that the preferential extraction of spatiotemporal data significantly enhances traffic flow prediction accuracy. Compared with the latest models, our performance on the California Department of Transportation Performance Measurement System (PeMS) PeMS04 and PeMS08 datasets shows a slight improvement, with an average increase of 16.8%. Additionally, the average improvement in time is approximately 445.95%.
引用
收藏
页码:883 / 898
页数:16
相关论文
共 20 条
[1]   Spatio-Temporal Data Mining: A Survey of Problems and Methods [J].
Atluri, Gowtham ;
Karpatne, Anuj ;
Kumar, Vipin .
ACM COMPUTING SURVEYS, 2018, 51 (04)
[2]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[3]  
Chen CHW, 2001, AIP CONF PROC, V584, P96, DOI 10.1063/1.1405589
[4]  
Cho K., 2014, P 2014 C EMP METH NA, P1724, DOI 10.3115/v1/d14-1179
[5]  
Drucker H, 1997, ADV NEUR IN, V9, P155
[6]  
Guo SN, 2019, AAAI CONF ARTIF INTE, P922
[7]  
Hochreiter S, 1997, NEURAL COMPUT, V9, P1735, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]
[8]  
Kipf T.N., 2017, P INT C LEARN REPR T
[9]  
Kramer O., 2013, Dimensionality Reduction with Unsupervised Nearest Neighbors, P13, DOI 10.1007/978-3-642-38652-72
[10]   Temporal Convolutional Networks for Action Segmentation and Detection [J].
Lea, Colin ;
Flynn, Michael D. ;
Vidal, Rene ;
Reiter, Austin ;
Hager, Gregory D. .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :1003-1012