首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于子图采样的大规模图对抗性攻击方法
引用本文:高昕,安冬冬,章晓峰.基于子图采样的大规模图对抗性攻击方法[J].上海师范大学学报(自然科学版),2024,53(2):167-171.
作者姓名:高昕  安冬冬  章晓峰
作者单位:上海师范大学 信息与机电工程学院, 上海 201418;上海新致软件股份有限公司, 上海 200120
基金项目:国家自然科学基金青年基金(62302308),上海市青年科技英才扬帆计划(21YF1432900)
摘    要:为提高对抗性攻击在大规模图上的攻击效率,提出了基于子图采样的对抗样本生成方法. 该方法通过引入PageRank、余弦相似度及K跳子图等技术,提取与目标节点高度相关的子图,在大规模图上缓解了计算梯度效率较低的问题,在降低被攻击模型准确性的同时提升了攻击的隐蔽性. 实验结果表明: 所提出的对抗性攻击方法与基于梯度攻击的GradArgmax算法相比,在Cora数据集上提升了30.7%的攻击性能,且在Reddit大规模数据上能够计算GradArgmax算法无法计算的攻击扰动.

关 键 词:图神经网络  对抗性攻击  子图提取算法
收稿时间:2023/12/15 0:00:00

Subgraph sampling-based adversarial attack method for large-scale graphs
GAO Xin,AN Dongdong,ZHANG Xiaofeng.Subgraph sampling-based adversarial attack method for large-scale graphs[J].Journal of Shanghai Normal University(Natural Sciences),2024,53(2):167-171.
Authors:GAO Xin  AN Dongdong  ZHANG Xiaofeng
Institution:College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 201418, China; Shanghai Newtouch Software Co., Ltd., Shanghai 200120, China
Abstract:A subgraph sampling-based adversarial example generation method was proposed to enhance the efficiency of adversarial attacks on large-scale graphs. PageRank, cosine similarity, and K-hop subgraphs were employed to extract subgraphs highly relevant to the target node in this method, alleviating the issue of low gradient computation efficiency in large-scale graphs. The stealthiness of the attack was also increased while reducing the accuracy of the attacked model. Experimental results showed that attack performance was improved by 30.7% on the Cora dataset by this adversarial attack method compared to the GradArgmax algorithm, and attack perturbations on large-scale like Reddit dataset could be computed which the GradArgmax algorithm could not achieve.
Keywords:graph neural network  adversarial attack  subgraph extraction algorithm
点击此处可从《上海师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《上海师范大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号