Knowledge graph enhanced neural collaborative recommendation

被引:49
作者
Sang L. [1 ,2 ,3 ]
Xu M. [2 ]
Qian S. [4 ]
Wu X. [1 ,3 ,5 ]
机构
[1] Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei
[2] Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney
[3] School of Computer Science and Information Engineering, Hefei University of Technology, Hefei
[4] Institute of Automation, Chinese Academy of Sciences, Beijing
[5] Mininglamp Academy of Sciences, Mininglamp Technology, Beijing
基金
中国国家自然科学基金;
关键词
Attention mechanism; Graph convolutional networks; Knowledge graph; Neural collaborative filtering; Recommendation system;
D O I
10.1016/j.eswa.2020.113992
中图分类号
学科分类号
摘要
Existing neural collaborative filtering (NCF) recommendation methods suffer from severe sparsity problem. Knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem. However, pure NCF models can hardly model the high-order connectivity in KG, and ignores complex pairwise correlations between user/item embedding dimensions. To address these problems, we propose a novel Knowledge graph enhanced Neural Collaborative Recommendation (K-NCR) framework, which effectively combines user–item interaction information and auxiliary knowledge information for recommendation task into three parts: (1) For items, the proposed propagating model learns the representation of item entity. It recursively aggregates information from its multi-hop neighbours in KG, and employs an attention mechanism to discriminate the importance of the relation type to mine users’ potential preferences. (2) For users, another heterogeneous attention weights are leveraged to strengthen the embedding learning of users. (3) The user and item embeddings are then fed into a newly designed two-dimensional interaction map with convolutional hidden layers to model the complex pairwise correlations between their embedding dimensions explicitly. Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our K-NCR framework. © 2020
引用
收藏
相关论文
共 72 条
[1]  
Bahdanau D., Cho K., Bengio Y., (2015)
[2]  
Bai T., Wen J.-R., Zhang J., Zhao W., (2017)
[3]  
Bordes A., Usunier N., Garcia-Duran A., Weston J., Yakhnenko O., Translating embeddings for modeling multi-relational data, Advances in neural information processing systems, pp. 2787-2795, (2013)
[4]  
Boscaini D., Masci J., Rodola E., Bronstein M., Learning shape correspondence with anisotropic convolutional neural networks, Advances in neural information processing systems, pp. 3189-3197, (2016)
[5]  
Cao Y., Wang X., He X., Hu Z., Chua T.-S., Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences, The world wide web conference, pp. 151-161, (2019)
[6]  
Chen X., Li L.-J., Fei-Fei L., Gupta A., (2018)
[7]  
Cheng H., Koc L., Harmsen J., Shaked T., Chandra T., Aradhye H., Anderson G., Corrado G., Chai W., Ispir M., Anil R., Haque Z., Hong L., Jain V., Liu X., Shah H., (2016)
[8]  
Defferrard M., Bresson X., Vandergheynst P., Convolutional neural networks on graphs with fast localized spectral filtering, Advances in neural information processing systems, pp. 3844-3852, (2016)
[9]  
Deng Z., Huang L., Wang C., Lai J., Yu P., (2019)
[10]  
Funk S., Netflix update: Try this at home, (2006)