Review of explainable graph-based recommender systems

Full text not archived in this repository.

Please see our End User Agreement.

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

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

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 0360-0300 (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://reading-pure-test.eprints-hosting.org/id/eprint/125193
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Central Services
Download/View statistics View download statistics for this item

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