计算机科学
人工神经网络
一般化
节点(物理)
依赖关系图
图形
集合(抽象数据类型)
方案(数学)
网络拓扑
依赖关系(UML)
构造(python库)
人工智能
过程(计算)
拓扑图论
稳健性(进化)
注意力网络
拓扑(电路)
理论计算机科学
数据挖掘
有向无环图
机器学习
利用
深层神经网络
隐藏节点问题
分布式计算
训练集
网络安全
同质性(统计学)
作者
Fei Yan,Yanlong Tang,Witold Pedrycz,Kaoru Hirota
标识
DOI:10.1109/tbdata.2025.3630819
摘要
Graph neural networks (GNNs) excel in various graph-based tasks due to their exceptional ability to process non-Euclidean data. However, recent research indicates that their predictive performance is highly vulnerable to perturbations from intentionally manipulated data. Current node injection attack methods disrupt GNN training by injecting numerous nodes, often in excessive amounts, making them easily detectable. To address this issue, this study introduces a structure-aware node injection attack (SNIA), which enables effective and subtle attacks under extreme budget constraints. The scheme leverages the network topology to construct an attack candidate set and applies homogeneity constraints to regulate the generation of perturbed features. By eliminating the dependency on surrogate models for generating perturbed data, SNIA effectively diminishes the global classification performance of GNNs based on the network's inherent structure. We conducted attack experiments with the SNIA scheme on real-world network datasets against both general and defensive GNNs. The experimental findings reveal that it significantly surpasses the existing state-of-the-art methods in attack efficiency, while also showcasing outstanding generalization and resilience.
科研通智能强力驱动
Strongly Powered by AbleSci AI