Skip to content
Conference Open access

From Compression to Construction: Pseudo Neighbor Augmentation Sampling for Dynamic Link Prediction

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · pp. 5254-5262 · 0 citations · 43 references

TL;DR

A novel context construction based approach named PeNS is proposed that adopts Pseudo Neighbor Augmentation Sampling Strategy for more accurate dynamic link prediction and tries to augment neighbor sequences with three complementary types of pseudo neighbors, injecting structural and temporal cues to provide rich context information especially in sparse neighbor scenarios.

Abstract

Dynamic link prediction aims to predict whether two nodes will interact at a future time point in a dynamic graph based on their historical interactions. Existing sampling based methods, which can be considered as a compressor, generally select a subset of one-hop neighbors from the entire interaction sequence for efficiency. It inevitably makes them lose rich context such as high order structural information and temporal patterns, and often underperform on nodes with sparse historical interaction with other nodes. To this aim, we propose a novel context construction based approach named PeNS that adopts Pseudo Neighbor Augmentation Sampling Strategy for more accurate dynamic link prediction. Specifically, PeNS tries to augment neighbor sequences with three complementary types of pseudo neighbors, injecting structural and temporal cues to provide rich context information especially in sparse neighbor scenarios. We further introduce a Streaming Neighbor Memory Module for efficient pseudo neighbor construction and a dual-stream fusion mechanism for robust representation learning. Extensive experiments demonstrate the effectiveness and generalizability of PeNS.

Read PDF

Similar papers

Book Open access Sep 2026

Information-Aware Long Sequence Compression for Sequential Recommendation

Sequential recommendation (SR) aims to predict a user’s next interaction by modeling temporal dependencies in historical behavior sequences. However, modeling long sequences introduces two challenges: longer histories often include noisy interactions irrelevant to a user’s core interests, and increasing sequence length...

Woo-Seung Kang, Minje Kim, Suwon Lee et al. · 0 citations
Conference Open access Sep 2026

History Doesn’t Repeat, but Its Patterns Echo: A Parallel Pairwise Negative-Sampling Framework for Temporal Link Prediction

This paper proposes ATNSF, a temporal graph learning framework with a hybrid negative sampling strategy that uses a portion of historical edges as hard negatives and introduces a pairwise sampled softmax loss that contrasts each positive instance with a batch of negatives to learn more discriminative representations.

Yong-Chun Jiang, Heng Zhang, Jian Gao et al. · 0 citations
#graph neural networks Open access Sep 2026

PSEALP: patch-based structural external attention with node memory for dynamic link prediction

Dynamic link prediction on temporal graphs is fundamental to many applications such as recommendation, knowledge base completion, and user–item interaction modeling. Most existing dynamic graph neural networks (DGNNs), including memory-based and attention-based models, operate on node-level embeddings and local tempora...

Da-Wei Liu · 0 citations
Book Open access Sep 2026

DP-Rec: Towards Dynamic Patching for Efficient Long-Sequence Recommendation

Transformers have redefined sequential recommendation by effectively modeling dynamic user behaviors and long-range dependencies. However, they remain inherently inefficient: standard architectures operate at a fixed rate, allocating comparable computation to every item in a user’s history regardless of its information...

Dwipam Katariya, T. Caputo, Akshat Shreemali et al. · 0 citations
#machine learning Preprint Sep 2026

CacheDyG: Decoupling Temporal Propagation for Efficient Dynamic Graph Learning

Experiments on five dynamic graph benchmarks show that CacheDyG adopts substantially fewer trainable parameters and lower runtime to obtain more competitive predictive performance than baselines, demonstrating that cache-based decoupling provides an effective principle for scalable dynamic graph learning.

Pin-Heng Zong, Ye Yuan · 0 citations
Sep 2026

Dynamic graph representation learning based on multi-scale attention.

A Multi-scale Attention-based Dynamic Graph Network (MADGN) integrating structure-aware modeling and hierarchical attention is proposed, which outperforms state-of-the-art baselines on dynamic link prediction, dynamic new link prediction, and node classification tasks.

Ping-Tao Duan, Yan-Qun Wu, Jia-Yi Wei et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.