.png){kind=icon}
Return
Feature-Based Graph Backdoor Attack in the Node Classification Task
.png){kind=icon}
OA
AI
DOI：10.1155/2023/5418398.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph neural networks (GNNs) have shown significant performance in various practical applications due to their strong learning capabilities. Backdoor attacks are a type of attack that can produce hidden attacks on machine learning models. GNNs take backdoor datasets as input to produce an adversary-specified output on poisoned data but perform normally on clean data, which can have grave implications for applications. Backdoor attacks are under-researched in the graph domain, and almost existing graph backdoor attacks focus on the graph-level classification task. To close this gap, we propose a novel graph backdoor attack that uses node features as triggers and does not need knowledge of the GNNs parameters. In the experiments, we find that feature triggers can destroy the feature spaces of the original datasets, resulting in GNNs inability to identify poisoned data and clean data well. An adaptive method is proposed to improve the performance of the backdoor model by adjusting the graph structure. We conducted extensive experiments to validate the effectiveness of our model on three benchmark datasets.
Journal
IF:
3.7
Papers:
3.1K
Citations:
8.1K
Organization
Cited Papers
ShareSaveShareSaveShareSave
Dealing with the unevenness: deeper insights in graph-based attack and defense.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAIShareSave
View more