Explainable Session-Based Recommendation via Path Reasoning
Authors: 
Yang Cao, 
Shuo Shang, Jun Wang, Wei ZhangAuthors Info & Claims
Yang Cao, Shuo Shang, Jun Wang, Wei ZhangAuthors Info & ClaimsPages 278 - 290
Abstract
This paper explores explaining session-based recommendation (SR) by path reasoning. Current SR models emphasize accuracy but lack explainability, while traditional path reasoning prioritizes knowledge graph exploration, ignoring sequential patterns present in the session history. Therefore, we propose a generalized hierarchical reinforcement learning framework for SR, which improves the explainability of existing SR models via Path Reasoning, namely PR4SR. Considering the different importance of items to the session, we design the session-level agent to select the items in the session as the starting nodes for path reasoning and the path-level agent to perform path reasoning. In particular, we design a multi-target reward mechanism to adapt to the skip behaviors of sequential patterns in SR and introduce path midpoint reward to enhance the exploration efficiency and accuracy in knowledge graphs. To improve the knowledge graph’s completeness and diversify the paths of explanation, we incorporate extracted feature information from images into the knowledge graph. We instantiate PR4SR in five state-of-the-art SR models (i.e., GRU4REC, NARM, GCSAN, SR-GNN, SASRec) and compare it with other explainable SR frameworks to demonstrate the effectiveness of PR4SR for recommendation and explanation tasks through extensive experiments with these approaches on four datasets.
References
[1]
B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk, “Session-based recommendations with recurrent neural networks,” in Proc. 4th Int. Conf. Learn. Representations, San Juan, Puerto Rico, 2016.
[2]
J. Li, P. Ren, Z. Chen, Z. Ren, T. Lian, and J. Ma, “Neural attentive session-based recommendation,” in Proc. ACM Conf. Inf. Knowl. Manage., 2017, pp. 1419–1428.
[3]
W.-C. Kang and J. McAuley, “Self-attentive sequential recommendation,” in Proc. IEEE Int. Conf. Data Mining, 2018, pp. 197–206.
[4]
Q. Liu, Y. Zeng, R. Mokhosi, and H. Zhang, “Stamp: Short-term attention/memory priority model for session-based recommendation,” in Proc. 24th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 1831–1839.
[5]
C. Xu et al., “Graph contextualized self-attention network for session-based recommendation,” in Proc. Int. Joint Conf. Artif. Intell., 2019, pp. 3940–3946.
[6]
S. Wu, Y. Tang, Y. Zhu, L. Wang, X. Xie, and T. Tan, “Session-based recommendation with graph neural networks,” in Proc. AAAI Conf. Artif. Intell., 2019, pp. 346–353.
[7]
W. Wang et al., “Beyond clicks: Modeling multi-relational item graph for session-based target behavior prediction,” in Proc. Web Conf., 2020, pp. 3056–3062.
[8]
W. Wang et al., “Incorporating link prediction into multi-relational item graph modeling for session-based recommendation,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 3, pp. 2683–2696, Mar. 2023.
[9]
S. Naveed, B. Loepp, and J. Ziegler, “On the use of feature-based collaborative explanations: An empirical comparison of explanation styles,” in Proc. Adjunct Pub. 28th ACM Conf. User Model., Adapt. Personalization, 2020, pp. 226–232.
[10]
H. Zarzour, Y. Jararweh, and Z. A. Al-Sharif, “An effective model-based trust collaborative filtering for explainable recommendations,” in Proc. 11th Int. Conf. Inf. Commun. Syst., 2020, pp. 238–242.
[11]
M. Caro-Martinez, J. A. Recio-Garcia, and G. Jimenez-Diaz, “An algorithm independent case-based explanation approach for recommender systems using interaction graphs,” in Proc. Case-Based Reasoning Res. Development: 27th Int. Conf., Otzenhausen, Germany, Springer, 2019, pp. 17–32.
[12]
W. Ma et al., “Jointly learning explainable rules for recommendation with knowledge graph,” in Proc. World Wide Web Conf., 2019, pp. 1210–1221.
[13]
S.-J. Park, D.-K. Chae, H.-K. Bae, S. Park, and S.-W. Kim, “Reinforcement learning over sentiment-augmented knowledge graphs towards accurate and explainable recommendation,” in Proc. 15th ACM Int. Conf. Web Search Data Mining, 2022, pp. 784–793.
[14]
K. Zhao et al., “Leveraging demonstrations for reinforcement recommendation reasoning over knowledge graphs,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2020, pp. 239–248.
[15]
Z. Fu et al., “Fairness-aware explainable recommendation over knowledge graphs,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2020, pp. 69–78.
[16]
Y. Xian et al., “CAFE: Coarse-to-fine neural symbolic reasoning for explainable recommendation,” in Proc. 29th ACM Int. Conf. Inf. Knowl. Manage., 2020, pp. 1645–1654.
[17]
H. Lu et al., “User perception of recommendation explanation: Are your explanations what users need?,” ACM Trans. Inf. Syst., vol. 41, no. 2, pp. 1–31, 2023.
[18]
C. Liu et al., “Social-enhanced explainable recommendation with knowledge graph,” IEEE Trans. Knowl. Data Eng., vol. 36, no. 2, pp. 840–853, Feb. 2024.
[19]
Z. Lyu, Y. Wu, J. Lai, M. Yang, C. Li, and W. Zhou, “Knowledge enhanced graph neural networks for explainable recommendation,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 5, pp. 4954–4968, May 2023.
[20]
Y. Wei, X. Qu, X. Wang, Y. Ma, L. Nie, and T.-S. Chua, “Rule-guided counterfactual explainable recommendation,” IEEE Trans. Knowl. Data Eng., vol. 36, no. 5, pp. 2179–2190, May 2024.
[21]
X. Wang, K. Liu, D. Wang, L. Wu, Y. Fu, and X. Xie, “Multi-level recommendation reasoning over knowledge graphs with reinforcement learning,” in Proc. ACM Web Conf., 2022, pp. 2098–2108.
[22]
X. V. Lin, R. Socher, and C. Xiong, “Multi-hop knowledge graph reasoning with reward shaping,” in Proc. Conf. Empirical Methods Natural Lang. Process., Brussels, Belgium, 2018, pp. 3243–3253.
[23]
Z. Sun, J. Yang, J. Zhang, A. Bozzon, L.-K. Huang, and C. Xu, “Recurrent knowledge graph embedding for effective recommendation,” in Proc. 12th ACM Conf. Recommender Syst., 2018, pp. 297–305.
[24]
S. Geng, Z. Fu, J. Tan, Y. Ge, G. De Melo, and Y. Zhang, “Path language modeling over knowledge graphsfor explainable recommendation,” in Proc. ACM Web Conf., 2022, pp. 946–955.
[25]
X. Wang, D. Wang, C. Xu, X. He, Y. Cao, and T.-S. Chua, “Explainable reasoning over knowledge graphs for recommendation,” in Proc. AAAI Conf. Artif. Intell., 2019, pp. 5329–5336.
[26]
Q. Zhu, X. Zhou, J. Wu, J. Tan, and L. Guo, “A knowledge-aware attentional reasoning network for recommendation,” in Proc. AAAI Conf. Artif. Intell., 2020, pp. 6999–7006.
[27]
R. T. Icarte, T. Q. Klassen, R. Valenzano, and S. A. McIlraith, “Reward machines: Exploiting reward function structure in reinforcement learning,” J. Artif. Intell. Res., vol. 73, pp. 173–208, 2022.
[28]
Y. Xian, Z. Fu, S. Muthukrishnan, G. De Melo, and Y. Zhang, “Reinforcement knowledge graph reasoning for explainable recommendation,” in Proc. 42nd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2019, pp. 285–294.
[29]
H. Wu, H. Fang, Z. Sun, C. Geng, X. Kong, and Y.-S. Ong, “A generic reinforced explainable framework with knowledge graph for session-based recommendation,” in Proc. IEEE 39th Int. Conf. Data Eng., 2023, pp. 1260–1272.
[30]
J. Tang and K. Wang, “Personalized top-N sequential recommendation via convolutional sequence embedding,” in Proc. 11th ACM Int. Conf. Web Search Data Mining, 2018, pp. 565–573.
[31]
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer, vol. 42, no. 8, pp. 30–37, 2009.
[32]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proc. 10th Int. Conf. World Wide Web, 2001, pp. 285–295.
[33]
S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme, “Factorizing personalized Markov chains for next-basket recommendation,” in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 811–820.
[34]
J. Chung, C. Gulcehre, K. Cho, and Y. Bengio, “Empirical evaluation of gated recurrent neural networks on sequence modeling,” 2014,.
[35]
W. Zaremba, I. Sutskever, and O. Vinyals, “Recurrent neural network regularization,” 2014,.
[36]
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Trans. Neural Netw., vol. 20, no. 1, pp. 61–80, Jan. 2009.
[37]
Z. Cui et al., “Reinforced KGs reasoning for explainable sequential recommendation,” World Wide Web, vol. 25, no. 2, pp. 631–654, 2022.
[38]
Y. Zhao et al., “Time-aware path reasoning on knowledge graph for recommendation,” ACM Trans. Inf. Syst., vol. 41, no. 2, pp. 1–26, 2022.
[39]
S. Jain and B. C. Wallace, “Attention is not explanation,” in Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics: Hum. Lang. Technol., Minneapolis, MN, USA, 2019, pp. 3543–3556.
[40]
C. Ma, P. Kang, and X. Liu, “Hierarchical gating networks for sequential recommendation,” in Proc. 25th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2019, pp. 825–833.
[41]
H. Hou and C. Shi, “Explainable sequential recommendation using knowledge graphs,” in Proc. 5th Int. Conf. Front. Educ. Technol., 2019, pp. 53–57.
[42]
Y. Li, H. Chen, Y. Li, L. Li, S. Y. Philip, and G. Xu, “Reinforcement learning based path exploration for sequential explainable recommendation,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 11, pp. 11801–11814, Nov. 2023.
[43]
X. Li, Y. Shen, and L. Chen, “Mcore: Multi-agent collaborative learning for knowledge-graph-enhanced recommendation,” in Proc. IEEE Int. Conf. Data Mining, 2021, pp. 330–339.
[44]
C. Stauffer and W. E. L. Grimson, “Adaptive background mixture models for real-time tracking,” in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 1999, pp. 246–252.
[45]
T. Haarnoja et al., “Soft actor-critic algorithms and applications,” 2018,.
[46]
M. M. Afsar, T. Crump, and B. Far, “Reinforcement learning based recommender systems: A survey,” ACM Comput. Surv., vol. 55, no. 7, pp. 1–38, 2022.
[47]
Q. Ai, V. Azizi, X. Chen, and Y. Zhang, “Learning heterogeneous knowledge base embeddings for explainable recommendation,” Algorithms, vol. 11, no. 9, 2018, Art. no.
[48]
R. He and J. McAuley, “Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering,” in Proc. 25th Int. Conf. World Wide Web, 2016, pp. 507–517.
[49]
H. Jiang, C. Li, J. Cai, and J. Wang, “RCENR: A reinforced and contrastive heterogeneous network reasoning model for explainable news recommendation,” in Proc. 46th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2023, pp. 1710–1720.
Index Terms
- Explainable Session-Based Recommendation via Path Reasoning
Index terms have been assigned to the content through auto-classification.
Recommendations
Reinforced Path Reasoning for Counterfactual Explainable Recommendation
Counterfactual explanations interpret the recommendation mechanism by exploring how minimal alterations on items or users affect recommendation decisions. Existing counterfactual explainable approaches face huge search space, and their explanations are ...
Long-tail Session-based Recommendation
RecSys '20: Proceedings of the 14th ACM Conference on Recommender SystemsSession-based recommendation focuses on the prediction of user actions based on anonymous sessions and is a necessary method in the lack of user historical data. However, none of the existing session-based recommendation methods explicitly takes the ...
Attention-driven Factor Model for Explainable Personalized Recommendation
SIGIR '18: The 41st International ACM SIGIR Conference on Research & Development in Information RetrievalLatent Factor Models (LFMs) based on Collaborative Filtering (CF) have been widely applied in many recommendation systems, due to their good performance of prediction accuracy. In addition to users' ratings, auxiliary information such as item features ...
Comments
Information & Contributors
Information
Published In
1041-4347 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 January 2025
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Feb 2025