KEP-Rec: A Knowledge Enhanced User-Item Relation Prediction Model for Personalized Recommendation

被引:0
作者
Wu, Lisha [1 ]
Wang, Daling [1 ]
Feng, Shi [1 ]
Zhang, Yifei [1 ]
Yu, Ge [1 ]
机构
[1] Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China
来源
WEB AND BIG DATA, PT II, APWEB-WAIM 2022 | 2023年 / 13422卷
基金
中国国家自然科学基金;
关键词
User-Item Relation Prediction; Personalized recommendation; User and item embedding; Knowledge graph; Entity propagation;
D O I
10.1007/978-3-031-25198-6_19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For more accurate, diversified and interpretable personalized recommendation, the joint consideration of user-item interaction information and side information in knowledge graph has become a research hotspot. Traditional models based on collaborative filtering usually have cold start and sparse problems. The existing recommendation model based on knowledge graph can enrich the representation of users and items by using graph structure information from the knowledge graph, and make it more interpretable. Although the efforts have achieved a certain performance improvement, they consider all entities in knowledge graph globally for all users, and the aggregation strategy is single. In this paper, we propose KEP-Rec, a Knowledge Enhanced User-Item Relation Prediction Model for Personalized Recommendation. For a given target user and candidate item, KEP-Rec represents the user and item with enhanced information by knowledge graph for predicting the interacted probability between them and further personalized recommendation. In detail, KEP-Rec takes into account the changes in preferences of specific users and the differences in user perception of relations. Based on the idea of collaborative filtering, KEP-Rec selects an extended entity set of the items relevant with target user and candidate item as the initial set to propagate in knowledge graph. Moreover, KEP-Rec sets an item-aware attention mechanism to consider the interaction of candidate items with different weights given by target user's historical preferences to realize the diverse representation of the user preferences. In the propagation process alone knowledge graph, the relation embedding is considered for target user to achieve personalization. Empirical results on three real datasets of music, books, and movies show that KEP-Rec significantly outperforms state-of-the-art methods.
引用
收藏
页码:239 / 254
页数:16
相关论文
共 28 条
[1]  
[Anonymous], 2011, Proceedings of the 17th AC M SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '11, DOI DOI 10.1145/2020408.2020480
[2]  
[Anonymous], 2008, P 17 ACM C INFORM KN
[3]  
Bordes A., 2013, ADV NEURAL INFORM PR, V26, P2787, DOI DOI 10.5555/2999792.2999923
[4]   Convex and Semi-Nonnegative Matrix Factorizations [J].
Ding, Chris ;
Li, Tao ;
Jordan, Michael I. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (01) :45-55
[5]  
Glorot X., 2010, P 13 INT C ART INT S, P249, DOI DOI 10.1109/LGRS.2016.2565705
[6]  
Guo QY, 2020, Arxiv, DOI arXiv:2003.00911
[7]   Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit [J].
Hahnloser, RHR ;
Sarpeshkar, R ;
Mahowald, MA ;
Douglas, RJ ;
Seung, HS .
NATURE, 2000, 405 (6789) :947-951
[8]  
Han J, 1995, LECT NOTES COMPUT SC, V930, P195
[9]  
Kingma D. P., 2015, PROC INT C LEARN REP
[10]  
Lin YK, 2015, AAAI CONF ARTIF INTE, P2181