4.7 Article

Knowledge graph-based multi-context-aware recommendation algorithm

Journal

INFORMATION SCIENCES
Volume 595, Issue -, Pages 179-194

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2022.02.054

Keywords

Recommender system; Knowledge graph; Path representation; Neural networks

Funding

  1. Research Funds from the National Natural Science Foundation of China [62077019]

Ask authors/readers for more resources

This paper proposes a knowledge graph-based multi-context-aware recommendation algorithm for learning user/item representations. It automatically discovers representative user preference templates and learns high-order connectivity between long-distance user-item pairs.
Because a knowledge graph's huge amount of item information can help recommender systems develop user/item representations, it has become the most important source of side information. Regardless of the numerous types of user/item representation approaches used in knowledge graph-based recommendation scenarios, they all have problems. In this paper, we propose a knowledge graph-based multi-context-aware recommendation algorithm for learning user/item representations that combines the advantages of path-based and propagation-based methods. A new concept (i.e., rule) is proposed first, which can be a useful way to characterize the user's preferences. Next, based on user-item interactions, an automatic rule discovery algorithm is proposed that can automatically select the most representative user preferences templates in a given recommendation scenario based on the knowledge graph and user behaviors. Then, the learning of high-order connectivity between long-distance user-item pairs is realized according to these templates. After that, a feature representation method of the local neighborhood characteristics of users and items is introduced to compensate for the defect that the path-based method can only catch the high-order connectivity. The experimental results demonstrate MANN's superiority over eight state-of-the-art baselines. (C) 2022 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available