Graph Collaborative Signals Denoising and Augmentation for Recommendation

• URL: http://arxiv.org/abs/2304.03344v2
• Date: Mon, 10 Apr 2023 18:13:34 GMT
• Title: Graph Collaborative Signals Denoising and Augmentation for Recommendation
• Authors: Ziwei Fan, Ke Xu, Zhang Dong, Hao Peng, Jiawei Zhang, Philip S. Yu
• Abstract summary: 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.
• Score: 75.25320844036574
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph collaborative filtering (GCF) is a popular technique for capturing high-order collaborative signals in recommendation systems. However, GCF's bipartite adjacency matrix, which defines the neighbors being aggregated based on user-item interactions, can be noisy for users/items with abundant interactions and insufficient for users/items with scarce interactions. Additionally, the adjacency matrix ignores user-user and item-item correlations, which can limit the scope of beneficial neighbors being aggregated. In this work, we propose a new graph adjacency matrix that incorporates user-user and item-item correlations, as well as a properly designed user-item interaction matrix that balances the number of interactions across all users. To achieve this, we pre-train a graph-based recommendation method to obtain users/items embeddings, and then enhance the user-item interaction matrix via top-K sampling. We also augment the symmetric user-user and item-item correlation components to the adjacency matrix. Our experiments demonstrate that the enhanced user-item interaction matrix with improved neighbors and lower density leads to significant benefits in graph-based recommendation. Moreover, we show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions. The code is in \url{https://github.com/zfan20/GraphDA}.

Related papers

• EDGE-Rec: Efficient and Data-Guided Edge Diffusion For Recommender Systems Graphs [0.0]
  We propose a new attention mechanism to take advantage of real-valued interaction weights as well as user and item features directly. We train a novel Graph Diffusion Transformer GDiT architecture to iteratively denoise the weighted interaction matrix of the user-item interaction graph directly. Inspired by the recent progress in text-conditioned image generation, our method directly produces user-item rating predictions on the same scale as the original ratings.
  arXiv  Detail & Related papers  (2024-09-23T03:23:20Z)
• 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)
• IA-GCN: Interactive Graph Convolutional Network for Recommendation [13.207235494649343]
  Graph Convolutional Network (GCN) has become a novel state-of-the-art for Collaborative Filtering (CF) based Recommender Systems (RS) We build bilateral interactive guidance between each user-item pair and propose a new model named IA-GCN (short for InterActive GCN) Our model is built on top of LightGCN, a state-of-the-art GCN model for CF, and can be combined with various GCN-based CF architectures in an end-to-end fashion.
  arXiv  Detail & Related papers  (2022-04-08T03:38:09Z)
• Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning [29.482674624323835]
  We propose a novel contrastive learning approach, named Neighborhood-enriched Contrastive Learning, named NCL. 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.
  arXiv  Detail & Related papers  (2022-02-13T04:18:18Z)
• Multi-Behavior Enhanced Recommendation with Cross-Interaction Collaborative Relation Modeling [42.6279077675585]
  This work proposes a Graph Neural Multi-Behavior Enhanced Recommendation framework. It explicitly models the dependencies between different types of user-item interactions under a graph-based message passing architecture. Experiments on real-world recommendation datasets show that our GNMR consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-07T03:12:37Z)
• 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)
• Heterogeneous Graph Collaborative Filtering [25.05199172369437]
  We propose to model user-item interactions as a heterogeneous graph which consists of not only user-item edges indicating their interaction but also user-user edges indicating their similarity. We develop heterogeneous graph collaborative filtering (HGCF), a GCN-based framework which can explicitly capture both the interaction signal and similarity signal.
  arXiv  Detail & Related papers  (2020-11-13T08:34:53Z)
• Bundle Recommendation with Graph Convolutional Networks [71.95344006365914]
  Existing solutions integrate user-item interaction modeling into bundle recommendation by sharing model parameters or learning in a multi-task manner. We propose a graph neural network model named BGCN (short for textittextBFBundle textBFGraph textBFConvolutional textBFNetwork) for bundle recommendation.
  arXiv  Detail & Related papers  (2020-05-07T13:48:26Z)
• Graph Convolution Machine for Context-aware Recommender System [59.50474932860843]
  We extend the advantages of graph convolutions to context-aware recommender system (CARS) We propose textitGraph Convolution Machine (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution layers, and a decoder. We conduct experiments on three real-world datasets from Yelp and Amazon, validating the effectiveness of GCM and the benefits of performing graph convolutions for CARS.
  arXiv  Detail & Related papers  (2020-01-30T15:32:08Z)
• BasConv: Aggregating Heterogeneous Interactions for Basket Recommendation with Graph Convolutional Neural Network [64.73281115977576]
  Within-basket recommendation reduces the exploration time of users, where the user's intention of the basket matters. We propose a new framework named textbfBasConv, which is based on the graph convolutional neural network. Our BasConv model has three types of aggregators specifically designed for three types of nodes.
  arXiv  Detail & Related papers  (2020-01-14T16:27:32Z)

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.