Label Guided Graph Optimized Convolutional Network for Semi-Supervised Learning

被引:0
作者
Zhang, Ziyan [1 ]
Jiang, Bo [1 ]
Tang, Jin [1 ]
Luo, Bin [1 ]
机构
[1] Anhui Univ, Sch Comp Sci & Technol, Hefei 230009, Peoples R China
来源
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS | 2025年 / 11卷
基金
中国国家自然科学基金;
关键词
Convolution; Semisupervised learning; Robustness; Network topology; Training; Topology; Sparse matrices; Optimization; Laplace equations; Information processing; Graph convolutional networks; Pairwise constraints; Graph structural attack; Semi-supervised learning;
D O I
10.1109/TSIPN.2025.3525961
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Graph Convolutional Networks (GCNs) have been widely studied for semi-supervised learning tasks. It is known that the graph convolution operations in most of existing GCNs are composed of two parts, i.e., feature propagation (FP) on a neighborhood graph and feature transformation (FT) with a fully connected network. For semi-supervised learning, existing GCNs generally utilize the label information only to train the parameters of the FT part via optimizing the loss function. However, they lack exploiting the label information in neighborhood feature propagation. Besides, due to the fixed graph topology used in FP, existing GCNs are vulnerable w.r.t. structural noises/attacks. To address these issues, we propose a novel and robust Label Guided Graph Optimized Convolutional Network (LabelGOCN) model which aims to fully exploit the label information in feature propagation of GCN via pairwise constraints propagation. In LabelGOCN, the pairwise constraints can provide a kind of 'weakly' supervised information to refine graph topology structure and thus to guide graph convolution operations for robust semi-supervised learning tasks. In particular, LabelGOCN jointly refines the pairwise constraints and GCN via a unified regularization model which can boost their respective performance. The experiments on several benchmark datasets show the effectiveness and robustness of the proposed LabelGOCN on semi-supervised learning tasks.
引用
收藏
页码:71 / 84
页数:14
相关论文
共 49 条
[1]  
Atwood J, 2016, ADV NEUR IN, V29
[2]  
Baghshah MS, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P1217
[3]  
Brody S., 2022, P INT C LEARN REPR
[4]   Label-Aware Graph Convolutional Networks [J].
Chen, Hao ;
Xu, Yue ;
Huang, Feiran ;
Deng, Zengde ;
Huang, Wenbing ;
Wang, Senzhang ;
He, Peng ;
Li, Zhoujun .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :1977-1980
[5]  
Chen L, 2021, PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, P2249
[6]  
Defferrard M., 2016, PROC 30 INT C NEURAL
[7]   All You Need Is Low (Rank): Defending Against Adversarial Attacks on Graphs [J].
Entezari, Negin ;
Al-Sayouri, Saba A. ;
Darvishzadeh, Amirali ;
Papalexakis, Evangelos E. .
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, :169-177
[8]   Multiscale Representation Learning of Graph Data With Node Affinity [J].
Gao, Xing ;
Dai, Wenrui ;
Li, Chenglin ;
Xiong, Hongkai ;
Frossard, Pascal .
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2021, 7 :30-44
[9]  
Geisler S, 2020, ADV NEUR IN, V33
[10]  
Glorot X., 2010, P INT C ART INT STAT, P1