Recurrent Temporal Revision Graph Networks

• URL: http://arxiv.org/abs/2309.12694v2
• Date: Tue, 26 Sep 2023 02:46:00 GMT
• Title: Recurrent Temporal Revision Graph Networks
• Abstract summary: Neighbor aggregation, a critical building block of graph networks, is currently straightforwardly extended from that of static graphs. We propose a novel framework for temporal neighbor aggregation that uses the recurrent neural network with node-wise hidden states. We demonstrate the superior theoretical expressiveness of the proposed framework as well as its state-of-the-art performance in real-world applications.
• Score: 17.400798915108957
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Temporal graphs offer more accurate modeling of many real-world scenarios than static graphs. However, neighbor aggregation, a critical building block of graph networks, for temporal graphs, is currently straightforwardly extended from that of static graphs. It can be computationally expensive when involving all historical neighbors during such aggregation. In practice, typically only a subset of the most recent neighbors are involved. However, such subsampling leads to incomplete and biased neighbor information. To address this limitation, we propose a novel framework for temporal neighbor aggregation that uses the recurrent neural network with node-wise hidden states to integrate information from all historical neighbors for each node to acquire the complete neighbor information. We demonstrate the superior theoretical expressiveness of the proposed framework as well as its state-of-the-art performance in real-world applications. Notably, it achieves a significant +9.6% improvement on averaged precision in a real-world Ecommerce dataset over existing methods on 2-layer models.

Related papers

• Unlearning on Spatio-Temporal Graphs through Subgraph Virtual Edge Reconstruction [16.96032812958633]
  CallosumNet is a graph unlearning framework biologically inspired by corpus structure.<n>It reconstructs subgraphs using biologically-inspired edges; and it restores virtual-temporal subgraphs.<n>It achieves accuracy very close to the gold model.
  arXiv  Detail & Related papers  (2026-08-29T17:01:44Z)
• Spatio-Temporal Graph Unlearning [11.249016471516398]
  CallosumNet is a divide-and-Bridging S-temporal graph unlearning framework inspired by the corpus callosum structure.<n>CallosumNet achieves complete unlearning with only 1%-2% relative MAE loss compared to the gold model.
  arXiv  Detail & Related papers  (2025-11-12T15:17:16Z)
• 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)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment [53.72873672076391]
  Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information. We propose a self-supervised method called S2T for temporal graph learning, which extracts both temporal and structural information. S2T achieves at most 10.13% performance improvement compared with the state-of-the-art competitors on several datasets.
  arXiv  Detail & Related papers  (2023-02-15T06:36:04Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Efficient-Dyn: Dynamic Graph Representation Learning via Event-based Temporal Sparse Attention Network [2.0047096160313456]
  Dynamic graph neural networks have received more and more attention from researchers. We propose a novel dynamic graph neural network, Efficient-Dyn. It adaptively encodes temporal information into a sequence of patches with an equal amount of temporal-topological structure.
  arXiv  Detail & Related papers  (2022-01-04T23:52:24Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• Graph Deep Factors for Forecasting [30.424335452817118]
  We propose a deep hybrid probabilistic graph-based forecasting framework called Graph Deep Factors (GraphDF) GraphDF is a hybrid forecasting framework that consists of a relational global and relational local model. Our case study reveals that GraphDF can successfully generate cloud usage forecasts and opportunistically schedule workloads to increase cloud cluster utilization by 47.5% on average.
  arXiv  Detail & Related papers  (2020-10-14T19:25:26Z)
• From Static to Dynamic Node Embeddings [61.58641072424504]
  We introduce a general framework for leveraging graph stream data for temporal prediction-based applications. Our proposed framework includes novel methods for learning an appropriate graph time-series representation. We find that the top-3 temporal models are always those that leverage the new $epsilon$-graph time-series representation.
  arXiv  Detail & Related papers  (2020-09-21T16:48:29Z)

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.