pith. sign in

arxiv: 1809.02921 · v2 · pith:O6G2V3IZnew · submitted 2018-09-09 · 💻 cs.IR

Personalizing Fairness-aware Re-ranking

classification 💻 cs.IR
keywords fairnessprovidersre-rankingaccuracyalgorithmfairfairness-awarepersonalized
0
0 comments X
read the original abstract

Personalized recommendation brings about novel challenges in ensuring fairness, especially in scenarios in which users are not the only stakeholders involved in the recommender system. For example, the system may want to ensure that items from different providers have a fair chance of being recommended. To solve this problem, we propose a Fairness-Aware Re-ranking algorithm (FAR) to balance the ranking quality and provider-side fairness. We iteratively generate the ranking list by trading off between accuracy and the coverage of the providers. Although fair treatment of providers is desirable, users may differ in their receptivity to the addition of this type of diversity. Therefore, personalized user tolerance towards provider diversification is incorporated. Experiments are conducted on both synthetic and real-world data. The results show that our proposed re-ranking algorithm can significantly promote fairness with a slight sacrifice in accuracy and can do so while being attentive to individual user differences.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Reducing Popularity Bias in Recommendation Over Time

    cs.IR 2019-06 unverdicted novelty 5.0

    A temporal version of xQuAD improves long-tail coverage and accuracy tradeoff in recommender systems on two public datasets compared to existing approaches.