Self-Supervised Hypergraph Transformer for Recommender Systems
- URL: http://arxiv.org/abs/2207.14338v1
- Date: Thu, 28 Jul 2022 18:40:30 GMT
- Title: Self-Supervised Hypergraph Transformer for Recommender Systems
- Authors: Lianghao Xia and Chao Huang and Chuxu Zhang
- Abstract summary: 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.
- Score: 25.07482350586435
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph Neural Networks (GNNs) have been shown as promising solutions for
collaborative filtering (CF) with the modeling of user-item interaction graphs.
The key idea of existing GNN-based recommender systems is to recursively
perform the message passing along the user-item interaction edge for refining
the encoded embeddings. Despite their effectiveness, however, most of the
current recommendation models rely on sufficient and high-quality training
data, such that the learned representations can well capture accurate user
preference. User behavior data in many practical recommendation scenarios is
often noisy and exhibits skewed distribution, which may result in suboptimal
representation performance in GNN-based models. In this paper, we propose SHT,
a novel Self-Supervised Hypergraph Transformer framework (SHT) which augments
user representations by exploring the global collaborative relationships in an
explicit way. Specifically, we first empower the graph neural CF paradigm to
maintain global collaborative effects among users and items with a hypergraph
transformer network. With the distilled global context, a cross-view generative
self-supervised learning component is proposed for data augmentation over the
user-item interaction graph, so as to enhance the robustness of recommender
systems. Extensive experiments demonstrate that SHT can significantly improve
the performance over various state-of-the-art baselines. Further ablation
studies show the superior representation ability of our SHT recommendation
framework in alleviating the data sparsity and noise issues. The source code
and evaluation datasets are available at: https://github.com/akaxlh/SHT.
Related papers
- Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions.
Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems.
We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
arXiv Detail & Related papers (2024-02-21T17:58:10Z) - Preference and Concurrence Aware Bayesian Graph Neural Networks for
Recommender Systems [5.465420718331109]
Graph-based collaborative filtering methods have prevailing performance for recommender systems.
We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information.
arXiv Detail & Related papers (2023-11-30T11:49:33Z) - APGL4SR: A Generic Framework with Adaptive and Personalized Global
Collaborative Information in Sequential Recommendation [86.29366168836141]
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.
arXiv Detail & Related papers (2023-11-06T01:33:24Z) - Graph Masked Autoencoder for Sequential Recommendation [10.319298705782058]
We propose a Graph Masked AutoEncoder-enhanced sequential Recommender system (MAERec) that adaptively and dynamically distills global item transitional information for self-supervised augmentation.
Our method significantly outperforms state-of-the-art baseline models and can learn more accurate representations against data noise and sparsity.
arXiv Detail & Related papers (2023-05-08T10:57:56Z) - 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) - 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) - Hypergraph Contrastive Collaborative Filtering [44.8586906335262]
We propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF)
HCCF captures local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture.
Our model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems.
arXiv Detail & Related papers (2022-04-26T10:06:04Z) - Graph Trend Networks for Recommendations [34.06649831739749]
The key of recommender systems is to predict how likely users will interact with items based on their historical online behaviors.
To exploit these user-item interactions, there are increasing efforts on considering the user-item interactions as a user-item bipartite graph.
Despite their success, most existing GNN-based recommender systems overlook the existence of interactions caused by unreliable behaviors.
We propose the Graph Trend Networks for recommendations (GTN) with principled designs that can capture the adaptive reliability of the interactions.
arXiv Detail & Related papers (2021-08-12T06:09:18Z) - Adversarial Feature Augmentation and Normalization for Visual
Recognition [109.6834687220478]
Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models.
Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings.
We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
arXiv Detail & Related papers (2021-03-22T20:36:34Z) - Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training.
FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
arXiv Detail & Related papers (2020-10-19T21:51:47Z)
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.