ACM Home Page
Please provide us with feedback. Feedback
Shilling recommender systems for fun and profit
Full text PdfPdf (395 KB)
Source International World Wide Web Conference archive
Proceedings of the 13th international conference on World Wide Web table of contents
New York, NY, USA
SESSION: Reputation networks table of contents
Pages: 393 - 402  
Year of Publication: 2004
ISBN:1-58113-844-X
Authors
Shyong K. Lam  University of Minnesota, Minneapolis, MN
John Riedl  University of Minnesota, Minneapolis, MN
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 202,   Citation Count: 43
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload. One application in which they have become particularly common is in e-commerce, where recommendation of items can often help a customer find what she is interested in and, therefore can help drive sales. Unscrupulous producers in the never-ending quest for market penetration may find it profitable to shill recommender systems by lying to the systems in order to have their products recommended more often than those of their competitors. This paper explores four open questions that may affect the effectiveness of such shilling attacks: which recommender algorithm is being used, whether the application is producing recommendations or predictions, how detectable the attacks are by the operator of the system, and what the properties are of the items being attacked. The questions are explored experimentally on a large data set of movie ratings. Taken together, the results of the paper suggest that new ways must be used to evaluate and detect shilling attacks on recommender systems.


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
S. E. Asch. Effects of group pressure upon the modification and distortion of judgements. Groups, Leadership, and Men, pages 177--190, 1951.
 
2
J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 43--52, July 1998.
 
3
4
5
6
 
7
 
8
9
 
10
B. J. Jansen and A. Spink. An analysis of web documents retrieved and viewed. In Internet Computing Conference, Las Vegas, 2003.
 
11
B. Miller, J. Riedl, and J. Konstan. GroupLens for Usenet: Experiences in applying collaborative filtering to a social information system. In C. Leug and D. Fisher, editors, From Usenet to CoWebs: Interacting with Social Information Spaces. Springer-Verlag, 2002.
 
12
 
13
C. Nass and Y. Moon. Machines and mindlessness: Social responses to computers. Journal of Social Issues, pages 81--103, 2000.
14
 
15
16
 
17
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system -- a case study. In ACM WebKDD 2000 Web Mining for E-Commerce Workshop, 2000.
18
 
19
 
20
 
21
L. von Ahn, M. Blum, N. Hopper, and J. Langford. CAPTCHA: Using hard AI problems for security. In Proceedings of Eurocrypt, 2003, 2003.

CITED BY  43

Collaborative Colleagues:
Shyong K. Lam: colleagues
John Riedl: colleagues