APGL4SR: A Generic Framework with Adaptive and Personalized Global
Collaborative Information in Sequential Recommendation
- URL: http://arxiv.org/abs/2311.02816v1
- Date: Mon, 6 Nov 2023 01:33:24 GMT
- Title: APGL4SR: A Generic Framework with Adaptive and Personalized Global
Collaborative Information in Sequential Recommendation
- Authors: Mingjia Yin, Hao Wang, Xiang Xu, Likang Wu, Sirui Zhao, Wei Guo, Yong
Liu, Ruiming Tang, Defu Lian, Enhong Chen
- Abstract summary: We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR)
APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems.
As a generic framework, APGL4SR can outperform other baselines with significant margins.
- Score: 86.29366168836141
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The sequential recommendation system has been widely studied for its
promising effectiveness in capturing dynamic preferences buried in users'
sequential behaviors. Despite the considerable achievements, existing methods
usually focus on intra-sequence modeling while overlooking exploiting global
collaborative information by inter-sequence modeling, resulting in inferior
recommendation performance. Therefore, previous works attempt to tackle this
problem with a global collaborative item graph constructed by pre-defined
rules. However, these methods neglect two crucial properties when capturing
global collaborative information, i.e., adaptiveness and personalization,
yielding sub-optimal user representations. To this end, we propose a
graph-driven framework, named Adaptive and Personalized Graph Learning for
Sequential Recommendation (APGL4SR), that incorporates adaptive and
personalized global collaborative information into sequential recommendation
systems. Specifically, we first learn an adaptive global graph among all items
and capture global collaborative information with it in a self-supervised
fashion, whose computational burden can be further alleviated by the proposed
SVD-based accelerator. Furthermore, based on the graph, we propose to extract
and utilize personalized item correlations in the form of relative positional
encoding, which is a highly compatible manner of personalizing the utilization
of global collaborative information. Finally, the entire framework is optimized
in a multi-task learning paradigm, thus each part of APGL4SR can be mutually
reinforced. As a generic framework, APGL4SR can outperform other baselines with
significant margins. The code is available at
https://github.com/Graph-Team/APGL4SR.
Related papers
- Toward Personalized Federated Node Classification in One-shot Communication [27.325478113745206]
We propose a one-shot personalized Federated Graph Learning method for node classification.
Our method estimates and aggregates class-wise feature distribution statistics to construct a global pseudo-graph on the server.
Our method significantly outperforms state-of-the-art baselines across various settings.
arXiv Detail & Related papers (2024-11-18T05:59:29Z) - Neural Graph Collaborative Filtering Using Variational Inference [19.80976833118502]
We introduce variational embedding collaborative filtering (GVECF) as a novel framework to incorporate representations learned through a variational graph auto-encoder.
Our proposed method achieves up to 13.78% improvement in the recall over the test data.
arXiv Detail & Related papers (2023-11-20T15:01:33Z) - GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster
Sampling for Sequential Recommendation [58.6450834556133]
We propose graph contrastive learning to enhance item representations with complex associations from the global view.
We extend the CapsNet module with the elaborately introduced target-attention mechanism to derive users' dynamic preferences.
Our proposed GUESR could not only achieve significant improvements but also could be regarded as a general enhancement strategy.
arXiv Detail & Related papers (2023-03-01T05:46:36Z) - Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce.
We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation.
In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
arXiv Detail & Related papers (2022-10-22T17:29:34Z) - Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions.
OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences.
We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
arXiv Detail & Related papers (2022-09-12T09:19:22Z) - Self-Supervised Hypergraph Transformer for Recommender Systems [25.07482350586435]
Self-Supervised Hypergraph Transformer (SHT)
Self-Supervised Hypergraph Transformer (SHT)
Cross-view generative self-supervised learning component is proposed for data augmentation over the user-item interaction graph.
arXiv Detail & Related papers (2022-07-28T18:40:30Z) - Enhancing Sequential Recommendation with Graph Contrastive Learning [64.05023449355036]
This paper proposes a novel sequential recommendation framework, namely Graph Contrastive Learning for Sequential Recommendation (GCL4SR)
GCL4SR employs a Weighted Item Transition Graph (WITG), built based on interaction sequences of all users, to provide global context information for each interaction and weaken the noise information in the sequence data.
Experiments on real-world datasets demonstrate that GCL4SR consistently outperforms state-of-the-art sequential recommendation methods.
arXiv Detail & Related papers (2022-05-30T03:53:31Z) - Dynamic Graph Collaborative Filtering [64.87765663208927]
Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data.
Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations.
Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
arXiv Detail & Related papers (2021-01-08T04:16:24Z)
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.