Comparative Explanations of Recommendations
- URL: http://arxiv.org/abs/2111.00670v1
- Date: Mon, 1 Nov 2021 02:55:56 GMT
- Title: Comparative Explanations of Recommendations
- Authors: Aobo Yang, Nan Wang, Renqin Cai, Hongbo Deng, Hongning Wang
- Abstract summary: We develop an extract-and-refine architecture to explain the relative comparisons among a set of ranked items from a recommender system.
We design a new explanation quality metric based on BLEU to guide the end-to-end training of the extraction and refinement components.
- Score: 33.89230323979306
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: As recommendation is essentially a comparative (or ranking) process, a good
explanation should illustrate to users why an item is believed to be better
than another, i.e., comparative explanations about the recommended items.
Ideally, after reading the explanations, a user should reach the same ranking
of items as the system's. Unfortunately, little research attention has yet been
paid on such comparative explanations.
In this work, we develop an extract-and-refine architecture to explain the
relative comparisons among a set of ranked items from a recommender system. For
each recommended item, we first extract one sentence from its associated
reviews that best suits the desired comparison against a set of reference
items. Then this extracted sentence is further articulated with respect to the
target user through a generative model to better explain why the item is
recommended. We design a new explanation quality metric based on BLEU to guide
the end-to-end training of the extraction and refinement components, which
avoids generation of generic content. Extensive offline evaluations on two
large recommendation benchmark datasets and serious user studies against an
array of state-of-the-art explainable recommendation algorithms demonstrate the
necessity of comparative explanations and the effectiveness of our solution.
Related papers
- Path-based summary explanations for graph recommenders -- extended version [2.2789818122188925]
We propose summary explanations that highlight why a user or a group of users receive a set of item recommendations.
We also present a novel method to summarize explanations using efficient graph algorithms.
arXiv Detail & Related papers (2024-10-29T13:10:03Z) - Unlocking the Potential of Large Language Models for Explainable
Recommendations [55.29843710657637]
It remains uncertain what impact replacing the explanation generator with the recently emerging large language models (LLMs) would have.
In this study, we propose LLMXRec, a simple yet effective two-stage explainable recommendation framework.
By adopting several key fine-tuning techniques, controllable and fluent explanations can be well generated.
arXiv Detail & Related papers (2023-12-25T09:09:54Z) - Explainable Recommender with Geometric Information Bottleneck [25.703872435370585]
We propose to incorporate a geometric prior learnt from user-item interactions into a variational network.
Latent factors from an individual user-item pair can be used for both recommendation and explanation generation.
Experimental results on three e-commerce datasets show that our model significantly improves the interpretability of a variational recommender.
arXiv Detail & Related papers (2023-05-09T10:38:36Z) - Improving Recommendation Relevance by simulating User Interest [77.34726150561087]
We observe that recommendation "recency" can be straightforwardly and transparently maintained by iterative reduction of ranks of inactive items.
The basic idea behind this work is patented in a context of online recommendation systems.
arXiv Detail & Related papers (2023-02-03T03:35:28Z) - Reinforced Path Reasoning for Counterfactual Explainable Recommendation [10.36395995374108]
We propose a novel Counterfactual Explainable Recommendation (CERec) to generate item attribute-based counterfactual explanations.
We reduce the huge search space with an adaptive path sampler by using rich context information of a given knowledge graph.
arXiv Detail & Related papers (2022-07-14T05:59:58Z) - Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
We show how to return a set of items rigorously guaranteed to contain mostly good items.
Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate.
We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
arXiv Detail & Related papers (2022-07-04T17:49:25Z) - Counterfactual Explainable Recommendation [22.590877963169103]
We propose Counterfactual Explainable Recommendation (CountER), which takes the insights of counterfactual reasoning from causal inference for explainable recommendation.
CountER seeks simple (low complexity) and effective (high strength) explanations for the model decision.
Results show that our model generates more accurate and effective explanations than state-of-the-art explainable recommendation models.
arXiv Detail & Related papers (2021-08-24T06:37:57Z) - 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) - Explanation as a Defense of Recommendation [34.864709791648195]
We propose to enforce the idea of sentiment alignment between a recommendation and its corresponding explanation.
Our solution outperforms a rich set of baselines in both recommendation and explanation tasks.
arXiv Detail & Related papers (2021-01-24T06:34:36Z) - Fairness-Aware Explainable Recommendation over Knowledge Graphs [73.81994676695346]
We analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups.
We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users.
We propose a fairness constrained approach via re-ranking to mitigate this problem in the context of explainable recommendation over knowledge graphs.
arXiv Detail & Related papers (2020-06-03T05:04:38Z)
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.