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.
翻译:在信息爆炸时代,建议系统(RSs)被广泛研究并应用于发现用户首选信息。在遇到冷启动问题时,ARS表现不佳,如果将知识图(KGs)作为侧面信息,可以减轻这一问题。然而,大多数现有工作忽视了KGs节点度偏斜和KGs大量互动与建议无关的事实。为了解决这些问题,我们在本文件中提议对Relational GNN(DSKReG)的建议知识图进行可区别抽样抽样调查,以了解从KGs(DSKReG)获得的相联项目的相关性分布,并在分发后将适合建议的项目样本进行抽样。我们设计了一种可区别的抽样战略,使相关项目的选择能够与示范培训程序联合优化。实验结果表明,我们的模型比State-of-art KG-以KG-建议者系统(DSKG-建议者系统)不相干。该代码可在https://github.com/YuWang-1024/DSKREG上查阅。