Topology-aware Debiased Self-supervised Graph Learning for
Recommendation
- URL: http://arxiv.org/abs/2310.15858v1
- Date: Tue, 24 Oct 2023 14:16:19 GMT
- Title: Topology-aware Debiased Self-supervised Graph Learning for
Recommendation
- Authors: Lei Han and Hui Yan and Zhicheng Qiao
- Abstract summary: We propose Topology-aware De Self-supervised Graph Learning ( TDSGL) for recommendation.
TDSGL constructs contrastive pairs according to the semantic similarity between users (items)
Our results show that the proposed model outperforms the state-of-the-art models significantly on three public datasets.
- Score: 6.893289671937124
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In recommendation, graph-based Collaborative Filtering (CF) methods mitigate
the data sparsity by introducing Graph Contrastive Learning (GCL). However, the
random negative sampling strategy in these GCL-based CF models neglects the
semantic structure of users (items), which not only introduces false negatives
(negatives that are similar to anchor user (item)) but also ignores the
potential positive samples. To tackle the above issues, we propose
Topology-aware Debiased Self-supervised Graph Learning (TDSGL) for
recommendation, which constructs contrastive pairs according to the semantic
similarity between users (items). Specifically, since the original user-item
interaction data commendably reflects the purchasing intent of users and
certain characteristics of items, we calculate the semantic similarity between
users (items) on interaction data. Then, given a user (item), we construct its
negative pairs by selecting users (items) which embed different semantic
structures to ensure the semantic difference between the given user (item) and
its negatives. Moreover, for a user (item), we design a feature extraction
module that converts other semantically similar users (items) into an auxiliary
positive sample to acquire a more informative representation. Experimental
results show that the proposed model outperforms the state-of-the-art models
significantly on three public datasets. Our model implementation codes are
available at https://github.com/malajikuai/TDSGL.
Related papers
- AdaptSSR: Pre-training User Model with Augmentation-Adaptive
Self-Supervised Ranking [19.1857792382924]
We propose Augmentation-Supervised Ranking (AdaptSSR) to replace the contrastive learning task.
We adopt a multiple pairwise ranking loss which trains the user model to capture the similarity orders between the implicitly augmented view, the explicitly augmented view, and views from other users.
Experiments on both public and industrial datasets with six downstream tasks verify the effectiveness of AdaptSSR.
arXiv Detail & Related papers (2023-10-15T02:19:28Z) - Graph Collaborative Signals Denoising and Augmentation for
Recommendation [75.25320844036574]
We propose a new graph adjacency matrix that incorporates user-user and item-item correlations.
We show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions.
arXiv Detail & Related papers (2023-04-06T19:43:37Z) - 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) - Learning Personalized Item-to-Item Recommendation Metric via Implicit
Feedback [24.37151414523712]
This paper studies the item-to-item recommendation problem in recommender systems from a new perspective of metric learning via implicit feedback.
We develop and investigate a personalizable deep metric model that captures both the internal contents of items and how they were interacted with by users.
arXiv Detail & Related papers (2022-03-18T18:08:57Z) - ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial
Multi-View Clustering [52.491074276133325]
We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering.
The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
arXiv Detail & Related papers (2022-03-01T02:32:25Z) - Prototypical Graph Contrastive Learning [141.30842113683775]
We propose a Prototypical Graph Contrastive Learning (PGCL) approach to mitigate the critical sampling bias issue.
Specifically, PGCL models the underlying semantic structure of the graph data via clustering semantically similar graphs into the same group, and simultaneously encourages the clustering consistency for different augmentations of the same graph.
For a query, PGCL further reweights its negative samples based on the distance between their prototypes (cluster centroids) and the query prototype.
arXiv Detail & Related papers (2021-06-17T16:45:31Z) - Bootstrapping User and Item Representations for One-Class Collaborative
Filtering [24.30834981766022]
One-class collaborative filtering (OCCF) is to identify user-item pairs that are positively-related but have not been interacted yet.
This paper proposes a novel OCCF framework, named as BUIR, which does not require negative sampling.
arXiv Detail & Related papers (2021-05-13T14:24:13Z) - Disentangled Graph Collaborative Filtering [100.26835145396782]
Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data.
By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations.
DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
arXiv Detail & Related papers (2020-07-03T15:37:25Z) - Evaluating Models' Local Decision Boundaries via Contrast Sets [119.38387782979474]
We propose a new annotation paradigm for NLP that helps to close systematic gaps in the test data.
We demonstrate the efficacy of contrast sets by creating them for 10 diverse NLP datasets.
Although our contrast sets are not explicitly adversarial, model performance is significantly lower on them than on the original test sets.
arXiv Detail & Related papers (2020-04-06T14:47:18Z)
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.