Universal Detection of Backdoor Attacks via Density-Based Clustering and Centroids Analysis

被引:2
|
作者
Guo, Wei [1 ]
Tondi, Benedetta [1 ]
Barni, Mauro [1 ]
机构
[1] Univ Siena, Dept Informat Engn & Math, I-53100 Siena, Italy
关键词
Deep learning; backdoor attack; universal detection of backdoor attacks; density clustering; centroids analysis;
D O I
10.1109/TIFS.2023.3329426
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a Universal Defence against backdoor attacks based on Clustering and Centroids Analysis (CCA-UD). The goal of the defence is to reveal whether a Deep Neural Network model is subject to a backdoor attack by inspecting the training dataset. CCA-UD first clusters the samples of the training set by means of density-based clustering. Then, it applies a novel strategy to detect the presence of poisoned clusters. The proposed strategy is based on a general misclassification behaviour observed when the features of a representative example of the analysed cluster are added to benign samples. The capability of inducing a misclassification error is a general characteristic of poisoned samples, hence the proposed defence is attack-agnostic. This marks a significant difference with respect to existing defences, that, either can defend against only some types of backdoor attacks, or are effective only when some conditions on the poisoning ratio or the kind of triggering signal used by the attacker are satisfied. Experiments carried out on several classification tasks and network architectures, considering different types of backdoor attacks (with either clean or corrupted labels), and triggering signals, including both global and local triggering signals, as well as sample-specific and source-specific triggers, reveal that the proposed method is very effective to defend against backdoor attacks in all the cases, always outperforming the state of the art techniques.
引用
收藏
页码:970 / 984
页数:15
相关论文
共 50 条
  • [41] Anytime parallel density-based clustering
    Mai, Son T.
    Assent, Ira
    Jacobsen, Jon
    Dieu, Martin Storgaard
    DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (04) : 1121 - 1176
  • [42] Fast density-based clustering algorithm
    Zhou, Shuigeng
    Zhou, Aoying
    Cao, Jing
    Hu, Yunfa
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (11): : 1287 - 1292
  • [43] Density-based clustering with differential privacy
    Wu, Fuyu
    Du, Mingjing
    Zhi, Qiang
    INFORMATION SCIENCES, 2024, 681
  • [44] The Framework of Relative Density-Based Clustering
    Cui, Zelin
    Shen, Hong
    PARALLEL ARCHITECTURE, ALGORITHM AND PROGRAMMING, PAAP 2017, 2017, 729 : 343 - 352
  • [45] A varied density-based clustering algorithm
    Fahim, Ahmed
    JOURNAL OF COMPUTATIONAL SCIENCE, 2023, 66
  • [46] Feature Selection for Density-Based Clustering
    Ling, Yun
    Ye, Chongyi
    2009 INTERNATIONAL SYMPOSIUM ON INTELLIGENT UBIQUITOUS COMPUTING AND EDUCATION, 2009, : 226 - 229
  • [47] An ensemble density-based clustering method
    Xia, Luning
    Jing, Jiwu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (ISKE 2007), 2007,
  • [48] Hierarchical density-based clustering of shapes
    Gautama, T
    Van Hulle, MM
    NEURAL NETWORKS FOR SIGNAL PROCESSING XI, 2001, : 213 - 222
  • [49] Deep density-based image clustering
    Ren, Yazhou
    Wang, Ni
    Li, Mingxia
    Xu, Zenglin
    KNOWLEDGE-BASED SYSTEMS, 2020, 197
  • [50] Anytime parallel density-based clustering
    Son T. Mai
    Ira Assent
    Jon Jacobsen
    Martin Storgaard Dieu
    Data Mining and Knowledge Discovery, 2018, 32 : 1121 - 1176