Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences

In recent years, attention has been paid to knowledge graph as auxiliary information to enhance recom-mendation increasedly. Since the goal of the knowledge graph learning task is to restore the relationship of the triples in the knowledge graph, rather than to accomplish the recommendation task, it...

Full description

Bibliographic Details
Main Author: GAO Yang, LIU Yuan
Format: Article
Language:zho
Published: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 2021-06-01
Series:Jisuanji kexue yu tansuo
Subjects:
Online Access:http://fcst.ceaj.org/CN/abstract/abstract2727.shtml
_version_ 1818647419705884672
author GAO Yang, LIU Yuan
author_facet GAO Yang, LIU Yuan
author_sort GAO Yang, LIU Yuan
collection DOAJ
description In recent years, attention has been paid to knowledge graph as auxiliary information to enhance recom-mendation increasedly. Since the goal of the knowledge graph learning task is to restore the relationship of the triples in the knowledge graph, rather than to accomplish the recommendation task, it is difficult for the knowledge graph learning task to efficiently help the recommendation task improve the recommendation performance. In addition, user's interest is easily affected by short-term environment and mood. This paper proposes a recommendation model that is a multi-task feature learning approach for knowledge graph and short-term preferences enhanced recommendation (MKASR) in response to the above two points. Firstly, the RippleNet algorithm is used to extract the relationship pairs between the user and the knowledge graph entity, and then these relationship pairs are stored in the form of knowledge graph triples for participating in training. The bidirectional GRU (gate recurrent unit) network based on the attention mechanism is adopted from the user's recent interaction sequence of items to extract the user's short-term preferences. Secondly, this paper uses the multi-task learning method to train the knowledge graph learning module and the recommendation module. And the feature representation between user and item can be obtained. Finally, these feature representations and the short-term preferences of users are taken into account to make comprehensive recommendations to users. The experiments on real MovieLens-1M and Book-Crossing datasets demonstrate that the proposed model has improved performance compared with other recommendation algorithms in AUC, ACC, Precision and Recall evaluation indexes.
first_indexed 2024-12-17T01:02:14Z
format Article
id doaj.art-4495574547ae4934969cf1d48fa8cdfc
institution Directory Open Access Journal
issn 1673-9418
language zho
last_indexed 2024-12-17T01:02:14Z
publishDate 2021-06-01
publisher Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
record_format Article
series Jisuanji kexue yu tansuo
spelling doaj.art-4495574547ae4934969cf1d48fa8cdfc2022-12-21T22:09:23ZzhoJournal of Computer Engineering and Applications Beijing Co., Ltd., Science PressJisuanji kexue yu tansuo1673-94182021-06-011561133114410.3778/j.issn.1673-9418.2008059Recommendation Algorithm Combining Knowledge Graph and Short-Term PreferencesGAO Yang, LIU Yuan01. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi, Jiangsu 214122, China 2. Jiangsu Key Laboratory of Media Design and Software Technology (Jiangnan University), Wuxi, Jiangsu 214122, ChinaIn recent years, attention has been paid to knowledge graph as auxiliary information to enhance recom-mendation increasedly. Since the goal of the knowledge graph learning task is to restore the relationship of the triples in the knowledge graph, rather than to accomplish the recommendation task, it is difficult for the knowledge graph learning task to efficiently help the recommendation task improve the recommendation performance. In addition, user's interest is easily affected by short-term environment and mood. This paper proposes a recommendation model that is a multi-task feature learning approach for knowledge graph and short-term preferences enhanced recommendation (MKASR) in response to the above two points. Firstly, the RippleNet algorithm is used to extract the relationship pairs between the user and the knowledge graph entity, and then these relationship pairs are stored in the form of knowledge graph triples for participating in training. The bidirectional GRU (gate recurrent unit) network based on the attention mechanism is adopted from the user's recent interaction sequence of items to extract the user's short-term preferences. Secondly, this paper uses the multi-task learning method to train the knowledge graph learning module and the recommendation module. And the feature representation between user and item can be obtained. Finally, these feature representations and the short-term preferences of users are taken into account to make comprehensive recommendations to users. The experiments on real MovieLens-1M and Book-Crossing datasets demonstrate that the proposed model has improved performance compared with other recommendation algorithms in AUC, ACC, Precision and Recall evaluation indexes.http://fcst.ceaj.org/CN/abstract/abstract2727.shtmlrecommender systemsknowledge graphshort-term preferencespreference propagationmulti-task learning
spellingShingle GAO Yang, LIU Yuan
Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
Jisuanji kexue yu tansuo
recommender systems
knowledge graph
short-term preferences
preference propagation
multi-task learning
title Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
title_full Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
title_fullStr Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
title_full_unstemmed Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
title_short Recommendation Algorithm Combining Knowledge Graph and Short-Term Preferences
title_sort recommendation algorithm combining knowledge graph and short term preferences
topic recommender systems
knowledge graph
short-term preferences
preference propagation
multi-task learning
url http://fcst.ceaj.org/CN/abstract/abstract2727.shtml
work_keys_str_mv AT gaoyangliuyuan recommendationalgorithmcombiningknowledgegraphandshorttermpreferences