Explainable Recommendations via Attentive Multi-Persona Collaborative
Filtering
- URL: http://arxiv.org/abs/2010.07042v1
- Date: Sat, 26 Sep 2020 11:52:57 GMT
- Title: Explainable Recommendations via Attentive Multi-Persona Collaborative
Filtering
- Abstract summary: Two main challenges in recommender systems are modeling users with heterogeneous taste, and providing explainable recommendations.
We propose the neural Attentive Multi-Persona Collaborative Filtering model as a unified solution for both problems.
- Score: 23.568264786920793
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Two main challenges in recommender systems are modeling users with
heterogeneous taste, and providing explainable recommendations. In this paper,
we propose the neural Attentive Multi-Persona Collaborative Filtering (AMP-CF)
model as a unified solution for both problems. AMP-CF breaks down the user to
several latent 'personas' (profiles) that identify and discern the different
tastes and inclinations of the user. Then, the revealed personas are used to
generate and explain the final recommendation list for the user. AMP-CF models
users as an attentive mixture of personas, enabling a dynamic user
representation that changes based on the item under consideration. We
demonstrate AMP-CF on five collaborative filtering datasets from the domains of
movies, music, video games and social networks. As an additional contribution,
we propose a novel evaluation scheme for comparing the different items in a
recommendation list based on the distance from the underlying distribution of
"tastes" in the user's historical items. Experimental results show that AMP-CF
is competitive with other state-of-the-art models. Finally, we provide
qualitative results to showcase the ability of AMP-CF to explain its
recommendations.
Related papers
- A Counterfactual Approach for Addressing Individual User Unfairness in Collaborative Recommender System [5.575728923132091]
Collaborative filtering (CF) is a widely used variant of RSs which learns hidden patterns from user-item interactions for recommending items to users.<n>Recommendations provided by the traditional CF models are often biased.<n>This paper proposes a dual-step approach which identifies and mitigates individual user unfairness in recommendations.
arXiv Detail & Related papers (2026-02-24T15:08:12Z) - Tree of Preferences for Diversified Recommendation [54.183647833064136]
We study diversified recommendation from a data-bias perspective.<n>Inspired by the outstanding performance of large language models (LLMs) in zero-shot inference leveraging world knowledge, we propose a novel approach.
arXiv Detail & Related papers (2025-12-24T04:13:17Z) - Search-Based Interaction For Conversation Recommendation via Generative Reward Model Based Simulated User [117.82681846559909]
Conversational recommendation systems (CRSs) use multi-turn interaction to capture user preferences and provide personalized recommendations.
We propose a generative reward model based simulated user, named GRSU, for automatic interaction with CRSs.
arXiv Detail & Related papers (2025-04-29T06:37:30Z) - ComPO: Community Preferences for Language Model Personalization [122.54846260663922]
ComPO is a method to personalize preference optimization in language models.
We collect and release ComPRed, a question answering dataset with community-level preferences from Reddit.
arXiv Detail & Related papers (2024-10-21T14:02:40Z) - Multi-Cause Deconfounding for Recommender Systems with Latent Confounders [20.559573838679853]
latent confounding factors can affect user behavior, item exposure, and feedback in distinct ways.
Existing methods fail to account for latent confounders between users and their feedback.
We propose a multi-cause deconfounding method for recommender systems with latent confounders.
arXiv Detail & Related papers (2024-10-16T08:37:39Z) - GaVaMoE: Gaussian-Variational Gated Mixture of Experts for Explainable Recommendation [55.769720670731516]
GaVaMoE is a novel framework for explainable recommendation.
It generates tailored explanations for specific user types and preferences.
It exhibits robust performance in scenarios with sparse user-item interactions.
arXiv Detail & Related papers (2024-10-15T17:59:30Z) - MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation [63.27390451208503]
Cross-domain Recommendation systems leverage multi-domain user interactions to improve performance.
We propose the Multi-view Disentangled and Adaptive Preference Learning framework.
Our framework uses a multiview encoder to capture diverse user preferences.
arXiv Detail & Related papers (2024-10-08T10:06:45Z) - DifFaiRec: Generative Fair Recommender with Conditional Diffusion Model [22.653890395053207]
We propose a novel recommendation algorithm named Diffusion-based Fair Recommender (DifFaiRec) to provide fair recommendations.
DifFaiRec is built upon the conditional diffusion model and hence has a strong ability to learn the distribution of user preferences from their ratings on items.
To guarantee fairness, we design a counterfactual module to reduce the model sensitivity to protected attributes and provide mathematical explanations.
arXiv Detail & Related papers (2024-09-18T07:39:33Z) - Towards Explainable Collaborative Filtering with Taste Clusters Learning [43.4512681951459]
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.
arXiv Detail & Related papers (2023-04-27T03:08:15Z) - 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) - Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback
based Recommendation [59.183016033308014]
In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation.
Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
arXiv Detail & Related papers (2021-05-16T08:06:22Z) - 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) - Attentive Autoencoders for Multifaceted Preference Learning in One-class
Collaborative Filtering [23.056754242935824]
Attentive Multi-modal AutoRec tracks user preferences with multi-modal latent representations.
We show that AMA is competitive with state-of-the-art models under the OC-CF setting.
arXiv Detail & Related papers (2020-10-24T06:35:44Z) - Sequential Recommendation with Self-Attentive Multi-Adversarial Network [101.25533520688654]
We present a Multi-Factor Generative Adversarial Network (MFGAN) for explicitly modeling the effect of context information on sequential recommendation.
Our framework is flexible to incorporate multiple kinds of factor information, and is able to trace how each factor contributes to the recommendation decision over time.
arXiv Detail & Related papers (2020-05-21T12:28:59Z)
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.