Dual-Stage Graph Convolution Network With Graph Learning For Traffic Prediction
Li Zilong (Heilongjiang University); Qianqian Ren (Heilongjiang University); Long Chen (Heilongjiang University); jianguo sun (xidian university)
-
SPS
IEEE Members: $11.00
Non-members: $15.00
Robust and accurate traffic forecasting is a key issue in intelli-
gent transportation systems. Existing studies usually employ
pre-defined spatial graph or learned fixed adjacency graph
and design models to capture spatial and temporal features.
However, pre-defined or fixed graph can not accurately model
the complex hidden structure. Moreover, fews solutions are
satisfied with both long and short-term prediction tasks. In
this paper, we propose a novel dual-stage graph convolution
network based on graph learning (DSGCN) to address these
challenges. To equip the graph convolution network with
a flexible and practical graph structure, DSGCN designs a
graph learning module to model the varying relations among
nodes in the road network. In particular, we first provide a hi-
erarchical graph structure cooperated with the dilated convo-
lution to capture the temporal dependencies. Second, a dual-
stage graph convolution layer is proposed to capture the com-
plex spatial dependencies. Experiments on two real-world
datasets demonstrate that DSGCN outperforms the state-of-
the-art baselines, especially for long-term traffic prediction