mlsanityData to 7 Oct 2026

Semantic-Fused Multi-Granularity Cross-City Traffic Prediction

arXiv 2302.11774 ↗First posted 23 Feb 2023cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Accurate traffic prediction is essential for effective urban management and the improvement of transportation efficiency. Recently, data-driven traffic prediction methods have been widely adopted, with better performance than traditional approaches. However, they often require large amounts of data for effective training, which becomes challenging given the prevalence of data scarcity in regions with inadequate sensing infrastructures. To address this issue, we propose a Semantic-Fused Multi-Granularity Transfer Learning (SFMGTL) model to achieve knowledge transfer across cities with fused semantics at different granularities. In detail, we design a semantic fusion module to fuse various semantics while conserving static spatial dependencies via reconstruction losses. Then, a fused graph is constructed based on node features through graph structure learning. Afterwards, we implement hierarchical node clustering to generate graphs with different granularity. To extract feasible meta-knowledge, we further introduce common and private memories and obtain domain-invariant features via adversarial training. It is worth noting that our work jointly addresses semantic fusion and multi-granularity issues in transfer learning. We conduct extensive experiments on six real-world datasets to verify the effectiveness of our SFMGTL model by comparing it with other state-of-the-art baselines. Afterwards, we also perform ablation and case studies, demonstrating that our model possesses substantially fewer parameters compared to baseline models. Moreover, we illustrate how knowledge transfer aids the model in accurately predicting demands, especially during peak hours. The codes can be found at https://github.com/zeonchen/SFMGTL.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 21 of its 55 references that are in the map. First posted on arXiv 23 Feb 2023.

Builds on

21 of 55 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  4. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
  5. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
  6. 2019A Comprehensive Survey on Transfer Learningcited by 1,154
  7. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
  8. 2019GMAN: A Graph Multi-Attention Network for Traffic Predictioncited by 433
  9. 2018T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Predictioncited by 399
  10. 2018Meta-Learning: A Surveycited by 254
  11. 2018Characterizing and Avoiding Negative Transfercited by 226
  12. 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
9 more
  1. 2017Learning Traffic as Images: A Deep Convolutional Neural Network for Large-Scale Transportation Network Speed Predictioncited by 67
  2. 2019Learning from Multiple Cities: A Meta-Learning Approach for Spatial-Temporal Predictioncited by 64
  3. 2022Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge Transfercited by 43
  4. 2018Bike Flow Prediction with Multi-Graph Convolutional Networkscited by 42
  5. 2022Domain Adversarial Spatial-Temporal Network: A Transferable Framework for Short-term Traffic Forecasting across Citiescited by 38
  6. 2020Automated Relational Meta-learningcited by 25
  7. 2020Tree Structure-Aware Graph Representation Learning via Integrated Hierarchical Aggregation and Relational Metric Learningcited by 11
  8. 2022Continuous-Time and Multi-Level Graph Representation Learning for Origin-Destination Demand Predictioncited by 7
  9. 2022A Cross-City Federated Transfer Learning Framework: A Case Study on Urban Region Profilingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.

4 papers.