Graph Convolution Machine for Context-aware Recommender System

• URL: http://arxiv.org/abs/2001.11402v3
• Date: Wed, 19 May 2021 09:46:14 GMT
• Title: Graph Convolution Machine for Context-aware Recommender System
• Authors: Jiancan Wu, Xiangnan He, Xiang Wang, Qifan Wang, Weijian Chen, Jianxun Lian, Xing Xie
• Abstract summary: 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.
• Score: 59.50474932860843
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: The latest advance in recommendation shows that better user and item representations can be learned via performing graph convolutions on the user-item interaction graph. However, such finding is mostly restricted to the collaborative filtering (CF) scenario, where the interaction contexts are not available. In this work, we extend the advantages of graph convolutions to context-aware recommender system (CARS, which represents a generic type of models that can handle various side information). We propose \textit{Graph Convolution Machine} (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution (GC) layers, and a decoder. The encoder projects users, items, and contexts into embedding vectors, which are passed to the GC layers that refine user and item embeddings with context-aware graph convolutions on user-item graph. The decoder digests the refined embeddings to output the prediction score by considering the interactions among user, item, and context embeddings. 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. Our implementations are available at \url{https://github.com/wujcan/GCM}.

Related papers

• Graph Cross-Correlated Network for Recommendation [23.112962250384506]
  We propose the Graph Cross-correlated Network for Recommendation (GCR), which explicitly considers correlations between user/item subgraphs. GCR outperforms state-of-the-art models on both interaction prediction and click-through rate prediction tasks.
  arXiv  Detail & Related papers  (2024-11-02T08:50:11Z)
• CoActionGraphRec: Sequential Multi-Interest Recommendations Using Co-Action Graphs [4.031699584957737]
  eBay's data sparsity exceeds other e-commerce sites by an order of magnitude. We propose a text based two-tower deep learning model (Item Tower and User Tower) utilizing co-action graph layers. For the Item Tower, we represent each item using its co-action items to capture collaborative signals in a co-action graph that is fully leveraged by the graph neural network component.
  arXiv  Detail & Related papers  (2024-10-15T10:11:18Z)
• 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)
• GraphCoCo: Graph Complementary Contrastive Learning [65.89743197355722]
  Graph Contrastive Learning (GCL) has shown promising performance in graph representation learning (GRL) without the supervision of manual annotations. This paper proposes an effective graph complementary contrastive learning approach named GraphCoCo to tackle the above issue.
  arXiv  Detail & Related papers  (2022-03-24T02:58:36Z)
• GraphDCA -- a Framework for Node Distribution Comparison in Real and Synthetic Graphs [72.51835626235368]
  We argue that when comparing two graphs, the distribution of node structural features is more informative than global graph statistics. We present GraphDCA - a framework for evaluating similarity between graphs based on the alignment of their respective node representation sets.
  arXiv  Detail & Related papers  (2022-02-08T14:19:19Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• 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)
• Class-wise Dynamic Graph Convolution for Semantic Segmentation [63.08061813253613]
  We propose a class-wise dynamic graph convolution (CDGC) module to adaptively propagate information. We also introduce the Class-wise Dynamic Graph Convolution Network(CDGCNet), which consists of two main parts including the CDGC module and a basic segmentation network. We conduct extensive experiments on three popular semantic segmentation benchmarks including Cityscapes, PASCAL VOC 2012 and COCO Stuff.
  arXiv  Detail & Related papers  (2020-07-19T15:26:50Z)

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.