%0 Conference Paper %1 Xian:2019:RKG:3331184.3331203 %A Xian, Yikun %A Fu, Zuohui %A Muthukrishnan, S. %A de Melo, Gerard %A Zhang, Yongfeng %B Proceedings of the 42Nd International ACM SIGIR Conference on Research and Development in Information Retrieval %C New York, NY, USA %D 2019 %I ACM %K explanation knowledge-graph recommender %P 285--294 %R 10.1145/3331184.3331203 %T Reinforcement Knowledge Graph Reasoning for Explainable Recommendation %U http://doi.acm.org/10.1145/3331184.3331203 %X Recent advances in personalized recommendation have sparked great interest in the exploitation of rich structured information provided by knowledge graphs. Unlike most existing approaches that only focus on leveraging knowledge graphs for more accurate recommendation, we aim to conduct explicit reasoning with knowledge for decision making so that the recommendations are generated and supported by an interpretable causal inference procedure. To this end, we propose a method called Policy-Guided Path Reasoning (PGPR), which couples recommendation and interpretability by providing actual paths in a knowledge graph. Our contributions include four aspects. We first highlight the significance of incorporating knowledge graphs into recommendation to formally define and interpret the reasoning process. Second, we propose a reinforcement learning (RL) approach featured by an innovative soft reward strategy, user-conditional action pruning and a multi-hop scoring function. Third, we design a policy-guided graph search algorithm to efficiently and effectively sample reasoning paths for recommendation. Finally, we extensively evaluate our method on several large-scale real-world benchmark datasets, obtaining favorable results compared with state-of-the-art methods. %@ 978-1-4503-6172-9

@inproceedings{Xian:2019:RKG:3331184.3331203, abstract = {Recent advances in personalized recommendation have sparked great interest in the exploitation of rich structured information provided by knowledge graphs. Unlike most existing approaches that only focus on leveraging knowledge graphs for more accurate recommendation, we aim to conduct explicit reasoning with knowledge for decision making so that the recommendations are generated and supported by an interpretable causal inference procedure. To this end, we propose a method called Policy-Guided Path Reasoning (PGPR), which couples recommendation and interpretability by providing actual paths in a knowledge graph. Our contributions include four aspects. We first highlight the significance of incorporating knowledge graphs into recommendation to formally define and interpret the reasoning process. Second, we propose a reinforcement learning (RL) approach featured by an innovative soft reward strategy, user-conditional action pruning and a multi-hop scoring function. Third, we design a policy-guided graph search algorithm to efficiently and effectively sample reasoning paths for recommendation. Finally, we extensively evaluate our method on several large-scale real-world benchmark datasets, obtaining favorable results compared with state-of-the-art methods.}, acmid = {3331203}, added-at = {2019-12-25T19:15:38.000+0100}, address = {New York, NY, USA}, author = {Xian, Yikun and Fu, Zuohui and Muthukrishnan, S. and de Melo, Gerard and Zhang, Yongfeng}, biburl = {https://www.bibsonomy.org/bibtex/2b002a3be31d1a7929862b98a74f75571/brusilovsky}, booktitle = {Proceedings of the 42Nd International ACM SIGIR Conference on Research and Development in Information Retrieval}, description = {Reinforcement Knowledge Graph Reasoning for Explainable Recommendation}, doi = {10.1145/3331184.3331203}, interhash = {dc47f816ab17c957e38aa5bb8c380679}, intrahash = {b002a3be31d1a7929862b98a74f75571}, isbn = {978-1-4503-6172-9}, keywords = {explanation knowledge-graph recommender}, location = {Paris, France}, numpages = {10}, pages = {285--294}, publisher = {ACM}, series = {SIGIR'19}, timestamp = {2019-12-25T19:20:27.000+0100}, title = {Reinforcement Knowledge Graph Reasoning for Explainable Recommendation}, url = {http://doi.acm.org/10.1145/3331184.3331203}, year = 2019 }