Manipulation Robustness of Collaborative Filtering Systems
AbstractA collaborative filtering system recommends to users products that similar users like. Collaborative filtering systems influence purchase decisions, and hence have become targets of manipulation by unscrupulous vendors. We provide theoretical and empirical results demonstrating that while common nearest neighbor algorithms, which are widely used in commercial systems, can be highly susceptible to manipulation, two classes of collaborative filtering algorithms which we refer to as linear and asymptotically linear are relatively robust. These results provide guidance for the design of future collaborative filtering systems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by NET Institute in its series Working Papers with number 09-21.
Length: 40 pages
Date of creation: Sep 2009
Date of revision: Sep 2009
Contact details of provider:
Web page: http://www.NETinst.org/
recommendation system; collaborative filtering; manipulation; information theory; statistics;
Find related papers by JEL classification:
- C11 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - Bayesian Analysis: General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-10-24 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nicholas Economides).
If references are entirely missing, you can add them using this form.