ACM Home Page
Please provide us with feedback. Feedback
Attack detection in time series for recommender systems
Full text PdfPdf (747 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Philadelphia, PA, USA
POSTER SESSION: Research track posters table of contents
Pages: 809 - 814  
Year of Publication: 2006
ISBN:1-59593-339-5
Authors
Sheng Zhang  Dartmouth College
Amit Chakrabarti  Dartmouth College
James Ford  Dartmouth College
Fillia Makedon  Dartmouth College
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 116,   Citation Count: 1
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/1150402.1150508
What is a DOI?

ABSTRACT

Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recommendations, have been shown to be effective against collaborative filtering algorithms. We postulate that the distribution of item ratings in time can reveal the presence of a wide range of shilling attacks given reasonable assumptions about their duration. To construct a time series of ratings for an item, we use a window size of k to group consecutive ratings for the item into disjoint windows and compute the sample average and sample entropy in each window. We derive a theoretically optimal window size to best detect an attack event if the number of attack profiles is known. For practical applications where this number is unknown, we propose a heuristic algorithm that adaptively changes the window size. Our experimental results demonstrate that monitoring rating distributions in time series is an effective approach for detecting shilling attacks.


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
 
2
G. Basarin. On a statistical estimate for the entropy of a sequence of independent random variables. Theory of Probability and Its Applications, 4(3):333--336, 1959.
 
3
P. J. Brockwell and R. A. Davis. Introduction to Time Series and Forecasting. Springer, 2nd edition, 2002.
 
4
 
5
6
 
7
8
9
 
10
B. Mobasher, R. Burke, C. Williams, and R. Bhaumik. Analysis and detection of segment-focused attacks against collaborative recommendation. In Proceedings of the 2005 WebKDD Workshop (Lecture Notes in Computer Science), 2006.
11
 
12
L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004.
13


Collaborative Colleagues:
Sheng Zhang: colleagues
Amit Chakrabarti: colleagues
James Ford: colleagues
Fillia Makedon: colleagues