arrow
Return

Motif-aware curriculum learning for node classification

delete2025-04-01
delete0
PRE
AI
X
Xiaosha Cai
M
Man-Sheng Chen
C
Chang‐Dong Wang *
张海樟 cover
张海樟 (Haizhang Zhang)
DOI:10.1016/j.neunet.2024.107089delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Node classification
Curriculum learning
Motif-aware
Subgraph information

Journal

Neural Networks cover
Neural Networks
IF:
6.3
Papers:
8.2K
Citations:
3.0W

Organization

S
Sun Yat Sen University
Scholars:
9.9W
Papers: 7.2W
Citations: 95
Cited Papers

Cited Papers

Robust cross-network node classification via constrained graph mutual information
err2022-12-01
err36
PREAI
errYang, Shuiqiao; Cai, Borui; Cai, Taotao; Song, Xiangyu; Jiang, Jiaojiao; Li, Bing; Li, Jianxin
errShare
errSave
Toward Effective Semi-supervised Node Classification with Hybrid Curriculum Pseudo-labeling
err2023-11-10
err8
errOAAI
errLuo, Xiao; Ju, Wei; Gu, Yiyang; Qin, Yifang; Yi, Siyu; Wu, Daqing; Liu, Luchen; Zhang, Ming
errShare
errSave
Fast Haar Transforms for Graph Neural Networks
err2020-08-01
err59
errOAAI
errLi, Ming; Ma, Zheng; Wang, Yu Guang; Zhuang, Xiaosheng
errShare
errSave
Deep Learning on Graphs: A Survey
err2022-01-01
err385
errOAAI
errZhang, Ziwei; Cui, Peng; Zhu, Wenwu
errShare
errSave
Identifying gut microbial signatures associated with B cells and tertiary lymphoid structures (TLS) in the tumor microenvironment (TME) in response to immune checkpoint blockade (ICB).
err2022-06-01
err0
PREAI
errElise F Nassif; Manoj Chelvanambi; Lili Chen; Chia-Chin Wu; Ashish Damania; Emily Zhi-Yun Keung; Russell G. Witt; Michael White; Nadim J. Ajami; Matthew C. Wong; Neeta Somaiah; Boris Sepesi; Sreyashi Basu; James Patrick Allison; Padmanee Sharma; Kevin McBride; Wolf-Hervé Fridman; Jennifer Ann Wargo; Tina Cascone; Christina Lynn Roland
errShare
errSave
Embodying Contradictions
err2006-08-01
err0
PREAI
errJennifer L. Hanis-Martin
errShare
errSave
researcher View more