Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning

Abstract

Recently, graph collaborative filtering methods have been proposed as an effective recommendation approach, which can capture users' preference over items by modeling the user-item interaction graphs. In order to reduce the influence of data sparsity, contrastive learning is adopted in graph collaborative filtering for enhancing the performance. However, these methods typically construct the contrastive pairs by random sampling, which neglect the neighboring relations among users (or items) and fail to fully exploit the potential of contrastive learning for recommendation. To tackle the above issue, we propose a novel contrastive learning approach, named Neighborhood-enriched Contrastive Learning, named NCL, which explicitly incorporates the potential neighbors into contrastive pairs. Specifically, we introduce the neighbors of a user (or an item) from graph structure and semantic space respectively. For the structural neighbors on the interaction graph, we develop a novel structure-contrastive objective that regards users (or items) and their structural neighbors as positive contrastive pairs. In implementation, the representations of users (or items) and neighbors correspond to the outputs of different GNN layers. Furthermore, to excavate the potential neighbor relation in semantic space, we assume that users with similar representations are within the semantic neighborhood, and incorporate these semantic neighbors into the prototype-contrastive objective. The proposed NCL can be optimized with EM algorithm and generalized to apply to graph collaborative filtering methods. Extensive experiments on five public datasets demonstrate the effectiveness of the proposed NCL, notably with 26% and 17% performance gain over a competitive graph collaborative filtering base model on the Yelp and Amazon-book datasets respectively. Our code is available at: https://github.com/RUCAIBox/NCL.

arXiv comment10 pages, 6 figures. Accepted by TheWebConf 2022

References in corpus (15)

• A Simple Framework for Contrastive Learning of Visual Representations
• Representation Learning with Contrastive Predictive Coding
• BPR: Bayesian Personalized Ranking from Implicit Feedback
• Neural Graph Collaborative Filtering
• Graph Convolutional Neural Networks for Web-Scale Recommender Systems
• Self-supervised Graph Learning for Recommendation
• Graph Contrastive Learning with Adaptive Augmentation
• Graph Contrastive Learning with Augmentations
• Disentangled Graph Collaborative Filtering
• Graph Self-Supervised Learning: A Survey
• Prototypical Contrastive Learning of Unsupervised Representations
• LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
• Deep Graph Contrastive Representation Learning
• Contrastive Multi-View Representation Learning on Graphs
• Graph Neural Networks in Recommender Systems: A Survey

Cited by in corpus (40)

• Heterogeneous Graph Contrastive Learning for Recommendation
• Multi-Modal Self-Supervised Learning for Recommendation
• Representation Learning with Large Language Models for Recommendation
• Disentangled Contrastive Collaborative Filtering
• Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure
• Automated Self-Supervised Learning for Recommendation
• Improving Knowledge-aware Recommendation with Multi-level Interactive Contrastive Learning
• Graph Transformer for Recommendation
• RecDCL: Dual Contrastive Learning for Recommendation
• Modeling Two-Way Selection Preference for Person-Job Fit
• Graph-less Collaborative Filtering
• Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering
• SSLRec: A Self-Supervised Learning Framework for Recommendation
• Knowledge-refined Denoising Network for Robust Recommendation
• Intent-aware Recommendation via Disentangled Graph Contrastive Learning
• Adap-$\tau$: Adaptively Modulating Embedding Magnitude for Recommendation
• Bi-Level Graph Structure Learning for Next POI Recommendation
• A Comprehensive Survey on Self-Supervised Learning for Recommendation
• LightGNN: Simple Graph Neural Network for Recommendation
• How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective
• Towards Robust Recommendation via Decision Boundary-aware Graph Contrastive Learning
• Adapting Job Recommendations to User Preference Drift with Behavioral-Semantic Fusion Learning
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis
• Towards Mitigating Dimensional Collapse of Representations in Collaborative Filtering
• Content-Based Collaborative Generation for Recommender Systems
• Code Recommendation for Open Source Software Developers
• Fair Augmentation for Graph Collaborative Filtering
• MixRec: Individual and Collective Mixing Empowers Data Augmentation for Recommender Systems
• A Survey of Latent Factor Models in Recommender Systems
• Robust Basket Recommendation via Noise-tolerated Graph Contrastive Learning
• Can We Trust Recommender System Fairness Evaluation? The Role of Fairness and Relevance
• Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation
• Prototypical Contrastive Learning through Alignment and Uniformity for Recommendation
• Intent Propagation Contrastive Collaborative Filtering
• Enhancing Transferability and Consistency in Cross-Domain Recommendations via Supervised Disentanglement
• Pre-training for Recommendation Unlearning
• SEP-GCN: Leveraging Similar Edge Pairs with Temporal and Spatial Contexts for Location-Based Recommender Systems
• Generative Data Augmentation in Graph Contrastive Learning for Recommendation
• Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarios
• Joint Evaluation of Fairness and Relevance in Recommender Systems with Pareto Frontier