ERGCN: Data enhancement-based robust graph convolutional network against adversarial attacks

被引:16
作者
Wu, Tao [1 ]
Yang, Nan [2 ]
Chen, Long [1 ]
Xiao, Xiaokui [3 ]
Xian, Xingping [1 ]
Liu, Jun [4 ]
Qiao, Shaojie [5 ]
Cui, Canyixing [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Cybersecur & Informat Law, Chongqing, Peoples R China
[2] Chongqing Univ Posts & Telecommun, Coll Comp Sci & Technol, Chongqing, Peoples R China
[3] Natl Univ Singapore NUS, Sch Comp SoC, Singapore, Singapore
[4] Chongqing Univ Posts & Telecommun, Sch Software Engn, Chongqing, Peoples R China
[5] Chengdu Univ Informat Technol, Sch Software Engn, Chengdu, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph machine learning; Graph convolutional networks; Adversarial attacks; Node classification; Data enhancement; PREDICTION;
D O I
10.1016/j.ins.2022.10.115
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With recent advancements, graph neural networks (GNNs) have shown considerable potential for various graph-related tasks, and their applications have gained considerable attention. However, adversarial attacks can significantly degrade the performance of GNNs, hindering their deployment in critical real-world tasks. GNNs must be robust against adversarial attacks, in which imperceptible adversarial perturbations are intro-duced to induce serious security issues. To achieve this goal, we propose a robust graph convolutional network, ERGCN, for node classification via data enhancement. ERGCN simultaneously utilizes properties from the "data domain" and "model space" as guidance. Based on the feature smoothness assumption, a graph structure enhancement (GSE) mech-anism is proposed to improve the structural reliability of input graphs. Moreover, inspired by self-training methods that assign pseudo-labels to unlabeled training samples and use them to optimize the target model iteratively, a reliable node selection metric, model boundary distance (MBD), is defined based on the distance from training samples to model decision boundary. Finally, a self-training-based robust graph convolutional network is proposed for node classification. Extensive experiments on three public datasets demon-strate the superiority of our model over existing state-of-the-art methods. Our study pro-vides a solution for trustworthy graph machine learning systems in adversarial environments. The code is available at https://github.com/star4455/ERGCN.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:234 / 253
页数:20
相关论文
共 50 条
  • [1] Bojchevski A, 2019, PR MACH LEARN RES, V97
  • [2] Towards Evaluating the Robustness of Neural Networks
    Carlini, Nicholas
    Wagner, David
    [J]. 2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, : 39 - 57
  • [3] Chang H, 2020, AAAI CONF ARTIF INTE, V34, P3389
  • [4] Chen JY, 2018, Arxiv, DOI arXiv:1810.01110
  • [5] Chen JY, 2018, Arxiv, DOI arXiv:1809.02797
  • [6] GA-Based Q-Attack on Community Detection
    Chen, Jinyin
    Chen, Lihong
    Chen, Yixian
    Zhao, Minghao
    Yu, Shanqing
    Xuan, Qi
    Yang, Xiaoniu
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2019, 6 (03) : 491 - 503
  • [7] Hierarchical structure and the prediction of missing links in networks
    Clauset, Aaron
    Moore, Cristopher
    Newman, M. E. J.
    [J]. NATURE, 2008, 453 (7191) : 98 - 101
  • [8] Dai HJ, 2018, PR MACH LEARN RES, V80
  • [9] All You Need Is Low (Rank): Defending Against Adversarial Attacks on Graphs
    Entezari, Negin
    Al-Sayouri, Saba A.
    Darvishzadeh, Amirali
    Papalexakis, Evangelos E.
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 169 - 177
  • [10] Fan HX, 2020, Arxiv, DOI arXiv:2009.00163