Detecting Targets of Graph Adversarial Attacks With Edge and Feature Perturbations

Graph neural networks (GNNs) enable many novel applications and achieve excellent performance. However, their performance may be significantly degraded by the graph adversarial attacks, which intentionally add small perturbations to the graph. Previous countermeasures usually handle such attacks by enhancing model robustness. However, robust models cannot identify the target nodes of the adversarial attacks, and thus we are unable to pinpoint the weak spots and analyze the causes or the targets of the attacks. In this article, we study the important research problem to detect the target nodes of graph adversarial attacks under the black-box detection scenario, which is particularly challenging because our detection models do not have any knowledge about the attacker, while the attackers usually employ unnoticeability strategies to minimize the chance of being detected. To our best knowledge, this is the first work that aims at detecting the target nodes of graph adversarial attacks under the black-box detector scenario. We propose two detection models, named Det-H and Det-RL , which employ different techniques that effectively detect the target nodes under the black-box detection scenario against various graph adversarial attacks. To enhance the generalization of the proposed detectors, we further propose two novel surrogate attackers that are able to generate effective attack examples and camouflage their attack traces for training robust detectors. In addition, we propose three strategies to effectively improve the training efficiency. Experimental results on multiple datasets show that our proposed detectors significantly outperform the other baselines against multiple state-of-the-art graph adversarial attackers with various attack strategies. The proposed Det-RL detector achieves an averaged area under curve (AUC) of 0.945 against all the attackers, and our efficiency-improving strategies are able save up to 91% of the training time

Adversarial system · Combinatorics · Computer security · Enhanced Data Rates for GSM Evolution · Graph · Graph theory · Advanced Graph Neural Networks · Adversarial Robustness in Machine Learning · Computer Science · Machine Learning in Materials Science · Mathematics · Artificial Intelligence · Theoretical Computer Science

• The political blogosphere and the 2004 U.S. election

  Open Access•Lada A Adamic, Natalie Glance•Proceedings of the 3rd…•2005

  Add to list

• Multiscale Evolutionary Perturbation Attack on Community Detection

  Open Access•Jinyin Chen, Yixian Chen et al.•IEEE Transactions on Computational…•2021

  Add to list