Detecting Sponsored Recommendations

Subhashini Krishnasamy, Rajat Sen, S. Shakkottai, Sewoong Oh
{"title":"Detecting Sponsored Recommendations","authors":"Subhashini Krishnasamy, Rajat Sen, S. Shakkottai, Sewoong Oh","doi":"10.1145/2988543","DOIUrl":null,"url":null,"abstract":"With the vast number of items, Web pages, and news from which to choose, online services and customers both benefit tremendously from personalized recommender systems. Such systems additionally provide great opportunities for targeted advertisements by displaying ads alongside genuine recommendations. We consider a biased recommendation system in which such ads are displayed without any tags (disguised as genuine recommendations), rendering them indistinguishable to a single user. We ask whether it is possible for a small subset of collaborating users to detect such bias. We propose an algorithm that can detect this type of bias through statistical analysis on the collaborating users’ feedback. The algorithm requires only binary information indicating whether a user was satisfied with each of the recommended item or not. This makes the algorithm widely appealing to real-world issues such as identification of search engine bias and pharmaceutical lobbying. We prove that the proposed algorithm detects the bias with high probability for a broad class of recommendation systems when a sufficient number of users provides feedback on a sufficient number of recommendations. We provide extensive simulations with real datasets and practical recommender systems, which confirm the trade-offs in the theoretical guarantees.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2988543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

With the vast number of items, Web pages, and news from which to choose, online services and customers both benefit tremendously from personalized recommender systems. Such systems additionally provide great opportunities for targeted advertisements by displaying ads alongside genuine recommendations. We consider a biased recommendation system in which such ads are displayed without any tags (disguised as genuine recommendations), rendering them indistinguishable to a single user. We ask whether it is possible for a small subset of collaborating users to detect such bias. We propose an algorithm that can detect this type of bias through statistical analysis on the collaborating users’ feedback. The algorithm requires only binary information indicating whether a user was satisfied with each of the recommended item or not. This makes the algorithm widely appealing to real-world issues such as identification of search engine bias and pharmaceutical lobbying. We prove that the proposed algorithm detects the bias with high probability for a broad class of recommendation systems when a sufficient number of users provides feedback on a sufficient number of recommendations. We provide extensive simulations with real datasets and practical recommender systems, which confirm the trade-offs in the theoretical guarantees.
检测赞助推荐
由于有大量的商品、网页和新闻可供选择,在线服务和客户都从个性化推荐系统中受益匪浅。这样的系统还通过在真正的推荐旁边显示广告,为定向广告提供了很大的机会。我们考虑一个有偏见的推荐系统,在这个系统中,这样的广告没有任何标签(伪装成真正的推荐),使得单个用户无法区分它们。我们想知道一小部分合作用户是否有可能检测到这种偏见。我们提出了一种算法,可以通过对协作用户反馈的统计分析来检测这种类型的偏见。该算法只需要二进制信息,表明用户是否对每个推荐项目满意。这使得该算法广泛适用于现实世界的问题,如识别搜索引擎偏见和制药游说。我们证明,当足够数量的用户对足够数量的推荐提供反馈时,所提出的算法可以高概率地检测到广泛类别的推荐系统的偏见。我们用真实的数据集和实用的推荐系统进行了广泛的模拟,证实了理论保证中的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书