Review of explainable graph-based recommender systems

Markchom, T. ORCID: https://orcid.org/0000-0002-2685-0738, Liang, H. and Ferryman, J. (2025) Review of explainable graph-based recommender systems. ACM Computing Surveys. ISSN 1557-7341 (In Press)

Abstract/Summary

Explainability of recommender systems has become essential to ensure users’ trust and satisfaction. Various types of explainable recommender systems have been proposed, including explainable graph-based recommender systems. This review paper discusses state-of-the-art approaches of these systems and categorizes them based on three aspects: learning methods, explaining methods, and explanation types. It also explores the commonly used datasets, explainability evaluation methods, and future directions of this research area. Compared with the existing review papers, this paper focuses on explainability based on graphs and covers the topics required for developing novel explainable graph-based recommender systems.

Item Type	Article
URI	https://centaur.reading.ac.uk/id/eprint/125193
Refereed	Yes
Divisions	Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Publisher	ACM
Download/View statistics	View download statistics for this item