Pith. sign in

REVIEW 2 cited by

Graph Neural Network for Traffic Forecasting: A Survey

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 2101.11174 v4 pith:C2L66AUW submitted 2021-01-27 cs.LG cs.AI

classification cs.LGcs.AI
keywords forecastinggraphtrafficnetworksneuralproblemssurveysystems
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Traffic forecasting is important for the success of intelligent transportation systems. Deep learning models, including convolution neural networks and recurrent neural networks, have been extensively applied in traffic forecasting problems to model spatial and temporal dependencies. In recent years, to model the graph structures in transportation systems as well as contextual information, graph neural networks have been introduced and have achieved state-of-the-art performance in a series of traffic forecasting problems. In this survey, we review the rapidly growing body of research using different graph neural networks, e.g. graph convolutional and graph attention networks, in various traffic forecasting problems, e.g. road traffic flow and speed forecasting, passenger flow forecasting in urban rail transit systems, and demand forecasting in ride-hailing platforms. We also present a comprehensive list of open data and source resources for each problem and identify future research directions. To the best of our knowledge, this paper is the first comprehensive survey that explores the application of graph neural networks for traffic forecasting problems. We have also created a public GitHub repository where the latest papers, open data, and source resources will be updated.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Quantifying the Noise of Structural Perturbations on Graph Adversarial Attacks

    cs.LG 2025-04 conditional novelty 5.0 of 10

    A new link-noise metric, computed from node degrees and entropy-based dissimilarity, ranks candidate adversarial edges and prunes the search space for targeted graph attacks, yielding competitive or better attack succ...

  2. Mitigating the Structural Bias in Graph Adversarial Defenses

    cs.LG 2025-04 conditional novelty 5.0 of 10

    De2GNN reduces degree bias in adversarial defenses by removing heterophilic links, adding homophilic links to tail nodes, and fusing a kNN feature view through node-wise attention, improving tail-node accuracy under M...

Pith tools