FaiRIR: Mitigating Exposure Bias From Related Item Recommendations in Two-Sided Platforms

被引:2
作者
Dash, Abhisek [1 ]
Chakraborty, Abhijnan [2 ]
Ghosh, Saptarshi [1 ]
Mukherjee, Animesh [1 ]
Gummadi, Krishna P. [3 ]
机构
[1] IIT Kharagpur, Dept Comp Sci & Engn, Kharagpur 721302, W Bengal, India
[2] IIT Delhi, Dept Comp Sci & Engn, New Delhi 110016, India
[3] Max Planck Inst Software Syst, D-66123 Saarbrucken, Germany
来源
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS | 2023年 / 10卷 / 03期
基金
欧洲研究理事会;
关键词
Exposure bias; fair related item recommendation (FaiRIR); related item recommendation (RIR); two-sided platforms;
D O I
10.1109/TCSS.2022.3164655
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Related item recommendations (RIRs) are ubiquitous in most online platforms today, including e-commerce and content streaming sites. These recommendations not only help users compare items related to a given item but also play a major role in bringing traffic to individual items, thus deciding the exposure that different items receive. With a growing number of people depending on such platforms to earn their livelihood, it is important to understand whether different items are receiving their desired exposure. To this end, our experiments on multiple real-world RIR datasets reveal that the existing RIR algorithms often result in very skewed exposure distribution of items, and the quality of items is not a plausible explanation for such skew in exposure. To mitigate this exposure bias, we introduce multiple flexible interventions (fair related item recommendation (FaiRIR)] in the RIR pipeline. We instantiate these mechanisms with two well-known algorithms for constructing RIRs-rating singular value decomposition (SVD) and item2vec-and show on real-world data that our mechanisms allow for a fine-grained control on exposure distribution, often at a small or no cost in terms of recommendation quality, measured in terms of relatedness and user satisfaction.
引用
收藏
页码:1301 / 1313
页数:13
相关论文
共 51 条
  • [41] Two Decades of Recommender Systems at Amazon.com
    Smith, Brent
    Linden, Greg
    [J]. IEEE INTERNET COMPUTING, 2017, 21 (03) : 12 - 18
  • [42] Tassa T., 2019, INT J DATA SCI ANAL, V9, P1
  • [43] Womply, 2021, ONL REV IMP SMALL BU
  • [44] Xia Ning, 2011, Proceedings of the 2011 IEEE 11th International Conference on Data Mining (ICDM 2011), P497, DOI 10.1109/ICDM.2011.134
  • [45] ON DIVIDING JUSTLY
    YAARI, ME
    BARHILLEL, M
    [J]. SOCIAL CHOICE AND WELFARE, 1984, 1 (01) : 1 - 24
  • [46] Yao Sirui, 2017, NEURIPS, P2925
  • [47] Judging Similarity: A User-Centric Study of Related Item Recommendations
    Yao, Yuan
    Harper, F. Maxwell
    [J]. 12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, : 288 - 296
  • [48] Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatment
    Zafar, Muhammad Bilal
    Valera, Isabel
    Rodriguez, Manuel Gomez
    Gummadi, Krishna P.
    [J]. PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, : 1171 - 1180
  • [49] FA*IR: A Fair Top-k Ranking Algorithm
    Zehlike, Meike
    Bonchi, Francesco
    Castillo, Carlos
    Hajian, Sara
    Megahed, Mohamed
    Baeza-Yates, Ricardo
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1569 - 1578
  • [50] Zemel R., 2013, INT C MACH LEARN, P325