Reinforcement learning over sentiment-augmented knowledge graphs towards accurate and explainable recommendation

Citations

WEB OF SCIENCE

58
Citations

SCOPUS

72

초록

Explainable recommendation has gained great attention in recent years. A lot of work in this research line has chosen to use the knowledge graphs (KG) where relations between entities can serve as explanations. However, existing studies have not considered sentiment on relations in KG, although there can be various types of sentiment on relations worth considering (e.g., a user's satisfaction on an item). In this paper, we propose a novel recommendation framework based on KG integrated with sentiment analysis for more accurate recommendation as well as more convincing explanations. To this end, we first construct a Sentiment-Aware Knowledge Graph (namely, SAKG) by analyzing reviews and ratings on items given by users. Then, we perform item recommendation and reasoning over SAKG through our proposed Sentiment-Aware Policy Learning (namely, SAPL) based on a reinforcement learning strategy. To enhance the explainability for end-users, we further developed an interactive user interface presenting textual explanations as well as a collection of reviews related with the discovered sentiment. Experimental results on three real-world datasets verified clear improvements on both the accuracy of recommendation and the quality of explanations.

키워드

Explainable recommendation; Knowledge graph; Sentiment analysis; Knowledge graph; Reinforcement learning; User interfaces; Sentiment analysis; End-users; Explainable recommendation; Interactive user interfaces; Knowledge graphs; Policy learning; Real-world datasets; Sentiment analysis; Users' satisfactions
제목
Reinforcement learning over sentiment-augmented knowledge graphs towards accurate and explainable recommendation
저자
Park, Sung-Jun; Chae, Dong Kyu; Bae, Hong-Kyun; Park, Sumin; Kim, Sang-Wook
DOI
10.1145/3488560.3498515
발행일
2022-02
유형
Proceedings Paper
저널명
WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING
페이지
784 ~ 793