Knowledge graph-based multi-context-aware recommendation algorithm

75Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Wu, C., Liu, S., Zeng, Z., Chen, M., Alhudhaif, A., Tang, X., … Peng, X. (2022). Knowledge graph-based multi-context-aware recommendation algorithm. Information Sciences, 595, 179–194. https://doi.org/10.1016/j.ins.2022.02.054

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free