MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations

Knowledge graphs (KGs) have been proven to be effective for improving the performance of recommender systems. KGs can store rich side information and relieve the data sparsity problem. There are many linked attributes between entity pairs (e.g., items and users) in KGs, which can be called multiple-...

Full description

Bibliographic Details
Main Authors: Ting Wang, Daqian Shi, Zhaodan Wang, Shuai Xu, Hao Xu
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9146117/
id doaj-d0d6bbf581fa4008b3c943d543820c39
record_format Article
spelling doaj-d0d6bbf581fa4008b3c943d543820c392021-03-30T04:40:58ZengIEEEIEEE Access2169-35362020-01-01813481713482510.1109/ACCESS.2020.30112799146117MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based RecommendationsTing Wang0https://orcid.org/0000-0002-5869-5058Daqian Shi1https://orcid.org/0000-0003-2183-1957Zhaodan Wang2https://orcid.org/0000-0003-3128-3990Shuai Xu3https://orcid.org/0000-0002-4687-506XHao Xu4https://orcid.org/0000-0001-8474-0767College of Computer Science and Technology, Jilin University, Changchun, ChinaICT International Doctoral School, University of Trento, Trento, ItalyCollege of Aviation Foundation, Aviation University of Air Force, Changchun, ChinaCollege of Electronic Science and Engineering, Jilin University, Changchun, ChinaCollege of Computer Science and Technology, Jilin University, Changchun, ChinaKnowledge graphs (KGs) have been proven to be effective for improving the performance of recommender systems. KGs can store rich side information and relieve the data sparsity problem. There are many linked attributes between entity pairs (e.g., items and users) in KGs, which can be called multiple-step relation paths. Existing methods do not sufficiently exploit the information encoded in KGs. In this paper, we propose MRP2Rec to explore various semantic relations in multiple-step relation paths to improve recommendation performance. The knowledge representation learning approach is used in our method to learn and represent multiple-step relation paths, and they are further utilized to generate prediction lists by inner products in top-K recommendations. Experiments on two real-world datasets demonstrate that our model achieves higher performance compared with many state-of-the-art baselines.https://ieeexplore.ieee.org/document/9146117/Recommender systemsknowledge graphsemantic representation
collection DOAJ
language English
format Article
sources DOAJ
author Ting Wang
Daqian Shi
Zhaodan Wang
Shuai Xu
Hao Xu
spellingShingle Ting Wang
Daqian Shi
Zhaodan Wang
Shuai Xu
Hao Xu
MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
IEEE Access
Recommender systems
knowledge graph
semantic representation
author_facet Ting Wang
Daqian Shi
Zhaodan Wang
Shuai Xu
Hao Xu
author_sort Ting Wang
title MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
title_short MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
title_full MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
title_fullStr MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
title_full_unstemmed MRP2Rec: Exploring Multiple-Step Relation Path Semantics for Knowledge Graph-Based Recommendations
title_sort mrp2rec: exploring multiple-step relation path semantics for knowledge graph-based recommendations
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Knowledge graphs (KGs) have been proven to be effective for improving the performance of recommender systems. KGs can store rich side information and relieve the data sparsity problem. There are many linked attributes between entity pairs (e.g., items and users) in KGs, which can be called multiple-step relation paths. Existing methods do not sufficiently exploit the information encoded in KGs. In this paper, we propose MRP2Rec to explore various semantic relations in multiple-step relation paths to improve recommendation performance. The knowledge representation learning approach is used in our method to learn and represent multiple-step relation paths, and they are further utilized to generate prediction lists by inner products in top-K recommendations. Experiments on two real-world datasets demonstrate that our model achieves higher performance compared with many state-of-the-art baselines.
topic Recommender systems
knowledge graph
semantic representation
url https://ieeexplore.ieee.org/document/9146117/
work_keys_str_mv AT tingwang mrp2recexploringmultiplesteprelationpathsemanticsforknowledgegraphbasedrecommendations
AT daqianshi mrp2recexploringmultiplesteprelationpathsemanticsforknowledgegraphbasedrecommendations
AT zhaodanwang mrp2recexploringmultiplesteprelationpathsemanticsforknowledgegraphbasedrecommendations
AT shuaixu mrp2recexploringmultiplesteprelationpathsemanticsforknowledgegraphbasedrecommendations
AT haoxu mrp2recexploringmultiplesteprelationpathsemanticsforknowledgegraphbasedrecommendations
_version_ 1724181479677755392