4.7 Article

Detecting shilling groups in online recommender systems based on graph convolutional network

Journal

INFORMATION PROCESSING & MANAGEMENT
Volume 59, Issue 5, Pages -

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.ipm.2022.103031

Keywords

Recommender systems; Group shilling attacks; Graph convolutional network; Target item identification

Funding

  1. National Natural Science Foundation of China [61772452, 62072393]

Ask authors/readers for more resources

Online recommender systems are prone to group shilling attacks, where attackers collaborate to inject fake profiles to manipulate recommendations. Existing detection methods suffer from the limitations of generating candidate groups and relying on manual feature engineering. To overcome these limitations, a shilling group detection method based on graph convolutional network is proposed, which achieves high accuracy and performance on Netflix and Amazon datasets.
Online recommender systems have been shown to be vulnerable to group shilling attacks in which attackers of a shilling group collaboratively inject fake profiles with the aim of increasing or decreasing the frequency that particular items are recommended. Existing detection methods mainly use the frequent itemset (dense subgraph) mining or clustering method to generate candidate groups and then utilize the hand-crafted features to identify shilling groups. However, such two-stage detection methods have two limitations. On the one hand, due to the sensitivity of support threshold or clustering parameters setting, it is difficult to guarantee the quality of candidate groups generated. On the other hand, they all rely on manual feature engineering to extract detection features, which is costly and time-consuming. To address these two limitations, we present a shilling group detection method based on graph convolutional network. First, we model the given dataset as a graph by treating users as nodes and co-rating relations between users as edges. By assigning edge weights and filtering normal user relations, we obtain the suspicious user relation graph. Second, we use principal component analysis to refine the rating features of users and obtain the user feature matrix. Third, we design a three-layer graph con-volutional network model with a neighbor filtering mechanism and perform user classification by combining both structure and rating features of users. Finally, we detect shilling groups through identifying target items rated by the attackers according to the user classification results. Extensive experiments show that the classification accuracy and detection performance (F1 -measure) of the proposed method can reach 98.92% and 99.92% on the Netflix dataset and 93.18% and 92.41% on the Amazon dataset.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available