Towards Explainable Collaborative Filtering with Taste Clusters Learning
Yuntao Du, Jianxun Lian, Jing Yao, Xiting Wang, Mingqi Wu, Lu Chen, Yunjun Gao, Xing Xie
Abstract
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 decision-making 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext efde9945-6fc3-40a4-be74-3f8f10ef3acdBuilds on3
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Path Language Modeling over Knowledge Graphsfor Explainable RecommendationShijie Geng, Zuohui Fu, Juntao Tan, Yingqiang Ge et al.WWW 2022 · 91 citations
- HAKG: Hierarchy-Aware Knowledge Gated Network for RecommendationYuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng et al.SIGIR 2022 · 52 citations
Related papers
- Neuro-Symbolic Interpretable Collaborative Filtering for Attribute-based RecommendationWei Zhang, Junbing Yan, Zhuo Wang, Jianyong WangWWW 2022 · 36 citations
- Unsupervised Extractive Summarization-Based Representations for Accurate and Explainable Collaborative FilteringReinald Adrian Pugoy, Hung-Yu KaoACL 2021
- Enhanced Graph Learning for Collaborative Filtering via Mutual Information MaximizationYonghui Yang, Le Wu, Richang Hong, Kun Zhang et al.SIGIR 2021 · 112 citations
- G-Refer: Graph Retrieval-Augmented Large Language Model for Explainable RecommendationYuhan Li, Xinni Zhang, Linhao Luo, Heng Chang et al.WWW 2025 · 46 citations
- Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative FilteringYu Zhang, Yiwen Zhang, Yi Zhang, Lei Sang et al.SIGIR 2025 · 19 citations
