Coupled Layer-wise Graph Convolution for Transportation Demand Prediction
Junchen Ye, Leilei Sun, Bowen Du, Yanjie Fu, Hui Xiong

TL;DR
This paper introduces a novel graph convolutional network with self-learned adjacency matrices and a layer-wise coupling mechanism, improving transportation demand prediction by capturing multi-level spatial and temporal dependencies.
Contribution
It proposes a new GCN architecture with adaptive, self-learned adjacency matrices and a layer-wise coupling mechanism, enhancing demand prediction accuracy.
Findings
Outperforms state-of-the-art models on NYC Citi Bike data.
Effectively captures multi-level spatial dependencies.
Demonstrates robustness across different datasets.
Abstract
Graph Convolutional Network (GCN) has been widely applied in transportation demand prediction due to its excellent ability to capture non-Euclidean spatial dependence among station-level or regional transportation demands. However, in most of the existing research, the graph convolution was implemented on a heuristically generated adjacency matrix, which could neither reflect the real spatial relationships of stations accurately, nor capture the multi-level spatial dependence of demands adaptively. To cope with the above problems, this paper provides a novel graph convolutional network for transportation demand prediction. Firstly, a novel graph convolution architecture is proposed, which has different adjacency matrices in different layers and all the adjacency matrices are self-learned during the training process. Secondly, a layer-wise coupling mechanism is provided, which associates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsTraffic Prediction and Management Techniques · Human Mobility and Location-Based Analysis · Transportation Planning and Optimization
MethodsConvolution
