Abstract
The real-world graphs are full of noises and perturbation. However, recent studies show that the existing graph neural networks (GNNs) are usually sensitive to the quality of the input graph. In this work, we propose a graph alternate learning (GAL) framework to alternately train dual models, i.e., prediction network to learn the graph structure for node classification tasks and graph regularization network to enhance the robustness of GNNs. The adoption of dual models, which learn and teach each other collaboratively at the entire training process, drives the formation of a better graph structure. Furthermore, a node feature selection method is integrated into the GAL network to reduce the influence of node attack. Lastly, in order to evaluate the anti-attack ability of GAL, we devise a smooth input graph adversarial attack, called Smooth-Attack, which can degrade the node classification performance of graph convolutional networks (GCN) and is considered to be a form of over-smoothing. Experiments show that our proposed GAL model can keep superiority on benchmark datasets under edge and node perturbation, and GAL is highly robust against Smooth-Attack.
Similar content being viewed by others
References
Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. arXiv preprint arXiv:1706.02216
Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907
Sanchez-Gonzalez A, Heess N, Springenberg JT, Merel J, Riedmiller M, Hadsell R, Battaglia P (2018) Graph networks as learnable physics engines for inference and control. In: International conference on machine learning, PMLR, pp 4470–4479
Fout AM (2017) Protein interface prediction using graph convolutional networks. PhD thesis, Colorado State University
Su X, Xue S, Liu F, Wu J, Yang J, Zhou C, Hu W, Paris C, Nepal S, Jin D, et al. (2021) A comprehensive survey on community detection with deep learning. arXiv preprint arXiv:2105.12584
Hamaguchi T, Oiwa H, Shimbo M, Matsumoto Y (2017) Knowledge transfer for out-of-knowledge-base entities: a graph neural network approach. arXiv preprint arXiv:1706.05674
Li Y, Tarlow D, Brockschmidt M, Zemel R (2015) Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493
Monti F, Frasca F, Eynard D, Mannion D, Bronstein MM (2019) Fake news detection on social media using geometric deep learning. arXiv preprint arXiv:1902.06673
Veličković P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903
Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308
Goodfellow IJ, Shlens J, Szegedy C (2014) Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572
Xu H, Ma Y, Liu HC, Deb D, Liu H, Tang JL, Jain AK (2020) Adversarial attacks and defenses in images, graphs and text: a review. Int J Autom Comput 17(2):151–178
Zügner D, Akbarnejad A, Günnemann S (2018) Adversarial attacks on neural networks for graph data. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2847–2856
Zügner D, Günnemann S (2019) Adversarial attacks on graph neural networks via meta learning. arXiv preprint arXiv:1902.08412
Tang J, Liu H (2012) Feature selection with linked data in social media. In: Proceedings of the 2012 SIAM international conference on data mining. SIAM, pp 118–128
Dai H, Li H, Tian T, Huang X, Wang L, Zhu J, Song L (2018) Adversarial attack on graph structured data. In: International conference on machine learning, PMLR, pp 1115–1124
Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Min Knowl Discov 29(3):626–688
Zhang Y, Xiang T, Hospedales TM, Lu H (2018) Deep mutual learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4320–4328
Zhan K, Niu C (2021) Mutual teaching for graph convolutional networks. Future Gener Comput Syst 115:837–843
Hinton G, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531
Gori M, Monfardini G, Scarselli F (2005) A new model for learning in graph domains. In: Proceedings. 2005 IEEE international joint conference on neural networks, vol 2, 2005. IEEE, pp 729–734
Scarselli F, Gori M, Tsoi AC, Hagenbuchner M, Monfardini G (2008) The graph neural network model. IEEE Trans Neural Netw 20(1):61–80
Gallicchio C, Micheli A (2010) Graph echo state networks. In: The 2010 International joint conference on neural networks (IJCNN), IEEE, pp 1–8
Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203
Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. arXiv preprint arXiv:1606.09375
Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K (2019) Simplifying graph convolutional networks. In: International conference on machine learning, PMLR, pp 6861–6871
Atwood J, Towsley D (2016) Diffusion-convolutional neural networks. In: Advances in neural information processing systems, pp 1993–2001
Luo D, Cheng W, Yu W, Zong B, Ni J, Chen H, Zhang X (2021) Learning to drop: Robust graph neural network via topological denoising. In: Proceedings of the 14th ACM international conference on web search and data mining, pp 779–787
Jin W, Li Y, Xu H, Wang Y, Tang J (2020) Adversarial attacks and defenses on graphs: a review and empirical study. arXiv preprint arXiv:2003.00653
Tang X, Li Y, Sun Y, Yao H, Mitra P, Wang S (2020) Transferring robustness for graph neural network against poisoning attacks. In: Proceedings of the 13th international conference on web search and data mining, pp 600–608
Jin W, Ma Y, Liu X, Tang X, Wang S, Tang J (2020) Graph structure learning for robust graph neural networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 66–74
Zhu D, Zhang Z, Cui P, Zhu W (2019) Robust graph convolutional networks against adversarial attacks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1399–1407
Cai X, Nie F, Huang H (2013) Exact top-k feature selection via l2, 0-norm constraint. In: Twenty-third international joint conference on artificial intelligence
Jin W, Derr T, Wang Y, Ma Y, Liu Z, Tang J (2021) Node similarity preserving graph convolutional networks. In: Proceedings of the 14th ACM international conference on web search and data mining, pp 148–156
Chen Y, Wu L, Zaki M (2020) Iterative deep graph learning for graph neural networks: better and robust node embeddings. Adv Neural Inf Process Syst 33
Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. Nips 14:585–591
Zhou K, Zha H, Song L (2013) Learning social infectivity in sparse low-rank networks using multi-dimensional hawkes processes. In: Artificial intelligence and statistics, PMLR, pp 641–649
Kalofolias V (2016) How to learn a graph from smooth signals. In: Artificial intelligence and statistics, PMLR, pp 920–929
Entezari N, Al-Sayouri SA, Darvishzadeh A, Papalexakis EE (2020) All you need is low (rank) defending against adversarial attacks on graphs. In: Proceedings of the 13th international conference on web search and data mining, pp 169–177
Liu M, Gao H, Ji S (2020) Towards deeper graph neural networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 338–348
McCallum AK, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr 3(2):127–163
Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93–93
Adamic LA, Glance N (2005) The political blogosphere and the 2004. US Elec
Hu W, Fey M, Zitnik M, Dong Y, Ren H, Liu B, Catasta M, Leskovec J (2020) Open graph benchmark: datasets for machine learning on graphs. arXiv preprint arXiv:2005.00687
Zhang X, Zitnik M (2020) Gnnguard: Defending graph neural networks against adversarial attacks. arXiv preprint arXiv:2006.08149
Macskassy SA, Provost F (2003) A simple relational classifier. New York Univ NY Stern School of Business, Tech. rep
Acknowledgements
This work was supported by National Natural Science Foundation of China under Grant 82071995 and Natural Science Foundation of Jilin Province under Grant 20200201292JC.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, B., Guo, X., Tu, Z. et al. Graph alternate learning for robust graph neural networks in node classification. Neural Comput & Applic 34, 8723–8735 (2022). https://doi.org/10.1007/s00521-021-06863-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-021-06863-1