Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &Amp; Data Mining 2021
DOI: 10.1145/3447548.3467314
|View full text |Cite
|
Sign up to set email alerts
|

TDGIA: Effective Injection Attacks on Graph Neural Networks

Abstract: Graph Neural Networks (GNNs) have achieved promising performance in various real-world applications. However, recent studies find that GNNs are vulnerable to adversarial attacks. In this paper, we study a recently-introduced realistic attack scenario on graphsgraph injection attack (GIA). In the GIA scenario, the adversary is not able to modify the existing link structure or node attributes of the input graph, instead the attack is performed by injecting adversarial nodes into it. We present an analysis on the… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 61 publications
(45 citation statements)
references
References 19 publications
0
45
0
Order By: Relevance
“…The most important 5 features selected from feature settings in the analysis of dataset of Welding Machine 2, listed in ranking of descending importance. -Investigating other ML methods (Zou et al 2021;Feng et al 2020), e.g. artificial neural networks, especially recurrent neural networks, which are suitable for processing data with temporal structures.…”
Section: Tablementioning
confidence: 99%
“…The most important 5 features selected from feature settings in the analysis of dataset of Welding Machine 2, listed in ranking of descending importance. -Investigating other ML methods (Zou et al 2021;Feng et al 2020), e.g. artificial neural networks, especially recurrent neural networks, which are suitable for processing data with temporal structures.…”
Section: Tablementioning
confidence: 99%
“…Section 3 for detailed discussions). ---FLIP [29] ---NEA [29] ---FGSM [12] --Nettack [12] --RL-S2V [30] --Metattack [13] ---STACK [31] ---AFGSM [16] ---SPEIT [17] ---TDGIA [18] ---GRB Mod. Scenario ---GRB Inj.…”
Section: Problem Definitionmentioning
confidence: 99%
“…Graph modification attacks directly modify the existing graph, by adding or removing edges (e.g., DICE [19], FGA [11], FLIP [29], NEA [29], STACK [31]), or further modifying node features (e.g., Nettack [12], FGSM [12], RL-S2V [30], Metattack [13]). Differently, graph injection attacks add new malicious nodes without modifying the original graph (e.g., AFGSM [16], SPEIT [17], TD-GIA [18]). Facing the problem of scalability, some attacks are not applicable to large graphs due to their high time complexity [12,13,30] or expensive memory consumption [11,29].…”
Section: Revisiting Adversarial Attacks and Defenses In Gmlmentioning
confidence: 99%
See 2 more Smart Citations