Item Graph Convolution Collaborative Filtering for Inductive Recommendations

• URL: http://arxiv.org/abs/2303.15946v1
• Date: Tue, 28 Mar 2023 12:58:41 GMT
• Title: Item Graph Convolution Collaborative Filtering for Inductive Recommendations
• Authors: Edoardo D'Amico, Khalil Muhammad, Elias Tragos, Barry Smyth, Neil Hurley, Aonghus Lawlor
• Abstract summary: We propose a convolution-based algorithm, which is inductive from the user perspective, while at the same time, depending on implicit user-item interaction data. We show that our approach achieves state-the-art recommendation performance with respect to transductive baselines on four real-world datasets.
• Score: 8.653065412619357
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Graph Convolutional Networks (GCN) have been recently employed as core component in the construction of recommender system algorithms, interpreting user-item interactions as the edges of a bipartite graph. However, in the absence of side information, the majority of existing models adopt an approach of randomly initialising the user embeddings and optimising them throughout the training process. This strategy makes these algorithms inherently transductive, curtailing their ability to generate predictions for users that were unseen at training time. To address this issue, we propose a convolution-based algorithm, which is inductive from the user perspective, while at the same time, depending only on implicit user-item interaction data. We propose the construction of an item-item graph through a weighted projection of the bipartite interaction network and to employ convolution to inject higher order associations into item embeddings, while constructing user representations as weighted sums of the items with which they have interacted. Despite not training individual embeddings for each user our approach achieves state of-the-art recommendation performance with respect to transductive baselines on four real-world datasets, showing at the same time robust inductive performance.

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)
• Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation [84.45144851024257]
  CoGCL aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes. We introduce a multi-level vector quantizer in an end-to-end manner to quantize user and item representations into discrete codes. For neighborhood structure, we propose virtual neighbor augmentation by treating discrete codes as virtual neighbors. Regarding semantic relevance, we identify similar users/items based on shared discrete codes and interaction targets to generate the semantically relevant view.
  arXiv  Detail & Related papers  (2024-09-09T14:04:17Z)
• Feature Decoupling-Recycling Network for Fast Interactive Segmentation [79.22497777645806]
  Recent interactive segmentation methods iteratively take source image, user guidance and previously predicted mask as the input. We propose the Feature Decoupling-Recycling Network (FDRN), which decouples the modeling components based on their intrinsic discrepancies.
  arXiv  Detail & Related papers  (2023-08-07T12:26:34Z)
• 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)
• Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation [62.30552176649873]
  We devise a novel Dynamic Representation Learning model for Sequential Recommendation (DRL-SRe) To better model the user-item interactions for characterizing the dynamics from both sides, the proposed model builds a global user-item interaction graph for each time slice. To enable the model to capture fine-grained temporal information, we propose an auxiliary temporal prediction task over consecutive time slices.
  arXiv  Detail & Related papers  (2021-09-24T07:44:27Z)
• Position-enhanced and Time-aware Graph Convolutional Network for Sequential Recommendations [3.286961611175469]
  We propose a new deep learning-based sequential recommendation approach based on a Position-enhanced and Time-aware Graph Convolutional Network (PTGCN) PTGCN models the sequential patterns and temporal dynamics between user-item interactions by defining a position-enhanced and time-aware graph convolution operation. It realizes the high-order connectivity between users and items by stacking multi-layer graph convolutions.
  arXiv  Detail & Related papers  (2021-07-12T07:34:20Z)
• Graph Convolutional Embeddings for Recommender Systems [67.5973695167534]
  We propose a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions. More specifically, we define a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions.
  arXiv  Detail & Related papers  (2021-03-05T10:46:16Z)
• Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach [115.76667128325361]
  Recommendation models can effectively estimate underlying user interests and predict one's future behaviors. We propose an inductive collaborative filtering framework that contains two representation models. Our model achieves promising results for recommendation on few-shot users with limited training ratings and new unseen users.
  arXiv  Detail & Related papers  (2020-07-09T14:31:25Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

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.