Journal of Frontiers of Computer Science and Technology ›› 2022, Vol. 16 ›› Issue (6): 1354-1361.DOI: 10.3778/j.issn.1673-9418.2012054

• Artificial Intelligence • Previous Articles     Next Articles

Two-Terminal Neighbor Information Fusion Recommendation Algorithm Based on Knowledge Graph

WANG Baoliang1,+(), PAN Wencai2   

  1. 1. Information and Network Center, Tianjin University, Tianjin 300072, China
    2. School of Electrical Automation and Information Engineering, Tianjin University, Tianjin 300072, China
  • Received:2020-12-15 Revised:2021-04-02 Online:2022-06-01 Published:2021-04-15
  • About author:WANG Baoliang, born in 1971, Ph.D., senior engineer, M.S. supervisor. His research interests include data mining, mobile Internet, image processing, etc.
    PAN Wencai, born in 1995, M.S. candidate. His research interest is recommendation algorithm.
  • Supported by:
    CERNET Innovation Project(NGII20170104)


王宝亮1,+(), 潘文采2   

  1. 1. 天津大学 信息与网络中心,天津 300072
    2. 天津大学 电气自动化与信息工程学院,天津 300072
  • 通讯作者: + E-mail:
  • 作者简介:王宝亮(1971—),男,山东潍坊人,博士,高级工程师,硕士生导师,主要研究方向为数据挖掘、移动互联、图像处理等。
  • 基金资助:


In view of the problem that some recommendation algorithms based on knowledge graphs only aggregate one end of the neighbors and cannot effectively determine the relationship between entities and users, this paper proposes a dual-end neighbor aggregation recommendation algorithm based on knowledge graphs. This algorithm explores the internal connections of knowledge graphs to discover the potential relationship between users and items. On the user side, this paper proposes a method of aggregating user neighbor information. In the relational space of the knowledge graph, the knowledge graph is used to spread and extract the user’s potential interest, and iteratively inject the potential interest into the user characteristics with attention bias to generate user embedding representation vector. At the item side, the user vector that aggregates the user’s neighbor information is sent to the KGCN (knowledge graph convolutional networks) model, and when the polymer product and its neighbor infor-mation are used, a new aggregation method is used to generate the item embedding representation. Finally, the obtained vector is sent to train. Through the inner product operation of the vector and normalization, the association score between the user and the item is obtained. Then the training is carried out in the training set to optimize the parameters. Comparative experiments are conducted on two public datasets. Compared with the baseline, on the Book-Crossing dataset, AUC and ACC are increased by 1.72% and 4.24%, and on the Last.FM dataset, AUC and ACC are increased by 1.07% and 1.14%. It is proven that the effectiveness of the algorithm is improved after the information of neighbors at both ends is aggregated.

Key words: recommendation algorithm, knowledge graph, neighbor aggregation


针对一些基于知识图谱的推荐算法仅聚合一端邻居而无法有效确定实体与用户之间关系的问题,提出了一种基于知识图谱的双端邻居聚合推荐算法,算法通过探究知识图谱的内在联系以发掘用户和物品之间的潜在关系。在用户端,提出了一种聚合用户邻居信息的方法,在知识图谱的关系空间下,使用知识图谱来传播和提取用户的潜在兴趣,通过迭代将潜在兴趣注入具有注意偏差的用户特征中生成用户嵌入表示向量;在物品端,将融合了用户邻居信息的用户向量送入KGCN模型,并在聚合物品和其邻居信息时,采用新的聚合方式,生成物品嵌入表示向量。最后,将得到的用户和物品向量送入预测环节,通过向量的内积运算并归一化得到用户和物品的关联分数,然后在训练集中进行训练,优化参数。在两个公开数据集上进行对比实验,在 Book-Crossing数据集上,相较于最优基线,AUC和ACC分别提升了1.72%和4.24%;在Last.FM数据集上,AUC和ACC分别提升了1.07%和1.14%,从而验证在聚合两端邻居信息后,算法的有效性得到了提升。

关键词: 推荐算法, 知识图谱, 邻居聚合

CLC Number: