PAPER DIGEST
Most Influential KDD 2021 Paper · 2026-03 edition

Spatial-Temporal Graph ODE Networks for Traffic Flow Forecasting

Zheng Fang; Qingqing Long; Guojie Song; Kunqing Xie

Venue
ACM SIGKDD Conference (KDD) 2021
Recognition
Most Influential KDD 2021 Paper (Rank No. 2)
Edition
2026-03
Impact factor
7
Certificate ID
ccc5a470824fa5e8

Abstract

Spatial-temporal forecasting has attracted tremendous attention in a wide range of applications, and traffic flow prediction is a canonical and typical example. The complex and long-range spatial-temporal correlations of traffic flow bring it to a most intractable challenge. Existing works typically utilize shallow graph convolution networks (GNNs) and temporal extracting modules to model spatial and temporal dependencies respectively. However, the representation ability of such models is limited due to: (1) shallow GNNs are incapable to capture long-range spatial correlations, (2) only spatial connections are considered and a mass of semantic connections are ignored, which are of great importance for a comprehensive understanding of traffic networks. To this end, we propose Spatial-Temporal Graph Ordinary Differential Equation Networks (STGODE).1 Specifically, we capture spatial-temporal dynamics through a tensor-based ordinary differential equation (ODE), as a result, deeper networks can be constructed and spatial-temporal features are utilized synchronously. To understand the network more comprehensively, semantical adjacency matrix is considered in our model, and a well-design temporal dialated convolution structure is used to capture long term temporal dependencies. We evaluate our model on multiple real-world traffic datasets and superior performance is achieved over state-of-the-art baselines.

Download PDF certificate