Table of Contents
Fetching ...

Temporal Graph Learning Recurrent Neural Network for Traffic Forecasting

Sanghyun Lee, Chanyoung Park

TL;DR

Traffic forecasting requires modeling nonstationary spatio-temporal dependencies in road networks. The authors introduce Temporal Graph Learning Recurrent Neural Network (TGLRN), which constructs a time-varying graph at each step using RNN-based dynamic node embeddings, supplemented by Adaptive Structure Information to bias connections toward geographically proximal sensors, and an edge-sampling scheme for robustness. The method combines a Diffusion Convolution Spatial Processing Layer with a Temporal Processing Layer (GTU-based) inside a Spatio-Temporal Block, and fuses outputs across blocks for prediction of the next $T$ steps. Experimental results on PeMS datasets show state-of-the-art MAE/RMSE/MAPE, validating the importance of dynamic graphs and structure learning. The work advances traffic forecasting by integrating microscopic (time-evolving edges) and macroscopic (distance-based structure) views for robust, scalable prediction.

Abstract

Accurate traffic flow forecasting is a crucial research topic in transportation management. However, it is a challenging problem due to rapidly changing traffic conditions, high nonlinearity of traffic flow, and complex spatial and temporal correlations of road networks. Most existing studies either try to capture the spatial dependencies between roads using the same semantic graph over different time steps, or assume all sensors on the roads are equally likely to be connected regardless of the distance between them. However, we observe that the spatial dependencies between roads indeed change over time, and two distant roads are not likely to be helpful to each other when predicting the traffic flow, both of which limit the performance of existing studies. In this paper, we propose Temporal Graph Learning Recurrent Neural Network (TGLRN) to address these problems. More precisely, to effectively model the nature of time series, we leverage Recurrent Neural Networks (RNNs) to dynamically construct a graph at each time step, thereby capturing the time-evolving spatial dependencies between roads (i.e., microscopic view). Simultaneously, we provide the Adaptive Structure Information to the model, ensuring that close and consecutive sensors are considered to be more important for predicting the traffic flow (i.e., macroscopic view). Furthermore, to endow TGLRN with robustness, we introduce an edge sampling strategy when constructing the graph at each time step, which eventually leads to further improvements on the model performance. Experimental results on four commonly used real-world benchmark datasets show the effectiveness of TGLRN.

Temporal Graph Learning Recurrent Neural Network for Traffic Forecasting

TL;DR

Traffic forecasting requires modeling nonstationary spatio-temporal dependencies in road networks. The authors introduce Temporal Graph Learning Recurrent Neural Network (TGLRN), which constructs a time-varying graph at each step using RNN-based dynamic node embeddings, supplemented by Adaptive Structure Information to bias connections toward geographically proximal sensors, and an edge-sampling scheme for robustness. The method combines a Diffusion Convolution Spatial Processing Layer with a Temporal Processing Layer (GTU-based) inside a Spatio-Temporal Block, and fuses outputs across blocks for prediction of the next steps. Experimental results on PeMS datasets show state-of-the-art MAE/RMSE/MAPE, validating the importance of dynamic graphs and structure learning. The work advances traffic forecasting by integrating microscopic (time-evolving edges) and macroscopic (distance-based structure) views for robust, scalable prediction.

Abstract

Accurate traffic flow forecasting is a crucial research topic in transportation management. However, it is a challenging problem due to rapidly changing traffic conditions, high nonlinearity of traffic flow, and complex spatial and temporal correlations of road networks. Most existing studies either try to capture the spatial dependencies between roads using the same semantic graph over different time steps, or assume all sensors on the roads are equally likely to be connected regardless of the distance between them. However, we observe that the spatial dependencies between roads indeed change over time, and two distant roads are not likely to be helpful to each other when predicting the traffic flow, both of which limit the performance of existing studies. In this paper, we propose Temporal Graph Learning Recurrent Neural Network (TGLRN) to address these problems. More precisely, to effectively model the nature of time series, we leverage Recurrent Neural Networks (RNNs) to dynamically construct a graph at each time step, thereby capturing the time-evolving spatial dependencies between roads (i.e., microscopic view). Simultaneously, we provide the Adaptive Structure Information to the model, ensuring that close and consecutive sensors are considered to be more important for predicting the traffic flow (i.e., macroscopic view). Furthermore, to endow TGLRN with robustness, we introduce an edge sampling strategy when constructing the graph at each time step, which eventually leads to further improvements on the model performance. Experimental results on four commonly used real-world benchmark datasets show the effectiveness of TGLRN.
Paper Structure (33 sections, 26 equations, 9 figures, 7 tables)

This paper contains 33 sections, 26 equations, 9 figures, 7 tables.

Figures (9)

  • Figure 1: (a) Traffic flow, and (b) sensor locations that exist consecutively. From a macroscopic view, consecutive sensors exhibit similar trends (upward or downward) due to spatial proximity. (c) At the microscopic level, we employ RNNs to model the dynamic spatial dependencies between sensor pairs, constructing different weighted graphs for each time step.
  • Figure 2: (a) Traffic flow, and (b) location of consecutive sensors in two geographically distant areas. The two geographically distant areas exhibit distinct trends. Hence, we construct a graph where road pairs are likely to be connected if the roads are within a certain distance.
  • Figure 3: Overall architecture of TGLRN.
  • Figure 4: Overall architecture of Graph Construction Layer (GCL).
  • Figure 5: Prediction curves of DSTAGNN and TGLRN on PeMS08 dataset.
  • ...and 4 more figures

Theorems & Definitions (3)

  • Definition 1
  • Definition 2
  • Definition 3