Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.