Toward Large-Scale Graph-Based Traffic Forecasting: A Data-Driven Network Partitioning Approach

Network partitioning is recognized as an effective auxiliary approach for solving transportation tasks on large-scale traffic networks in a domain-decomposition (DD) manner. Most of the existing related partitioning algorithms are explicitly designed to traffic management problems and merely focus on the implied topology of the networks. In this article, toward the practical problems that happened to traffic forecasting (TF) tasks, we propose a network-partitioning-based DD framework to improve graph convolutional network (GCN)-based predictors' performance on large-scale transportation networks. Particularly, we devise a data-driven network-partitioning approach, namely, speed-matching-partitioning (SMP), which employs not only the topological features but also the traffic speed observations of traffic networks for partitioning. Additionally, we propose a data-parallel training strategy that feeds partitioned subnetworks into independent predictors for parallel training. The proposed approach is tested by comprehensive case studies on three real-world data sets to evaluate its effectiveness. The results indicate that the proposed approach can help improve GCN-based predictors' accuracy and training efficiency on both small and relatively large traffic data sets. Furthermore, we investigate the model sensitivity to the selection of graph representations and framework parameters, and the learning efficiency of the data-parallel training strategy.

Automated summary

This article proposes a network partitioning approach to improve the performance of graph convolutional network-based predictors on large-scale transportation networks. The approach uses both topological features and traffic speed observations for partitioning, and employs a data-parallel training strategy for parallel training. Case studies on real-world datasets show that the proposed approach can improve the accuracy and training efficiency of the predictors.