Accessibility navigation


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)

[thumbnail of acm_cs_review_centaur.pdf] Text - Accepted Version
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.

933kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

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
Refereed:Yes
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:125193
Publisher:ACM

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation