scholarly journals Ready for Emerging Threats to Recommender Systems? A Graph Convolution-based Generative Shilling Attack

Author(s):  
Fan Wu ◽  
Min Gao ◽  
Junliang Yu ◽  
Zongwei Wang ◽  
Kecheng Liu ◽  
...  
2016 ◽  
Vol E99.D (10) ◽  
pp. 2600-2611 ◽  
Author(s):  
Wentao LI ◽  
Min GAO ◽  
Hua LI ◽  
Jun ZENG ◽  
Qingyu XIONG ◽  
...  

Author(s):  
Li Yang ◽  
Xinxin Niu

AbstractShilling attacks have been a significant vulnerability of collaborative filtering (CF) recommender systems, and trust in CF recommender algorithms has been proven to be helpful for improving the accuracy of system recommendations. As a few studies have been devoted to trust in this area, we explore the benefits of using trust to resist shilling attacks. Rather than simply using user-generated trust values, we propose the genre trust degree, which differ in terms of the genres of items and take both trust value and user credibility into consideration. This paper introduces different types of shilling attack methods in an attempt to study the impact of users’ trust values and behavior features on defending against shilling attacks. Meanwhile, it improves the approach used to calculate user similarities to form a recommendation model based on genre trust degrees. The performance of the genre trust-based recommender system is evaluated on the Ciao dataset. Experimental results demonstrated the superior and comparable genre trust degrees recommended for defending against different types of shilling attacks.


PLoS ONE ◽  
2018 ◽  
Vol 13 (5) ◽  
pp. e0196533 ◽  
Author(s):  
Wei Zhou ◽  
Junhao Wen ◽  
Qiang Qu ◽  
Jun Zeng ◽  
Tian Cheng

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Wei Zhou ◽  
Junhao Wen ◽  
Min Gao ◽  
Haijun Ren ◽  
Peng Li

Collaborative filtering (CF) recommenders are vulnerable to shilling attacks designed to affect predictions because of financial reasons. Previous work related to robustness of recommender systems has focused on detecting profiles. Most approaches focus on profile classification but ignore the group attributes among shilling attack profiles. Attack profiles are injected in a short period in order to push or nuke a specific target item. In this paper, we propose a method for detecting suspicious ratings by constructing a time series. We reorganize all ratings on each item sorted by time series. Each time series is examined and suspected rating segments are checked. Then we use techniques we have studied in previous study to detect shilling attacks in these anomaly rating segments using statistical metrics and target item analysis. We show in experiments that our proposed method can be effective and less time consuming at detecting items under attacks in big datasets.


2021 ◽  
pp. 1-23
Author(s):  
Fabio Aiolli ◽  
Mauro Conti ◽  
Stjepan Picek ◽  
Mirko Polato

Nowadays, online services, like e-commerce or streaming services, provide a personalized user experience through recommender systems. Recommender systems are built upon a vast amount of data about users/items acquired by the services. Such knowledge represents an invaluable resource. However, commonly, part of this knowledge is public and can be easily accessed via the Internet. Unfortunately, that same knowledge can be leveraged by competitors or malicious users. The literature offers a large number of works concerning attacks on recommender systems, but most of them assume that the attacker can easily access the full rating matrix. In practice, this is never the case. The only way to access the rating matrix is by gathering the ratings (e.g., reviews) by crawling the service’s website. Crawling a website has a cost in terms of time and resources. What is more, the targeted website can employ defensive measures to detect automatic scraping. In this paper, we assess the impact of a series of attacks on recommender systems. Our analysis aims to set up the most realistic scenarios considering both the possibilities and the potential attacker’s limitations. In particular, we assess the impact of different crawling approaches when attacking a recommendation service. From the collected information, we mount various profile injection attacks. We measure the value of the collected knowledge through the identification of the most similar user/item. Our empirical results show that while crawling can indeed bring knowledge to the attacker (up to 65% of neighborhood reconstruction on a mid-size dataset and up to 90% on a small-size dataset), this will not be enough to mount a successful shilling attack in practice.


Sign in / Sign up

Export Citation Format

Share Document