微电子学与计算机2024,Vol.41Issue(6) :38-48.DOI:10.19304/J.ISSN1000-7180.2023.0358

基于深度知识图卷积网络的推荐算法

Recommendation algorithm based on deep knowledge graph convolution networks

张增杰 汪晓锋 毛岱波 沈国栋 王栽胜 全大英
微电子学与计算机2024,Vol.41Issue(6) :38-48.DOI:10.19304/J.ISSN1000-7180.2023.0358

基于深度知识图卷积网络的推荐算法

Recommendation algorithm based on deep knowledge graph convolution networks

张增杰 1汪晓锋 1毛岱波 2沈国栋 1王栽胜 1全大英1
扫码查看

作者信息

  • 1. 中国计量大学 信息工程学院,浙江 杭州 310018
  • 2. 宁波市科技信息与发展战略研究院,浙江 宁波 315099
  • 折叠

摘要

图神经网络在基于知识图嵌入的推荐算法中面临数据稀疏和模型过平滑问题,而导致推荐系统难以捕捉用户潜在的长期偏好.针对该问题,提出了一种基于深度知识图卷积网络的推荐算法.首先,在利用历史交互数据构建知识图谱的基础上,通过随机采样过程来获得知识图谱的多个视图以缓解交互数据稀疏的问题.其次,在知识图卷积操作过程中引入残差连接以缓解过平滑问题,从而构建一种深度知识图卷积网络以捕获高阶邻居信息并获得用户潜在的远程兴趣.同时,为了避免深层图卷积网络带来噪声输入问题,利用图自注意力机制对深层特征表示进行提纯.为验证模型的可行性和有效性,在 3 个真实数据集上进行了大量实验.实验结果表明,所提出的模型能够有效缓解过度平滑问题.在这 3 个数据集中,模型的ROC曲线下的面积(Area Under Curve,AUC,记为AUC)分别达到了 0.974、0.812 和 0.732,相较于现有方法,模型的推荐准确度明显提升.

Abstract

Graph neural networks face the challenge of data sparsity and model over-smoothing problem in knowledge graph-based recommendation algorithms,making it difficult for recommendation systems to capture users'long-term preferences.To address this issue,a recommendation algorithm based on deep knowledge graph convolutional networks is proposed.Firstly,multiple views of the knowledge graph are obtained through a random sampling process based on historical interaction data to alleviate the problem of sparse interaction data.Secondly,residual connections are introduced in the knowledge graph convolutional operation to alleviate the over-smoothing problem,thus constructing a deep knowledge graph convolutional network to capture high-order neighbor information and obtain users'potential remote interests.To avoid noisy input brought by the deep graph convolutional network,the graph self-attention mechanism is used to refine the deep feature representations.To verify the feasibility and effectiveness of the model,extensive experiments were conducted on three real-world datasets,and the results showed that the proposed model can effectively alleviate the over-smoothing problem.In these three datasets,the model achieved Area Under Curve(AUC,AUC)scores of 0.974,0.812 and 0.732 respectively.Compared to existing methods,the model showed significant improvements in recommendation accuracy.

关键词

知识图谱/推荐系统/图卷积网络/残差网络/自注意力

Key words

knowledge graph/recommendation system/graph convolutional network/residual network/self-attention

引用本文复制引用

基金项目

国家重点研发计划(2019YFB1707104)

浙江省科技攻关计划"领雁"项目(2024C01107)

出版年

2024
微电子学与计算机
中国航天科技集团公司第九研究院第七七一研究所

微电子学与计算机

CSTPCD
影响因子:0.431
ISSN:1000-7180
段落导航相关论文