Towards Explainable Collaborative Filtering with Taste Clusters Learning

• URL: http://arxiv.org/abs/2304.13937v1
• Date: Thu, 27 Apr 2023 03:08:15 GMT
• Title: Towards Explainable Collaborative Filtering with Taste Clusters Learning
• Authors: Yuntao Du, Jianxun Lian, Jing Yao, Xiting Wang, Mingqi Wu, Lu Chen, Yunjun Gao, Xing Xie
• Abstract summary: Collaborative Filtering (CF) is a widely used and effective technique for recommender systems. Adding explainability to recommendation models can not only increase trust in the decisionmaking process, but also have multiple benefits. We propose a neat and effective Explainable Collaborative Filtering (ECF) model that leverages interpretable cluster learning.
• Score: 43.4512681951459
• License: http://creativecommons.org/licenses/by/4.0/
• 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 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.

Related papers

• When factorization meets argumentation: towards argumentative explanations [0.0]
  We propose a novel model that combines factorization-based methods with argumentation frameworks (AFs) Our framework seamlessly incorporates side information, such as user contexts, leading to more accurate predictions.
  arXiv  Detail & Related papers  (2024-05-13T19:16:28Z)
• Faithful Explanations of Black-box NLP Models Using LLM-generated Counterfactuals [67.64770842323966]
  Causal explanations of predictions of NLP systems are essential to ensure safety and establish trust. Existing methods often fall short of explaining model predictions effectively or efficiently. We propose two approaches for counterfactual (CF) approximation.
  arXiv  Detail & Related papers  (2023-10-01T07:31:04Z)
• Preference or Intent? Double Disentangled Collaborative Filtering [34.63377358888368]
  In traditional collaborative filtering approaches, both intent and preference factors are usually entangled in the modeling process. We propose a two-fold representation learning approach, namely Double Disentangled Collaborative Filtering (DDCF), for personalized recommendations.
  arXiv  Detail & Related papers  (2023-05-18T16:13:41Z)
• MACE: An Efficient Model-Agnostic Framework for Counterfactual Explanation [132.77005365032468]
  We propose a novel framework of Model-Agnostic Counterfactual Explanation (MACE) In our MACE approach, we propose a novel RL-based method for finding good counterfactual examples and a gradient-less descent method for improving proximity. Experiments on public datasets validate the effectiveness with better validity, sparsity and proximity.
  arXiv  Detail & Related papers  (2022-05-31T04:57:06Z)
• Inducing Semantic Grouping of Latent Concepts for Explanations: An Ante-Hoc Approach [18.170504027784183]
  We show that by exploiting latent and properly modifying different parts of the model can result better explanation as well as provide superior predictive performance. We also proposed a technique of using two different self-supervision techniques to extract meaningful concepts related to the type of self-supervision considered.
  arXiv  Detail & Related papers  (2021-08-25T07:09:57Z)
• SelfCF: A Simple Framework for Self-supervised Collaborative Filtering [72.68215241599509]
  Collaborative filtering (CF) is widely used to learn informative latent representations of users and items from observed interactions. We propose a self-supervised collaborative filtering framework (SelfCF) that is specially designed for recommender scenario with implicit feedback. We show that SelfCF can boost up the accuracy by up to 17.79% on average, compared with a self-supervised framework BUIR.
  arXiv  Detail & Related papers  (2021-07-07T05:21:12Z)
• Efficient Data-specific Model Search for Collaborative Filtering [56.60519991956558]
  Collaborative filtering (CF) is a fundamental approach for recommender systems. In this paper, motivated by the recent advances in automated machine learning (AutoML), we propose to design a data-specific CF model. Key here is a new framework that unifies state-of-the-art (SOTA) CF methods and splits them into disjoint stages of input encoding, embedding function, interaction and prediction function.
  arXiv  Detail & Related papers  (2021-06-14T14:30:32Z)
• Represent Items by Items: An Enhanced Representation of the Target Item for Recommendation [37.28220632871373]
  Item-based collaborative filtering (ICF) has been widely used in industrial applications such as recommender system and online advertising. Recent models use methods such as attention mechanism and deep neural network to learn the user representation and scoring function more accurately. We propose an enhanced representation of the target item which distills relevant information from the co-occurrence items.
  arXiv  Detail & Related papers  (2021-04-26T11:28:28Z)
• BCFNet: A Balanced Collaborative Filtering Network with Attention Mechanism [106.43103176833371]
  Collaborative Filtering (CF) based recommendation methods have been widely studied. We propose a novel recommendation model named Balanced Collaborative Filtering Network (BCFNet) In addition, an attention mechanism is designed to better capture the hidden information within implicit feedback and strengthen the learning ability of the neural network.
  arXiv  Detail & Related papers  (2021-03-10T14:59:23Z)
• Dual-embedding based Neural Collaborative Filtering for Recommender Systems [0.7949579654743338]
  We propose a general collaborative filtering framework named DNCF, short for Dual-embedding based Neural Collaborative Filtering. In addition to learning the primitive embedding for a user (an item), we introduce an additional embedding from the perspective of the interacted items (users) to augment the user (item) representation.
  arXiv  Detail & Related papers  (2021-02-04T11:32:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.