Optimized Graph Convolution Recurrent Neural Network for Traffic Prediction

被引:244
作者
Guo, Kan [1 ]
Hu, Yongli [1 ]
Qian, Zhen [2 ,3 ]
Liu, Hao [4 ]
Zhang, Ke [5 ]
Sun, Yanfeng [1 ]
Gao, Junbin [6 ]
Yin, Baocai [1 ,7 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Beijing Key Lab Multimedia & Intelligent Software, Beijing 100124, Peoples R China
[2] Carnegie Mellon Univ, Dept Civil & Environm Engn, Pittsburgh, PA 15213 USA
[3] Carnegie Mellon Univ, H John Heinz III Coll, Pittsburgh, PA 15213 USA
[4] Beijing Municipal Commiss Transport, Beijing Transportat Informat Ctr, Beijing 100073, Peoples R China
[5] Beijing Municipal Commiss Transport, Beijing Transportat Coordinat Ctr, Beijing 100073, Peoples R China
[6] Univ Sydney, Business Sch, Discipline Business Analyt, Sydney, NSW 2006, Australia
[7] Dalian Univ Technol, Fac Elect Informat & Elect Engn, Dalian 116024, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Roads; Convolution; Recurrent neural networks; Training; Graph convolution network; recurrent neural network; traffic prediction; TRAVEL-TIME PREDICTION; STATE ESTIMATION; MODEL; MACHINE;
D O I
10.1109/TITS.2019.2963722
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Traffic prediction is a core problem in the intelligent transportation system and has broad applications in the transportation management and planning, and the main challenge of this field is how to efficiently explore the spatial and temporal information of traffic data. Recently, various deep learning methods, such as convolution neural network (CNN), have shown promising performance in traffic prediction. However, it samples traffic data in regular grids as the input of CNN, thus it destroys the spatial structure of the road network. In this paper, we introduce a graph network and propose an optimized graph convolution recurrent neural network for traffic prediction, in which the spatial information of the road network is represented as a graph. Additionally, distinguishing with most current methods using a simple and empirical spatial graph, the proposed method learns an optimized graph through a data-driven way in the training phase, which reveals the latent relationship among the road segments from the traffic data. Lastly, the proposed method is evaluated on three real-world case studies, and the experimental results show that the proposed method outperforms state-of-the-art traffic prediction methods.
引用
收藏
页码:1138 / 1149
页数:12
相关论文
共 54 条
[1]  
AHMED MS, 1979, TRANSPORT RES REC, V722, P1, DOI DOI 10.3141/2024-03
[2]  
[Anonymous], 2017, ARXIV170903082
[3]   Dynamic data-driven local traffic state estimation and prediction [J].
Antoniou, Constantinos ;
Koutsopoulos, Haris N. ;
Yannis, George .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 34 :89-107
[4]  
Ben-Akiva Moshe, 1998, DACCORD SHORT TERM F, P1
[5]   A dynamic traffic assignment model for highly congested urban networks [J].
Ben-Akiva, Moshe E. ;
Gao, Song ;
Wei, Zheng ;
Wen, Yang .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 24 :62-82
[6]  
Bruna Joan, 2014, 2 INT C LEARNING REP
[7]   A spatiotemporal correlative k-nearest neighbor model for short-term traffic multistep forecasting [J].
Cai, Pinlong ;
Wang, Yunpeng ;
Lu, Guangquan ;
Chen, Peng ;
Ding, Chuan ;
Sun, Jianping .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2016, 62 :21-34
[8]  
Chen C, 2001, TRANSPORT RES REC, P96
[9]  
Chen C, 2002, P GLOBECOM TEL C DEC, P991
[10]  
Cho K., 2014, P SSST 8 8 WORKSHOP, P103, DOI DOI 10.3115/V1/W14-4012