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.