Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems

Hongjian Gu, Yaochen Hu, Yingxue Zhang
11/30/2023
cs.IRcs.LG

No confident code implementation found for this paper.

Abstract

Graph-based collaborative filtering methods have prevailing performance for recommender systems since they can capture high-order information between users and items, in which the graphs are constructed from the observed user-item interactions that might miss links or contain spurious positive interactions in industrial scenarios. The Bayesian Graph Neural Network framework approaches this issue with generative models for the interaction graphs. The critical problem is to devise a proper family of graph generative models tailored to recommender systems. We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information. Experiments on four popular benchmark datasets demonstrate the effectiveness of our proposed graph generative methods for recommender systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{gu2023preference,
  title  = {Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems},
  author = {Hongjian Gu and Yaochen Hu and Yingxue Zhang},
  year   = {2023},
  eprint = {2312.11486},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.11486v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.11486.svg)](https://codeofpaper.com/paper/2312.11486)

Discussion