Temporal Graph Benchmark for Machine Learning on Temporal Graphs

• URL: http://arxiv.org/abs/2307.01026v2
• Date: Wed, 27 Sep 2023 22:04:41 GMT
• Title: Temporal Graph Benchmark for Machine Learning on Temporal Graphs
• Authors: Shenyang Huang, Farimah Poursafaei, Jacob Danovitch, Matthias Fey, Weihua Hu, Emanuele Rossi, Jure Leskovec, Michael Bronstein, Guillaume Rabusseau, Reihaneh Rabbany
• Abstract summary: Temporal Graph Benchmark (TGB) is a collection of challenging and diverse benchmark datasets. We benchmark each dataset and find that the performance of common models can vary drastically across datasets. TGB provides an automated machine learning pipeline for reproducible and accessible temporal graph research.
• Score: 54.52243310226456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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/.

Related papers

• TempoKGAT: A Novel Graph Attention Network Approach for Temporal Graph Analysis [3.5707423185282656]
  This paper presents a new type of graph attention network, called TempoKGAT, which combines time-decaying weight and a selective neighbor aggregation mechanism on the spatial domain. We evaluate our approach on multiple datasets from the traffic, energy, and health sectors involvingtemporal data.
  arXiv  Detail & Related papers  (2024-08-29T09:54:46Z)
• TGB 2.0: A Benchmark for Learning on Temporal Knowledge Graphs and Heterogeneous Graphs [18.157266458255098]
  We introduce Temporal Graph Benchmark 2.0 (TGB 2.0), a novel benchmarking framework tailored for evaluating methods for predicting future links on temporal graphs. TGB 2.0 facilitates comprehensive evaluations by presenting eight novel datasets spanning five domains with up to 53 million edges. We observe that 1) leveraging edge-type information is crucial to obtain high performance, 2) simple baselines are often competitive with more complex methods, and 3) most methods fail to run on our largest datasets.
  arXiv  Detail & Related papers  (2024-06-14T00:08:04Z)
• Temporal Graph Analysis with TGX [7.843459542448753]
  TGX is a Python package specially designed for analysis of temporal networks. It encompasses an automated pipeline for data loading, data processing, and analysis of evolving graphs. The package is a robust tool for examining the features of temporal graphs and can be used in various areas like studying social networks, citation networks, and tracking user interactions.
  arXiv  Detail & Related papers  (2024-02-06T02:56:07Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• An Empirical Evaluation of Temporal Graph Benchmark [1.4211059618531252]
  We conduct an empirical evaluation of Temporal Graph Benchmark (TGB) by extending our Dynamic Graph Library (DyGLib) to TGB. We find that (1) different models depict varying performance across various datasets, which is in line with previous observations; (2) the performance of some baselines can be significantly improved over the reported results in TGB when using DyGLib.
  arXiv  Detail & Related papers  (2023-07-24T03:52:11Z)
• Time-aware Hyperbolic Graph Attention Network for Session-based Recommendation [58.748215444851226]
  Session-based Recommendation (SBR) is to predict users' next interested items based on their previous browsing sessions. We propose Time-aware Hyperbolic Graph Attention Network (TA-HGAT) to build a session-based recommendation model considering temporal information.
  arXiv  Detail & Related papers  (2023-01-10T04:16:09Z)
• Networked Time Series Prediction with Incomplete Data [59.45358694862176]
  We propose NETS-ImpGAN, a novel deep learning framework that can be trained on incomplete data with missing values in both history and future. We conduct extensive experiments on three real-world datasets under different missing patterns and missing rates.
  arXiv  Detail & Related papers  (2021-10-05T18:20:42Z)
• Graph Contrastive Learning Automated [94.41860307845812]
  Graph contrastive learning (GraphCL) has emerged with promising representation learning performance. The effectiveness of GraphCL hinges on ad-hoc data augmentations, which have to be manually picked per dataset. This paper proposes a unified bi-level optimization framework to automatically, adaptively and dynamically select data augmentations when performing GraphCL on specific graph data.
  arXiv  Detail & Related papers  (2021-06-10T16:35:27Z)
• Open Graph Benchmark: Datasets for Machine Learning on Graphs [86.96887552203479]
  We present the Open Graph Benchmark (OGB) to facilitate scalable, robust, and reproducible graph machine learning (ML) research. OGB datasets are large-scale, encompass multiple important graph ML tasks, and cover a diverse range of domains. For each dataset, we provide a unified evaluation protocol using meaningful application-specific data splits and evaluation metrics.
  arXiv  Detail & Related papers  (2020-05-02T03:09:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.