Detection of Shilling Attack Based on T-distribution on the Dynamic Time Intervals in Recommendation Systems

With the development of information technology and the Internet, recommendation systems have become an important means to solve the problem of information overload. However, recommendation system is greatly fragile as it relies heavily on behavior data of users, which makes it very easy for a host of malicious merchants to inject shilling attacks in order to manipulate the recommendation results. Some papers on shilling attack have proposed the detection methods, whether based on false user profiles or abnormal items, but their detection rate, false alarm rate, universality, and time overhead need to be further improved. In this paper, we propose a new item anomaly detection method, through T-distribution technology based on Dynamic Time Intervals. First of all, based on the characteristics of shilling attack quickness (Attackers inject a large number of fake profiles in a short period in order to save costs), we use dynamic time interval method to divide the rating history of item into multiple time windows. Then, we use the T-distribution to detect the exception windows. By conducting extensive experiments on a dataset that accords with real-life situations and comparing it to currently outstanding methods, our proposed approach has a higher detection rate, lower false alarm rate and smaller time overhead to the different attack models and filler sizes.

[1]  Bamshad Mobasher,et al.  Detecting Profile Injection Attacks in Collaborative Recommender Systems , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[2]  Jae Kyeong Kim,et al.  A literature review and classification of recommender systems research , 2012, Expert Syst. Appl..

[3]  Neil J. Hurley,et al.  Recommender Systems: Attack Types and Strategies , 2005, AAAI.

[4]  Zunping Cheng,et al.  Effective diverse and obfuscated attacks on model-based recommender systems , 2009, RecSys '09.

[5]  Fillia Makedon,et al.  Attack detection in time series for recommender systems , 2006, KDD '06.

[6]  Thomas Hofmann,et al.  Lies and propaganda: detecting spam users in collaborative filtering , 2007, IUI '07.

[7]  John Riedl,et al.  Shilling recommender systems for fun and profit , 2004, WWW '04.

[8]  Bamshad Mobasher,et al.  Defending recommender systems: detection of profile injection attacks , 2007, Service Oriented Computing and Applications.

[9]  Bhaskar Mehta,et al.  Unsupervised strategies for shilling detection and robust collaborative filtering , 2009, User Modeling and User-Adapted Interaction.

[10]  Bamshad Mobasher,et al.  Classification features for attack detection in collaborative recommender systems , 2006, KDD '06.

[11]  Junhao Wen,et al.  Item Anomaly Detection Based on Dynamic Partition for Time Series in Recommender Systems , 2015, PloS one.

[12]  Quan Yuan,et al.  Detection of Abnormal Item Based on Time Intervals for Recommender Systems , 2014, TheScientificWorldJournal.

[13]  Yi-Cheng Zhang,et al.  Solving the apparent diversity-accuracy dilemma of recommender systems , 2008, Proceedings of the National Academy of Sciences.

[14]  Jie Cao,et al.  Semi-SAD: applying semi-supervised learning to shilling attack detection , 2011, RecSys '11.

[15]  Neil J. Hurley,et al.  Collaborative recommendation: A robustness analysis , 2004, TOIT.

[16]  Emil Grosswald,et al.  The student t-distribution of any degree of freedom is infinitely divisible , 1976 .

[17]  Padraig Cunningham,et al.  Unsupervised retrieval of attack profiles in collaborative recommender systems , 2008, RecSys '08.