Fairness-Aware Explainable Recommendation over Knowledge Graphs
There has been growing attention on fairness considerations recently, especially in the context of intelligent decision making systems. Explainable recommendation systems, in particular, may suffer from both explanation bias and performance disparity. In this paper, 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, and that their recommendations may be biased by the training records of more active users, due to the nature of collaborative filtering, which leads to an unfair treatment by the system. We propose a fairness constrained approach via heuristic re-ranking to mitigate this unfairness problem in the context of explainable recommendation over knowledge graphs. We experiment on several real-world datasets with state-of-the-art knowledge graph-based explainable recommendation algorithms. The promising results show that our algorithm is not only able to provide high-quality explainable recommendations, but also reduces the recommendation unfairness in several respects.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative FilteringDecision MakingExplainable RecommendationFairnessKnowledge GraphsRecommendation SystemsRe-RankingSimilar Papers 제목 키워드 기반
Explainable Fairness in Recommendation
Existing research on fairness-aware recommendation has mainly focused on the quantification of fairness and the development of fair recommendation models, neither of which studies a more substantial problem--identifying …
counterfactualFairnessRecommendation SystemsTime-aware Path Reasoning on Knowledge Graph for Recommendation
Reasoning on knowledge graph (KG) has been studied for explainable recommendation due to it's ability of providing explicit explanations. However, current KG-based explainable recommendation methods unfortunately ignore …
Explainable RecommendationRelation ExtractionFairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings
Sequential recommendation (SR) learns from the temporal dynamics of user-item interactions to predict the next ones. Fairness-aware recommendation mitigates a variety of algorithmic biases in the learning of user prefere…
AttributeFairnessGraph EmbeddingMulti-Task Learning+1CADRL: Category-aware Dual-agent Reinforcement Learning for Explainable Recommendations over Knowledge Graphs
Knowledge graphs (KGs) have been widely adopted to mitigate data sparsity and address cold-start issues in recommender systems. While existing KGs-based recommendation methods can predict user preferences and demands, th…
Explainable RecommendationGraph Neural NetworkKnowledge GraphsRecommendation Systems+3Category Aware Explainable Conversational Recommendation
Most conversational recommendation approaches are either not explainable, or they require external user's knowledge for explaining or their explanations cannot be applied in real time due to computational limitations. In…
Conversational Recommendation