基于自适应调节的图神经网络互信息伪装中毒攻击

Jihui Yin , Taorui Yang , Yifei Sun , Jianzhi Gao , Jiangbo Lu , Zhi-Hui Zhan
{"title":"基于自适应调节的图神经网络互信息伪装中毒攻击","authors":"Jihui Yin ,&nbsp;Taorui Yang ,&nbsp;Yifei Sun ,&nbsp;Jianzhi Gao ,&nbsp;Jiangbo Lu ,&nbsp;Zhi-Hui Zhan","doi":"10.1016/j.jai.2024.12.001","DOIUrl":null,"url":null,"abstract":"<div><div>Studies show that Graph Neural Networks (GNNs) are susceptible to minor perturbations. Therefore, analyzing adversarial attacks on GNNs is crucial in current research. Previous studies used Generative Adversarial Networks to generate a set of fake nodes, injecting them into a clean GNNs to poison the graph structure and evaluate the robustness of GNNs. In the attack process, the computation of new node connections and the attack loss are independent, which affects the attack on the GNN. To improve this, a Fake Node Camouflage Attack based on Mutual Information (FNCAMI) algorithm is proposed. By incorporating Mutual Information (MI) loss, the distribution of nodes injected into the GNNs become more similar to the original nodes, achieving better attack results. Since the loss ratios of GNNs and MI affect performance, we also design an adaptive weighting method. By adjusting the loss weights in real-time through rate changes, larger loss values are obtained, eliminating local optima. The feasibility, effectiveness, and stealthiness of this algorithm are validated on four real datasets. Additionally, we use both global and targeted attacks to test the algorithm’s performance. Comparisons with baseline attack algorithms and ablation experiments demonstrate the efficiency of the FNCAMI algorithm.</div></div>","PeriodicalId":100755,"journal":{"name":"Journal of Automation and Intelligence","volume":"4 1","pages":"Pages 21-28"},"PeriodicalIF":0.0000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive regulation-based Mutual Information Camouflage Poisoning Attack in Graph Neural Networks\",\"authors\":\"Jihui Yin ,&nbsp;Taorui Yang ,&nbsp;Yifei Sun ,&nbsp;Jianzhi Gao ,&nbsp;Jiangbo Lu ,&nbsp;Zhi-Hui Zhan\",\"doi\":\"10.1016/j.jai.2024.12.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Studies show that Graph Neural Networks (GNNs) are susceptible to minor perturbations. Therefore, analyzing adversarial attacks on GNNs is crucial in current research. Previous studies used Generative Adversarial Networks to generate a set of fake nodes, injecting them into a clean GNNs to poison the graph structure and evaluate the robustness of GNNs. In the attack process, the computation of new node connections and the attack loss are independent, which affects the attack on the GNN. To improve this, a Fake Node Camouflage Attack based on Mutual Information (FNCAMI) algorithm is proposed. By incorporating Mutual Information (MI) loss, the distribution of nodes injected into the GNNs become more similar to the original nodes, achieving better attack results. Since the loss ratios of GNNs and MI affect performance, we also design an adaptive weighting method. By adjusting the loss weights in real-time through rate changes, larger loss values are obtained, eliminating local optima. The feasibility, effectiveness, and stealthiness of this algorithm are validated on four real datasets. Additionally, we use both global and targeted attacks to test the algorithm’s performance. Comparisons with baseline attack algorithms and ablation experiments demonstrate the efficiency of the FNCAMI algorithm.</div></div>\",\"PeriodicalId\":100755,\"journal\":{\"name\":\"Journal of Automation and Intelligence\",\"volume\":\"4 1\",\"pages\":\"Pages 21-28\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Automation and Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2949855424000595\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Automation and Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949855424000595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究表明,图神经网络(GNNs)易受微小扰动的影响。因此,分析针对gnn的对抗性攻击在当前的研究中至关重要。以前的研究使用生成式对抗网络生成一组假节点,将它们注入到一个干净的gnn中以毒害图结构并评估gnn的鲁棒性。在攻击过程中,节点新连接数的计算与攻击损失是相互独立的,影响了对GNN的攻击。为了改进这一点,提出了一种基于互信息的假节点伪装攻击(FNCAMI)算法。通过加入互信息(MI)损失,注入到gnn中的节点分布变得与原始节点更加相似,从而获得更好的攻击效果。由于gnn和MI的损耗率会影响性能,我们还设计了一种自适应加权方法。通过速率变化实时调整损失权重,获得更大的损失值,消除了局部最优。在4个真实数据集上验证了该算法的可行性、有效性和隐蔽性。此外,我们使用全局和目标攻击来测试算法的性能。通过与基线攻击算法和消融实验的比较,验证了FNCAMI算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive regulation-based Mutual Information Camouflage Poisoning Attack in Graph Neural Networks
Studies show that Graph Neural Networks (GNNs) are susceptible to minor perturbations. Therefore, analyzing adversarial attacks on GNNs is crucial in current research. Previous studies used Generative Adversarial Networks to generate a set of fake nodes, injecting them into a clean GNNs to poison the graph structure and evaluate the robustness of GNNs. In the attack process, the computation of new node connections and the attack loss are independent, which affects the attack on the GNN. To improve this, a Fake Node Camouflage Attack based on Mutual Information (FNCAMI) algorithm is proposed. By incorporating Mutual Information (MI) loss, the distribution of nodes injected into the GNNs become more similar to the original nodes, achieving better attack results. Since the loss ratios of GNNs and MI affect performance, we also design an adaptive weighting method. By adjusting the loss weights in real-time through rate changes, larger loss values are obtained, eliminating local optima. The feasibility, effectiveness, and stealthiness of this algorithm are validated on four real datasets. Additionally, we use both global and targeted attacks to test the algorithm’s performance. Comparisons with baseline attack algorithms and ablation experiments demonstrate the efficiency of the FNCAMI algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信