Towards Explainable Collaborative Filtering with Taste Clusters Learning
Not on the map. Why?
Abstract (arXiv)
Collaborative Filtering (CF) is a widely used and effective technique for recommender systems. In recent decades, there have been significant advancements in latent embedding-based CF methods for improved accuracy, such as matrix factorization, neural collaborative filtering, and LightGCN. However, the explainability of these models has not been fully explored. Adding explainability to recommendation models can not only increase trust in the decisionmaking process, but also have multiple benefits such as providing persuasive explanations for item recommendations, creating explicit profiles for users and items, and assisting item producers in design improvements. In this paper, we propose a neat and effective Explainable Collaborative Filtering (ECF) model that leverages interpretable cluster learning to achieve the two most demanding objectives: (1) Precise - the model should not compromise accuracy in the pursuit of explainability; and (2) Self-explainable - the model's explanations should truly reflect its decision-making process, not generated from post-hoc methods. The core of ECF is mining taste clusters from user-item interactions and item profiles.We map each user and item to a sparse set of taste clusters, and taste clusters are distinguished by a few representative tags. The user-item preference, users/items' cluster affiliations, and the generation of taste clusters are jointly optimized in an end-to-end manner. Additionally, we introduce a forest mechanism to ensure the model's accuracy, explainability, and diversity. To comprehensively evaluate the explainability quality of taste clusters, we design several quantitative metrics, including in-cluster item coverage, tag utilization, silhouette, and informativeness. Our model's effectiveness is demonstrated through extensive experiments on three real-world datasets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 43 references that are in the map. First posted on arXiv 27 Apr 2023.
Builds on
15 of 43 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2017Neural Collaborative Filteringcited by 1,111
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2018Explainable Recommendation: A Survey and New Perspectivescited by 210
- 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
- 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
- 2018Improving Question Answering by Commonsense-Based Pre-Trainingcited by 66
- 2018Explainable Recommendation via Multi-Task Learning in Opinionated Text Datacited by 40
- 2018Aspect-Aware Latent Factor Model: Rating Prediction with Ratings and Reviewscited by 19
- 2022HAKG: Hierarchy-Aware Knowledge Gated Network for Recommendationcited by 16
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.