MGA: Momentum Gradient Attack on Network
- 30 October 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (1) , 99-109
Abstract
The adversarial attack methods based on gradient information can adequately find the perturbations, that is, the combinations of rewired links, thereby reducing the effectiveness of the deep learning model-based graph embedding algorithms, but it is also easy to fall into a local optimum. Therefore, this article proposes a momentum gradient attack (MGA) against the graph convolutional network (GCN) model, which can achieve more aggressive attacks with fewer rewiring links. Compared with directly updating the original network using gradient information, integrating the momentum term into the iterative process can stabilize the updating direction, which makes the model jump out of poor local optimum and enhances the method with stronger transferability. Experiments on node classification and community detection methods based on three well-known network embedding algorithms show that MGA has a better attack effect and transferability.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62072406)
- Natural Science Foundation of Zhejiang Provincial (LY19F020025)
- Major Special Funding for “Science and Technology Innovation 2025” in Ningbo (2018B10063)
- Special Scientific Research Fund of Basic Public Welfare Profession of Zhejiang Province (LGF20F020016)
- Ministry of Public Security’s Research Project “Research and Application of Key Technologies of Criminal Moments Model”
This publication has 50 references indexed in Scilit:
- Neighborhood randomization for link privacy in social network analysisWorld Wide Web, 2013
- Node centrality in weighted networks: Generalizing degree and shortest pathsSocial Networks, 2010
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Near linear time algorithm to detect community structures in large-scale networksPhysical Review E, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Centrality and network flowSocial Networks, 2005
- Fast algorithm for detecting community structure in networksPhysical Review E, 2004
- Centrality in social networks conceptual clarificationSocial Networks, 1978
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964
- Structural parameters of communication networksBulletin of Mathematical Biology, 1953