Pith. sign in

REVIEW 2 cited by

Temporal Graph Benchmark for Machine Learning on Temporal Graphs

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 2307.01026 v2 pith:RUG5DZME submitted 2023-07-03 cs.LG cs.AI

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

We present the Temporal Graph Benchmark (TGB), a collection of challenging and diverse benchmark datasets for realistic, reproducible, and robust evaluation of machine learning models on temporal graphs. TGB datasets are of large scale, spanning years in duration, incorporate both node and edge-level prediction tasks and cover a diverse set of domains including social, trade, transaction, and transportation networks. For both tasks, we design evaluation protocols based on realistic use-cases. We extensively benchmark each dataset and find that the performance of common models can vary drastically across datasets. In addition, on dynamic node property prediction tasks, we show that simple methods often achieve superior performance compared to existing temporal graph models. We believe that these findings open up opportunities for future research on temporal graphs. Finally, TGB provides an automated machine learning pipeline for reproducible and accessible temporal graph research, including data loading, experiment setup and performance evaluation. TGB will be maintained and updated on a regular basis and welcomes community feedback. TGB datasets, data loaders, example codes, evaluation setup, and leaderboards are publicly available at https://tgb.complexdatalab.com/.

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. Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures

    cs.LG 2024-12 accept novelty 6.0 of 10

    Truncated backpropagation through time prevents graph recurrent networks from learning multi-hop temporal dependencies, causing large performance gaps on dynamic graph benchmarks.

  2. Enhancing Persona Classification in Dialogue Systems: A Graph Neural Network Approach

    cs.CL 2024-12 conditional novelty 4.0 of 10

    A graph neural network over semantically similar personas improves multi-label persona classification compared with embedding-only models, mainly when training data is limited.

Pith tools