DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN
In the information explosion era, recommender systems (RSs) are widely studied and applied to discover user-preferred information. A RS performs poorly when suffering from the cold-start issue, which can be alleviated if incorporating Knowledge Graphs (KGs) as side information. However, most existing works neglect the facts that node degrees in KGs are skewed and massive amount of interactions in KGs are recommendation-irrelevant. To address these problems, in this paper, we propose Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN (DSKReG) that learns the relevance distribution of connected items from KGs and samples suitable items for recommendation following this distribution. We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems. The code is available online at https://github.com/YuWang-1024/DSKReG.
Code (1)
Tasks
Knowledge GraphsRecommendation SystemsSimilar Papers 제목 키워드 기반
Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation
Knowledge graph (KG) contains well-structured external information and has shown to be effective for high-quality recommendation. However, existing KG enhanced recommendation methods have largely focused on exploring adv…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsMemorization+1Knowledge Graph-enhanced Sampling for Conversational Recommender System
The traditional recommendation systems mainly use offline user data to train offline models, and then recommend items for online users, thus suffering from the unreliable estimation of user preferences based on sparse an…
Conversational RecommendationRecommendation SystemsReinforced Negative Sampling over Knowledge Graph for Recommendation
Properly handling missing data is a fundamental challenge in recommendation. Most present works perform negative sampling from unobserved data to supply the training of recommender models with negative signals. Neverthel…
Reinforcement LearningRegion or Global? A Principle for Negative Sampling in Graph-based Recommendation
Graph-based recommendation systems are blossoming recently, which models user-item interactions as a user-item graph and utilizes graph neural networks (GNNs) to learn the embeddings for users and items. A fundamental ch…
Recommendation SystemsContextualized Graph Attention Network for Recommendation with Item Knowledge Graph
Graph neural networks (GNN) have recently been applied to exploit knowledge graph (KG) for recommendation. Existing GNN-based methods explicitly model the dependency between an entity and its local graph context in KG (i…
Graph Attention