
Research Article
KPG4Rec: Knowledge Property-Aware Graph for Recommender Systems
@INPROCEEDINGS{10.1007/978-3-030-99191-3_9, author={Hao Ge and Qianmu Li and Shunmei Meng and Jun Hou}, title={KPG4Rec: Knowledge Property-Aware Graph for Recommender Systems}, proceedings={Cloud Computing. 11th EAI International Conference, CloudComp 2021, Virtual Event, December 9--10, 2021, Proceedings}, proceedings_a={CLOUDCOMP}, year={2022}, month={3}, keywords={Knowledge graph Property-aware graph Semantic information Recommendation system}, doi={10.1007/978-3-030-99191-3_9} }
- Hao Ge
Qianmu Li
Shunmei Meng
Jun Hou
Year: 2022
KPG4Rec: Knowledge Property-Aware Graph for Recommender Systems
CLOUDCOMP
Springer
DOI: 10.1007/978-3-030-99191-3_9
Abstract
The collaborative filtering (CF) based models have the powerful ability to use the interaction of users and items for recommendation. However, many existing CF-based approaches can only grasp the single relationship between users or items, such as item-based CF, which utilizes the single relationship of similarity identified from user-item matrix to compute recommendations. To overcome these shortcomings, we propose a novel approach named KPG4Rec which integrates multiple property relationships of items for personalized recommendation. In the initial step, we extract properties and corresponding triples of items from an existing knowledge graph, and utilize them to construct property-aware graphs based on user-item interaction graphs. Then, continuous low-dimensional vectors are learned through node2vec technology in these graphs. In the prediction phase, the recommendation score of one candidate item is computed by comparing it with each item in the user history preference sequence, where the pretrained embedding vectors of items are used to take all the properties into consideration. On the other hand, Locality Sensitive Hashing (LSH) mechanism is adopted to generate brand new preference sequences of users to improve the efficiency of KPG4Rec. Through extensive experiments on two real-world datasets, our approach is proved to outperform several widely adopted methods in the Top-N recommendation scenario.