A novel KG-based recommendation model via relation-aware attentional GCN

Abstract

Leveraging knowledge graphs (KGs) to enhance recommender systems has gained considerable attention, with researchers obtaining user preferences by aggregating entity pairs with explicit relations in KGs via graph convolutional networks (GCNs). Existing approaches currently overlook many entity pairs without relations, which, however, may have potentially useful information. To address this issue, we propose a novel relation-aware attentional GCN (RAAGCN) with the following improvements over vanilla GCNs: (1) it aggregates all entity pairs with and without explicit relations and (2) it distinguishes the importance of different relational context information. Based on the proposed RAAGCN, we further propose a user preference and item attractiveness capturing model (UPIACM) for KG-based recommendation. In the UPIACM, the user preference is decomposed into interest and rating preferences. The interest preference is the user’s interest taste toward the items with specific features, while the rating preference reflects the intention of rating high or low. Additionally, our model accounts for item attractiveness, which reflects an item’s popularity among users. Additionally, we incorporate a gated filtering mechanism to further improve our model’s performance. Through extensive experiments, we show that the proposed UPIACM outperforms state-of-the-art baseline methods.