ACM Home Page
Please provide us with feedback. Feedback
The information cost of manipulation-resistance in recommender systems
Full text PdfPdf (347 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the 2008 ACM conference on Recommender systems table of contents
Lausanne, Switzerland
SESSION: Recommender challenges table of contents
Pages 147-154  
Year of Publication: 2008
ISBN:978-1-60558-093-7
Authors
Paul Resnick  University of Michigan, Ann Arbor, MI, USA
Rahul Sami  University of Michigan, Ann Arbor, MI, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 212,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454008.1454033
What is a DOI?

ABSTRACT

Attackers may seek to manipulate recommender systems in order to promote or suppress certain items. Existing defenses based on analysis of ratings also discard useful information from honest raters. In this paper, we show that this is unavoidable and provide a lower bound on how much information must be discarded. We use an information-theoretic framework to exhibit a fundamental tradeoff between manipulation-resistance and optimal use of genuine ratings in recommender systems. We define a recommender system to be (n, c)-robust if an attacker with n sybil identities cannot cause more than a limited amount c units of damage to predictions. We prove that any robust recommender system must also discard Ω(log (n/c)) units of useful information from each genuine rater.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. Awerbuch and R. D. Kleinberg. Competitive collaborative learning. In 18th Annual Conference on Learning Theory (COLT 2005), volume 3559 of LNAI, pages 233--248. Springer, 2005.
 
2
3
 
4
 
5
E. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173--199, 2001.
6
7
8
9
 
10
J. O'Donovan and B. Smyth. Trust no one: Evaluating trust-based filtering for recommenders. In Proceedings of IJCAI'05, 2005.
 
11
12
 
13
A. M. Rashid, G. Karypis, and J. Riedl. Influence in ratings-based recommender systems: An algorithm-independent approach. In Proceedings of the SIAM International Conference on Data Mining, 2005.
14
15


Collaborative Colleagues:
Paul Resnick: colleagues
Rahul Sami: colleagues