Detecting Group Shilling Attacks in Online Recommender Systems Based on Bisecting K-Means Clustering

被引:18
|
作者
Zhang, Fuzhi [1 ,2 ]
Wang, Shilei [1 ,2 ]
机构
[1] Yanshan Univ, Sch Informat Sci & Engn, Qinhuangdao 066000, Hebei, Peoples R China
[2] Key Lab Comp Virtual Technol & Syst Integrat Hebe, Qinhuangdao 066000, Hebei, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
Recommender systems; Feature extraction; Clustering algorithms; Principal component analysis; Target tracking; Support vector machines; Bisecting K-means clustering; group shilling attack detection; group shilling attacks; recommender systems;
D O I
10.1109/TCSS.2020.3013878
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Existing shilling attack detection approaches focus mainly on identifying individual attackers in online recommender systems and rarely address the detection of group shilling attacks in which a group of attackers colludes to bias the output of an online recommender system by injecting fake profiles. In this article, we propose a group shilling attack detection method based on the bisecting K-means clustering algorithm. First, we extract the rating track of each item and divide the rating tracks to generate candidate groups according to a fixed time interval. Second, we propose item attention degree and user activity to calculate the suspicious degrees of candidate groups. Finally, we employ the bisecting K-means algorithm to cluster the candidate groups according to their suspicious degrees and obtain the attack groups. The results of experiments on the Netflix and Amazon data sets indicate that the proposed method outperforms the baseline methods.
引用
收藏
页码:1189 / 1199
页数:11
相关论文
共 50 条
  • [41] Robust Algorithms for Online k-means Clustering
    Bhaskara, Aditya
    Ruwanpathirana, Aravinda Kanchana
    [J]. ALGORITHMIC LEARNING THEORY, VOL 117, 2020, 117 : 148 - 173
  • [42] A Limited-Iteration Bisecting K-means for Fast Clustering Large Datasets
    Zhuang, Yu
    Mao, Yu
    Chen, Xin
    [J]. 2016 IEEE TRUSTCOM/BIGDATASE/ISPA, 2016, : 2257 - 2262
  • [43] An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means
    Wang, Yuyan
    Moseley, Benjamin
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 6307 - 6314
  • [44] Bisecting k-means clustering based face recognition using block-based bag of words model
    Zhao, Chunhui
    Li, Xiaocui
    Cang, Yan
    [J]. OPTIK, 2015, 126 (19): : 1761 - 1766
  • [45] A scalable privacy-preserving recommendation scheme via bisecting k-means clustering
    Bilge, Alper
    Polat, Huseyin
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2013, 49 (04) : 912 - 927
  • [46] Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
    Moseley, Benjamin
    Wang, Joshua R.
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [47] Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
    Moseley, Benjamin
    Wang, Joshua R.
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [48] Online k-means Clustering on Arbitrary Data Streams
    Bhattacharjee, Robi
    Imola, Jacob John
    Moshkovitz, Michal
    Dasgupta, Sanjoy
    [J]. INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 201, 2023, 201 : 204 - 236
  • [49] Graph based k-means clustering
    Galluccio, Laurent
    Michel, Olivier
    Comon, Pierre
    Hero, Alfred O., III
    [J]. SIGNAL PROCESSING, 2012, 92 (09) : 1970 - 1984
  • [50] A k-means based clustering algorithm
    Bloisi, Domenico Daniele
    Locchi, Luca
    [J]. COMPUTER VISION SYSTEMS, PROCEEDINGS, 2008, 5008 : 109 - 118