BIKAGCN: Knowledge-Aware Recommendations Under Bi-layer Graph Convolutional Networks

被引:0
作者
Guoshu Li
Li Yang
Sichang Bai
Xinyu Song
Yijun Ren
Shanqiang Liu
机构
[1] Southwest Petroleum University,School of Computer Science and Software Engineering
来源
Neural Processing Letters | / 56卷
关键词
Knowledge graph; Recommender systems; Graph convolutional network; Collaborative filtering;
D O I
暂无
中图分类号
学科分类号
摘要
Recommender systems are a popular solution for the problem of information overload, offering personalized recommendations to users. Recent years, research has aimed to enhance recommender systems by employing knowledge graphs in conjunction with Graph convolutional network (GCN) to extract user and item features. Although GCN possess a great potential, they are still far from reaching their full capability in recommender systems. This paper introduces a novel approach—knowledge-aware recommendations under bi-layer graph convolutional networks (BIKAGCN) that combines attention and bi-layer GCNs to improve performance. The first layer of the BIKAGCN model trains embedding representations of users and items based on user-item interaction graphs. The second layer introduces a novel knowledge-aware layer of attention and graph convolutional network (KAGCN) layer that leverages both the first layer’s user-item embeddings and item knowledge graph embeddings. Experimental results on three publicly available datasets (MovieLens-20M, Last-FM, and Book-Crossing) demonstrate that BIKAGCN leads to significant performance improvements in recall@20 metric (14.41%, 8.86%, and 20.90%, respectively) compared to currently available state-of-the-art approaches. Moreover, the model maintains satisfactory performance in cold-start cases.The research provides some guidance for the direction of subsequent research on recommender systems.
引用
收藏
相关论文
共 50 条
[41]   Diagnosis Ranking with Knowledge Graph Convolutional Networks [J].
Liu, Bing ;
Zuccon, Guido ;
Hua, Wen ;
Chen, Weitong .
ADVANCES IN INFORMATION RETRIEVAL, ECIR 2021, PT I, 2021, 12656 :359-374
[42]   Towards Knowledge-Aware and Deep Reinforced Cross-Domain Recommendation Over Collaborative Knowledge Graph [J].
Li, Yakun ;
Hou, Lei ;
Li, Juanzi .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) :7171-7187
[43]   Graph-aware tensor factorization convolutional network for knowledge graph completion [J].
Yuzhu Jin ;
Liu Yang .
International Journal of Machine Learning and Cybernetics, 2024, 15 :1755-1766
[44]   Graph-aware tensor factorization convolutional network for knowledge graph completion [J].
Jin, Yuzhu ;
Yang, Liu .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2024, 15 (05) :1755-1766
[45]   Meta-relation assisted knowledge-aware coupled graph neural network for recommendation [J].
Chang, Yao ;
Zhou, Wei ;
Cai, Haini ;
Fan, Wei ;
Hu, Linfeng ;
Wen, Junhao .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (03)
[46]   CPGCN: Collaborative Property-aware Graph Convolutional Networks for Service Recommendation [J].
Ge, Hao ;
Li, Qianmu ;
Meng, Shunmei ;
Hou, Jun .
2022 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (IEEE SCC 2022), 2022, :10-19
[47]   EPAN-SERec: Expertise preference-aware networks for software expert recommendations with knowledge graph [J].
Tang, Mingjing ;
Wu, Di ;
Zhang, Shu ;
Gao, Wei .
EXPERT SYSTEMS WITH APPLICATIONS, 2024, 244
[48]   Syntax-Aware Sentence Matching with Graph Convolutional Networks [J].
Lei, Yangfan ;
Hu, Yue ;
Wei, Xiangpeng ;
Xing, Luxi ;
Liu, Quanchao .
KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2019, PT II, 2019, 11776 :353-364
[49]   An Efficient Recommendation Algorithm Integrating Knowledge Graph with Graph Convolutional Networks [J].
Xing, Changzheng ;
Liu, Yihai ;
Guo, Jialong .
2023 3RD ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS TECHNOLOGY AND COMPUTER SCIENCE, ACCTCS, 2023, :444-449
[50]   HGCGE: hyperbolic graph convolutional networks-based knowledge graph embedding for link prediction [J].
Bao, Liming ;
Wang, Yan ;
Song, Xiaoyu ;
Sun, Tao .
KNOWLEDGE AND INFORMATION SYSTEMS, 2025, 67 (01) :661-687