TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction

• URL: http://arxiv.org/abs/2510.23577v1
• Date: Thu, 23 Oct 2025 05:14:58 GMT
• Title: TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction
• Authors: Zhongyi Yu, Jianqiu Wu, Zhenghao Wu, Shuhan Zhong, Weifeng Su, Chul-Ho Lee, Weipeng Zhuo,
• Abstract summary: Temporal graph link prediction aims to predict future interactions between nodes in a graph based on their historical interactions.<n>We propose a novel framework called TAMI, which contains two effective components, namely log time encoding function and link history aggregation.
• Score: 3.8264010687414953
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Temporal graph link prediction aims to predict future interactions between nodes in a graph based on their historical interactions, which are encoded in node embeddings. We observe that heterogeneity naturally appears in temporal interactions, e.g., a few node pairs can make most interaction events, and interaction events happen at varying intervals. This leads to the problems of ineffective temporal information encoding and forgetting of past interactions for a pair of nodes that interact intermittently for their link prediction. Existing methods, however, do not consider such heterogeneity in their learning process, and thus their learned temporal node embeddings are less effective, especially when predicting the links for infrequently interacting node pairs. To cope with the heterogeneity, we propose a novel framework called TAMI, which contains two effective components, namely log time encoding function (LTE) and link history aggregation (LHA). LTE better encodes the temporal information through transforming interaction intervals into more balanced ones, and LHA prevents the historical interactions for each target node pair from being forgotten. State-of-the-art temporal graph neural networks can be seamlessly and readily integrated into TAMI to improve their effectiveness. Experiment results on 13 classic datasets and three newest temporal graph benchmark (TGB) datasets show that TAMI consistently improves the link prediction performance of the underlying models in both transductive and inductive settings. Our code is available at https://github.com/Alleinx/TAMI_temporal_graph.

Related papers

• Kernelized Edge Attention: Addressing Semantic Attention Blurring in Temporal Graph Neural Networks [7.383288419236205]
  This paper introduces KEAT, a novel attention formulation that modulates edge features using a family of continuous-time kernels.<n>It achieves up to 18% MRR improvement over the recent DyGFormer and 7% over TGN on link prediction tasks.
  arXiv  Detail & Related papers  (2026-01-31T08:22:35Z)
• Unified Spatial-Temporal Edge-Enhanced Graph Networks for Pedestrian Trajectory Prediction [25.529613790994876]
  UniEdge aims to forecast future movements based on historical paths.<n>We introduce a unified ST graph data structure that simplifies high-order cross-time interactions into first-order relationships.<n>Traditional GNNs focus on aggregating pedestrian node features, neglecting the propagation of implicit interaction patterns encoded in edge features.<n>We propose the Edge-to-Edge-Node-to-Node Graph Convolution (E2E-N2N-GCN), a novel dual-graph network that jointly models explicit N2N social interactions among pedestrians.
  arXiv  Detail & Related papers  (2025-02-04T17:18:54Z)
• 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)
• Multi-Task Edge Prediction in Temporally-Dynamic Video Graphs [16.121140184388786]
  We propose MTD-GNN, a graph network for predicting temporally-dynamic edges for multiple types of relations. We show that modeling multiple relations in our temporal-dynamic graph network can be mutually beneficial.
  arXiv  Detail & Related papers  (2022-12-06T10:41:00Z)
• Hyper-relationship Learning Network for Scene Graph Generation [95.6796681398668]
  We propose a hyper-relationship learning network, termed HLN, for scene graph generation. We evaluate HLN on the most popular SGG dataset, i.e., the Visual Genome dataset. For example, the proposed HLN improves the recall per relationship from 11.3% to 13.1%, and maintains the recall per image from 19.8% to 34.9%.
  arXiv  Detail & Related papers  (2022-02-15T09:26:16Z)
• 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)
• Multi-Relation Aware Temporal Interaction Network Embedding [6.964492092209715]
  Temporal interaction network embedding can effectively mine the information in temporal interaction networks. Existing temporal interaction network embedding methods only use historical interaction relations to mine neighbor nodes. We propose a multi-relation aware temporal interaction network embedding method (MRATE)
  arXiv  Detail & Related papers  (2021-10-09T08:28:22Z)
• ConTIG: Continuous Representation Learning on Temporal Interaction Graphs [32.25218861788686]
  ConTIG is a continuous representation method that captures the continuous dynamic evolution of node embedding trajectories. Our model exploit three-fold factors in dynamic networks which include latest interaction, neighbor features and inherent characteristics. Experiments results demonstrate the superiority of ConTIG on temporal link prediction, temporal node recommendation and dynamic node classification tasks.
  arXiv  Detail & Related papers  (2021-09-27T12:11:24Z)
• Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity [52.67037774136973]
  Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. We propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool)
  arXiv  Detail & Related papers  (2021-07-21T03:34:09Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)
• SkipGNN: Predicting Molecular Interactions with Skip-Graph Networks [70.64925872964416]
  We present SkipGNN, a graph neural network approach for the prediction of molecular interactions. SkipGNN predicts molecular interactions by not only aggregating information from direct interactions but also from second-order interactions. We show that SkipGNN achieves superior and robust performance, outperforming existing methods by up to 28.8% of area.
  arXiv  Detail & Related papers  (2020-04-30T16:55:58Z)

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.