Rethinking spatial-temporal contrastive learning for Urban traffic flow forecasting: multi-level augmentation framework
Abstract Graph neural networks integrating contrastive learning have attracted growing attention in urban traffic flow forecasting. However, most existing graph contrastive learning methods do not perform well in capturing local–global spatial dependencies or designing contrastive learning schemes f...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2024-12-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-024-01754-z |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract Graph neural networks integrating contrastive learning have attracted growing attention in urban traffic flow forecasting. However, most existing graph contrastive learning methods do not perform well in capturing local–global spatial dependencies or designing contrastive learning schemes for both spatial and temporal dimensions. We argue that these methods can not well extract the spatial-temporal features and are easily affected by data noise. In light of these challenges, this paper proposes an innovative Urban Spatial-Temporal Graph Contrastive Learning framework (UrbanGCL) to improve the accuracy of urban traffic flow forecasting. Specifically, UrbanGCL proposes multi-level data augmentation to address data noise and incompleteness, learn both local and global topology features. The augmented traffic feature matrices and adjacency matrices are then fed into a simple yet effective dual-branch network with shared parameters to capture spatial-temporal correlations within traffic sequences. Moreover, we introduce spatial and temporal contrastive learning auxiliary tasks to alleviate the sparsity of supervision signal and extract the most critical spatial-temporal information. Extensive experimental results on four real-world urban datasets demonstrate that UrbanGCL significantly outperforms other state-of-the-art methods, with the maximum improvement reaching nearly 8.80%. |
|---|---|
| ISSN: | 2199-4536 2198-6053 |