Adversarial graph node classification based on unsupervised learning and optimized loss functions

被引:0
|
作者
Ding H. [1 ]
Ma Z. [1 ]
Xu C. [1 ]
Wang X. [1 ]
Luo X. [1 ]
Zhu J. [1 ]
机构
[1] Key Laboratory of Intelligent Geospatial Information Processing, Department of Information Security, Future City Campus, China University of Geosciences (Wuhan), East Lake High-tech Development Zone, No. 68, Jincheng Street, Hubei Province, Wuhan City
关键词
Convolutional neural network; Graph node classification; Loss function optimization; Unsupervised adversarial models;
D O I
10.1007/s12652-024-04768-0
中图分类号
学科分类号
摘要
The research field of this paper is unsupervised learning in machine learning, aiming to address the problem of how to simultaneously resist feature attacks and improve model classification performance in unsupervised learning. For this purpose, this paper proposes a method to add an optimized loss function after the graph encoding and representation stage. When the samples are relatively balanced, we choose the cross-entropy loss function for classification. When difficult-to-classify samples appear, an optimized Focal Loss*() function is used to adjust the weights of these samples, to solve the problem of imbalanced positive and negative samples during training. The developed method achieved superior performance accuracy with the values of 0.721 on the Cora dataset, 0.598 on the Citeseer dataset,0.862 on the Polblogs dataset. Moreover, the testing accuracy value achieved by optimized model is 0.745, 0.627, 0.892 on the three benchmark datasets, respectively. Experimental results show that the proposed method effectively improves the robustness of adversarial training models in downstream tasks and reduces potential interference with original data. All the test results are validated with the k-fold cross validation method in order to make an assessment of the generalizability of these results. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.
引用
收藏
页码:2517 / 2528
页数:11
相关论文
共 50 条
  • [31] Label-informed Graph Structure Learning for Node Classification
    Wang, Liping
    Hu, Fenyu
    Wu, Shu
    Wang, Liang
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 3488 - 3492
  • [32] Nonlinear Graph Learning-Convolutional Networks for Node Classification
    Linjun Chen
    Xingyi Liu
    Zexin Li
    Neural Processing Letters, 2022, 54 : 2727 - 2736
  • [33] Graph Federated Learning with Center Moment Constraints for Node Classification
    Tang, Bisheng
    Chen, Xiaojun
    Wang, Shaopu
    Xuan, Yuexin
    Zhao, Zhendong
    53RD INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2024, 2024, : 86 - 95
  • [34] GCL: Contrastive learning instead of graph convolution for node classification
    Li, Shu
    Han, Lixin
    Wang, Yang
    Pu, Yonglin
    Zhu, Jun
    Li, Jingxian
    NEUROCOMPUTING, 2023, 551
  • [35] Graph Neural Network with curriculum learning for imbalanced node classification
    Li, Xiaohe
    Fan, Zide
    Huang, Feilong
    Hu, Xuming
    Deng, Yawen
    Wang, Lei
    Zhao, Xinyu
    NEUROCOMPUTING, 2024, 574
  • [36] DAG: Dual Attention Graph Representation Learning for Node Classification
    Lin, Siyi
    Hong, Jie
    Lang, Bo
    Huang, Lin
    MATHEMATICS, 2023, 11 (17)
  • [37] ImGCL: Revisiting Graph Contrastive Learning on Imbalanced Node Classification
    Zeng, Liang
    Li, Lanqing
    Gao, Ziqi
    Zhao, Peilin
    Li, Jian
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 9, 2023, : 11138 - 11146
  • [38] Flow Graph Anomaly Detection Based on Unsupervised Learning
    Yang, Zhengqiang
    Tian, Junwei
    Li, Ning
    MOBILE INFORMATION SYSTEMS, 2022, 2022
  • [39] Flow Graph Anomaly Detection Based on Unsupervised Learning
    Yang, Zhengqiang
    Tian, Junwei
    Li, Ning
    Mobile Information Systems, 2022, 2022
  • [40] Unsupervised Learning for Lexicon-Based Classification
    Eisenstein, Jacob
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3188 - 3194