Equality of Voice: Towards Fair Representation in Crowdsourced Top-K Recommendations

被引:27
作者
Chakraborty, Abhijnan [1 ,2 ]
Patro, Gourab K. [2 ]
Ganguly, Niloy [2 ]
Gummadi, Krishna P. [1 ]
Loiseau, Patrick [3 ,4 ]
机构
[1] MPI Software Syst, Saarbrucken, Germany
[2] IIT Kharagpur, Kharagpur, W Bengal, India
[3] Univ Grenoble Alpes, INRIA, CNRS, Grenoble INP,LIG, St Martin Dheres, France
[4] Univ Grenoble Alpes, INRIA, CNRS, Grenoble INP,MPI SWS, St Martin Dheres, France
来源
FAT*'19: PROCEEDINGS OF THE 2019 CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY | 2019年
基金
欧洲研究理事会;
关键词
Top-K Recommendation; Fair Representation; Twitter Trends; Most Popular News; Fairness in Recommendation;
D O I
10.1145/3287560.3287570
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories), which rely on crowd-sourced popularity signals to select the items. However, diferent sections of a crowd may have diferent preferences, and there is a large silent majority who do not explicitly express their opinion. Also, the crowd often consists of actors like bots, spammers, or people running orchestrated campaigns. Recommendation algorithms today largely do not consider such nuances, hence are vulnerable to strategic manipulation by small but hyper-active user groups. To fairly aggregate the preferences of all users while recommending top-K items, we borrow ideas from prior research on social choice theory, and identify a voting mechanism called Single Transferable Vote (STV) as having many of the fairness properties we desire in top-K item (s) elections. We develop an innovative mechanism to attribute preferences of silent majority which also make STV completely operational. We show the generalizability of our approach by implementing it on two diferent real-world datasets. Through extensive experimentation and comparison with state-of-the-art techniques, we show that our proposed approach provides maximum user satisfaction, and cuts down drastically on items disliked by most but hyper-actively promoted by a few users.
引用
收藏
页码:129 / 138
页数:10
相关论文
共 44 条
[1]  
Arrow Kenneth J, 1950, J POLITICAL EC, V58, P4
[2]  
Baeza-Yates R., 2016, WEBSCIENCE
[3]  
Baker Paul, 2013, CRITICAL DISCOURSE S, V10, P2
[4]  
Bartholdi John J, 1991, SOC CHOICE WELFARE, V8, P4
[5]  
Bhattacharya Parantapa, 2014, ACM RECSYS
[6]  
Burke R., 2017, arXiv preprint arXiv:1707.00093
[7]  
Chakraborty A., 2017, P 11 INT AAAI C WEB
[8]  
Chakraborty A., 2015, COMP JOURN S
[9]  
Chakraborty Abhijnan, 2017, FAIR SHARING FOR SHA
[10]   Item-based top-N recommendation algorithms [J].
Deshpande, M ;
Karypis, G .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) :143-177