Two-sided fairness-aware recommendation method under many-to-many relation schema

Lisheng Zhang, Bing-Liang Nie
{"title":"Two-sided fairness-aware recommendation method under many-to-many relation schema","authors":"Lisheng Zhang, Bing-Liang Nie","doi":"10.1117/12.2689461","DOIUrl":null,"url":null,"abstract":"With the widespread use of recommendation systems, researchers have gradually started to focus on fairness issues including two-sided fairness along with recommendation accuracy. However, these works often consider the relationship between the provider and the recommended items as one-to-one or one-to-many, without considering the situation that each item may have multiple related individuals on the provider side. In this paper, we implement a two-sided fair perception recommendation method based on fair allocation in a context where the relationship pattern between providers and items is many-to-many relationship. Specifically, on the one hand, the attention of all consumers is considered as the total exposure available to the provider and is fairly allocated to each provider based on the fairness criterion, and on the other hand, each exposure of each item is allocated to each relevant provider based on the fairness criterion, and the sum of the exposure obtained by each provider in all relevant items is taken as its final exposure. We conducted experiments on a real-world dataset, and the results show that the approach in this paper provides better two-sided fairness compared to the benchmark approach while maintaining good recommendation quality.","PeriodicalId":118234,"journal":{"name":"4th International Conference on Information Science, Electrical and Automation Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Conference on Information Science, Electrical and Automation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2689461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the widespread use of recommendation systems, researchers have gradually started to focus on fairness issues including two-sided fairness along with recommendation accuracy. However, these works often consider the relationship between the provider and the recommended items as one-to-one or one-to-many, without considering the situation that each item may have multiple related individuals on the provider side. In this paper, we implement a two-sided fair perception recommendation method based on fair allocation in a context where the relationship pattern between providers and items is many-to-many relationship. Specifically, on the one hand, the attention of all consumers is considered as the total exposure available to the provider and is fairly allocated to each provider based on the fairness criterion, and on the other hand, each exposure of each item is allocated to each relevant provider based on the fairness criterion, and the sum of the exposure obtained by each provider in all relevant items is taken as its final exposure. We conducted experiments on a real-world dataset, and the results show that the approach in this paper provides better two-sided fairness compared to the benchmark approach while maintaining good recommendation quality.
多对多关系模式下的双边公平感知推荐方法
随着推荐系统的广泛使用,研究者逐渐开始关注公平性问题,包括双向公平性和推荐准确性。然而,这些工作通常将提供者和推荐项目之间的关系视为一对一或一对多的关系,而没有考虑每个项目在提供者方面可能有多个相关个体的情况。在提供者和物品之间的关系模式为多对多关系的情况下,我们实现了一种基于公平分配的双边公平感知推荐方法。具体而言,一方面将所有消费者的注意力视为提供者可获得的总暴露量,并根据公平性准则公平地分配给每个提供者;另一方面,将每个项目的每个暴露量根据公平性准则分配给每个相关提供者,并将每个提供者在所有相关项目上获得的暴露量之和作为其最终暴露量。我们在真实数据集上进行了实验,结果表明,与基准方法相比,本文方法在保持良好推荐质量的同时提供了更好的双边公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信