Pith. sign in

REVIEW 1 cited by

NodeTrans: A Graph Transfer Learning Approach for Traffic Prediction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.01301 v1 pith:QRWUPMRF submitted 2022-07-04 cs.LG cs.AI

classification cs.LGcs.AI
keywords traffictransferdatalearningpredictionapproachdomainpatterns
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, deep learning methods have made great progress in traffic prediction, but their performance depends on a large amount of historical data. In reality, we may face the data scarcity issue. In this case, deep learning models fail to obtain satisfactory performance. Transfer learning is a promising approach to solve the data scarcity issue. However, existing transfer learning approaches in traffic prediction are mainly based on regular grid data, which is not suitable for the inherent graph data in the traffic network. Moreover, existing graph-based models can only capture shared traffic patterns in the road network, and how to learn node-specific patterns is also a challenge. In this paper, we propose a novel transfer learning approach to solve the traffic prediction with few data, which can transfer the knowledge learned from a data-rich source domain to a data-scarce target domain. First, a spatial-temporal graph neural network is proposed, which can capture the node-specific spatial-temporal traffic patterns of different road networks. Then, to improve the robustness of transfer, we design a pattern-based transfer strategy, where we leverage a clustering-based mechanism to distill common spatial-temporal patterns in the source domain, and use these knowledge to further improve the prediction performance of the target domain. Experiments on real-world datasets verify the effectiveness of our approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Predict Global Atrial Fibrillation Dynamics from Sparse Measurements

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A graph recurrent network reconstructs whole-atria atrial fibrillation dynamics from 10% catheter coverage, with 2.1x lower error and 11x better phase singularity detection than weak baselines, and shows promise on th...

Pith tools