Improving Temporal Graph Collaborative Filtering with Temporal Local Augmentation

Modeling the temporal evolution of users' preferences is essential for continuous-time sequential recommendation. Recently, temporal graph collaborative filtering (TGCF) applies temporal graph neural networks on user-item temporal graphs to capture the dynamic evolution. Despite the remarkable success, existing TGCF methods still suffer from long-tail issues, which can be described in two parts: (1) the long-tailed distribution of the node degrees in user-item temporal graphs; (2) the uncertainties when modeling the evolution on user-item temporal graphs. However, few temporal graph-based recommenders have studied how to alleviate the long-tail issues. In this paper, to tackle long-tail challenges, we introduce a novel approach: Temporal Local Augmentation (TLA) for temporal graph collaborative filtering. This method addresses the distribution and evolution of topology and features separately. Initially, we propose a pretraining phase to capture one-order node feature distributions using a generative model. Subsequently, we decouple the pretraining phase from downstream TGCF training and integrate memory with generated augmentation node features to bolster long-tail nodes. Experimental findings on five real-world datasets showcase TLA's effectiveness in mitigating long-tail challenges.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/mlnlp63328.2024.10800522
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving Temporal Graph Collaborative Filtering with Temporal Local Augmentation

Huixuan Chi, Qinfen Hao, Hongwei Liu
Recommender Systems and Techniques
article

Improving Temporal Graph Collaborative Filtering with Temporal Local Augmentation

Huixuan Chi, Qinfen Hao, Hongwei Liu
article en

Abstract

Modeling the temporal evolution of users' preferences is essential for continuous-time sequential recommendation. Recently, temporal graph collaborative filtering (TGCF) applies temporal graph neural networks on user-item temporal graphs to capture the dynamic evolution. Despite the remarkable success, existing TGCF methods still suffer from long-tail issues, which can be described in two parts: (1) the long-tailed distribution of the node degrees in user-item temporal graphs; (2) the uncertainties when modeling the evolution on user-item temporal graphs. However, few temporal graph-based recommenders have studied how to alleviate the long-tail issues. In this paper, to tackle long-tail challenges, we introduce a novel approach: Temporal Local Augmentation (TLA) for temporal graph collaborative filtering. This method addresses the distribution and evolution of topology and features separately. Initially, we propose a pretraining phase to capture one-order node feature distributions using a generative model. Subsequently, we decouple the pretraining phase from downstream TGCF training and integrate memory with generated augmentation node features to bolster long-tail nodes. Experimental findings on five real-world datasets showcase TLA's effectiveness in mitigating long-tail challenges.

Chinese Academy of Sciences (CN), Institute of Computing Technology (CN)
Openalex Percentile: Top 63%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.