Pith. sign in

REVIEW 2 cited by

Make Graph Neural Networks Great Again: A Generic Integration Paradigm of Topology-Free Patterns for Traffic Speed 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 2406.16992 v1 pith:N5P3746K submitted 2024-06-24 cs.LG cs.AI

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

Urban traffic speed prediction aims to estimate the future traffic speed for improving urban transportation services. Enormous efforts have been made to exploit Graph Neural Networks (GNNs) for modeling spatial correlations and temporal dependencies of traffic speed evolving patterns, regularized by graph topology.While achieving promising results, current traffic speed prediction methods still suffer from ignoring topology-free patterns, which cannot be captured by GNNs. To tackle this challenge, we propose a generic model for enabling the current GNN-based methods to preserve topology-free patterns. Specifically, we first develop a Dual Cross-Scale Transformer (DCST) architecture, including a Spatial Transformer and a Temporal Transformer, to preserve the cross-scale topology-free patterns and associated dynamics, respectively. Then, to further integrate both topology-regularized/-free patterns, we propose a distillation-style learning framework, in which the existing GNN-based methods are considered as the teacher model, and the proposed DCST architecture is considered as the student model. The teacher model would inject the learned topology-regularized patterns into the student model for integrating topology-free patterns. The extensive experimental results demonstrated the effectiveness of our methods.

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. Disentangled Multi-span Evolutionary Network against Temporal Knowledge Graph Reasoning

    cs.AI 2025-05 conditional novelty 5.0 of 10

    DiMNet combines multi-span cross-time message passing with disentangled active/stable node factors to set new state-of-the-art MRR on four TKG extrapolation benchmarks.

  2. Soft Graph Clustering for single-cell RNA Sequencing Data

    cs.LG 2025-07 conditional novelty 4.0 of 10

    A soft graph clustering framework combining ZINB autoencoding, joint normalized-cut embeddings, and optimal transport outperforms prior methods on ten scRNA-seq benchmarks.

Pith tools