Motif-aware curriculum learning for node classification

被引:0
作者
Cai, Xiaosha [1 ]
Chen, Man-Sheng [2 ]
Wang, Chang-Dong [2 ,3 ]
Zhang, Haizhang [1 ]
机构
[1] Sun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Peoples R China
[2] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510275, Guangdong, Peoples R China
[3] Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510006, Peoples R China
关键词
Node classification; Curriculum learning; Motif-aware; Subgraph information;
D O I
10.1016/j.neunet.2024.107089
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Node classification, seeking to predict the categories of unlabeled nodes, is a crucial task in graph learning. One of the most popular methods for node classification is currently Graph Neural Networks (GNNs). However, conventional GNNs assign equal importance to all training nodes, which can lead to a reduction inaccuracy and robustness due to the influence of complex nodes information. In light of the potential benefits of curriculum learning, some studies have proposed to incorporate curriculum learning into GNNs , where the node information can be acquired in an orderly manner. Nevertheless, the existing curriculum learning-based node classification methods fail to consider the subgraph structural information. To address this issue, we propose a novel approach, Motif-aware Curriculum Learning for Node Classification (MACL). It emphasizes the role of motif structures within graphs to fully utilize subgraph information and measure the quality of nodes, supporting an organized learning process for GNNs. Specifically, we design a motif-aware difficulty measurer to evaluate the difficulty of training nodes from different perspectives. Furthermore, we have implemented a training scheduler to introduce appropriate training nodes to the GNNs at suitable times. We conduct extensive experiments on five representative datasets. The results show that incorporating MACL into GNNs can improve the accuracy.
引用
收藏
页数:13
相关论文
共 50 条
[21]   Hierarchical Structure-Feature Aware Graph Neural Network for Node Classification [J].
Yao, Wenbin ;
Guo, Ke ;
Hou, Yingying ;
Li, Xiaoyong .
IEEE ACCESS, 2022, 10 :36846-36855
[22]   A Hybrid Similarity-Aware Graph Neural Network with Transformer for Node Classification [J].
Singh, Aman ;
Dar, Shahid Shafi ;
Singh, Ranveer ;
Kumar, Nagendra .
EXPERT SYSTEMS WITH APPLICATIONS, 2025, 279
[23]   Incorporating difference information into curriculum learning for multitemporal image classification [J].
Zhao, Yue ;
Li, Hao ;
Gong, Maoguo ;
Wang, Yixin ;
Luo, Tianshi .
EXPERT SYSTEMS WITH APPLICATIONS, 2025, 276
[24]   A Category-Aware Curriculum Learning for Data-Free Knowledge Distillation [J].
Li, Xiufang ;
Jiao, Licheng ;
Sun, Qigong ;
Liu, Fang ;
Liu, Xu ;
Li, Lingling ;
Chen, Puhua ;
Yang, Shuyuan .
IEEE TRANSACTIONS ON MULTIMEDIA, 2024, 26 :9603-9618
[25]   A Competence-Aware Curriculum for Visual Concepts Learning via Question Answering [J].
Li, Qing ;
Huang, Siyuan ;
Hong, Yining ;
Zhu, Song-Chun .
COMPUTER VISION - ECCV 2020, PT II, 2020, 12347 :141-157
[26]   SAGCN: Towards Structure-Aware Deep Graph Convolutional Networks on Node Classification [J].
He, Ming ;
Ding, Tianyu ;
Han, Tianshuo .
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2021, PT II, 2021, 12713 :67-78
[27]   Nonlinear Graph Learning-Convolutional Networks for Node Classification [J].
Linjun Chen ;
Xingyi Liu ;
Zexin Li .
Neural Processing Letters, 2022, 54 :2727-2736
[28]   Nonlinear Graph Learning-Convolutional Networks for Node Classification [J].
Chen, Linjun ;
Liu, Xingyi ;
Li, Zexin .
NEURAL PROCESSING LETTERS, 2022, 54 (04) :2727-2736
[29]   Label-informed Graph Structure Learning for Node Classification [J].
Wang, Liping ;
Hu, Fenyu ;
Wu, Shu ;
Wang, Liang .
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, :3488-3492
[30]   DAG: Dual Attention Graph Representation Learning for Node Classification [J].
Lin, Siyi ;
Hong, Jie ;
Lang, Bo ;
Huang, Lin .
MATHEMATICS, 2023, 11 (17)