Incorporating knowledge graph as side information has become a new trend in recommendation systems. Recent studies regard items as entities of a knowledge graph and leverage graph neural networks to assist item encoding, yet by considering each relation type individually. However, relation types are often too many and sometimes one relation type involves too few entities. We argue that it is not efficient nor effective to use every relation type for item encoding. In this paper, we propose a VRKG4Rec model (Virtual Relational Knowledge Graphs for Recommendation), which explicitly distinguish the influence of different relations for item representation learning. We first construct virtual relational graphs (VRKGs) by an unsupervised learning scheme. We also design a local weighted smoothing (LWS) mechanism for encoding nodes, which iteratively updates a node embedding only depending on the embedding of its own and its neighbors, but involve no additional training parameters. We also employ the LWS mechanism on a user-item bipartite graph for user representation learning, which utilizes encodings of items with relational knowledge to help training representations of users. Experiment results on two public datasets validate that our VRKG4Rec model outperforms the state-of-the-art methods. The implementations are available at https://github.com/lulu0913/VRKG4Rec.
翻译:将知识图作为侧面信息纳入知识图已成为建议系统中的新趋势。 最近的研究将项目视为知识图和杠杆图神经网络的实体,以协助项目编码, 但是通过个别考虑每种关系类型。 但是, 关系类型往往过多, 有时一种关系类型涉及太少的实体。 我们争辩说, 将每一种关系类型都用于项目编码, 效率不高, 效率不高。 在本文件中, 我们提议了一个 VRKG4Rec 模型( 虚拟关系知识图用于建议), 明确区分不同关系对项目代表性学习的影响。 我们首先通过一个不受监督的学习计划来建立虚拟关系图( VRKGGs ) 。 我们还设计了一个本地加权平滑( LWS) 机制, 用于用户代表学习, 利用具有关联知识的项目编码来帮助培训用户 。 两个公共数据集的实验结果验证了我们 VRKG4Rec 的模型/Restors 。 在 httpRK4/Restroductions 。