.png){kind=icon}
Return
Structural Entropy Guided Meta-Learning for Few-Shot Node Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2026.3656714.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Few-shot node classification (FSNC) is a challenging task in graph analysis, where the goal is to classify unlabeled nodes in a graph using only a few labeled nodes as references. To tackle the label shortage problem, many meta-learning methods have been proposed to extract meta-knowledge from base classes with abundant labeled nodes and transfer the learned knowledge to classify nodes from novel classes. However, the theoretical foundation of meta-knowledge remains unexplored, and existing solutions often struggle when dealing with complex or noisy graphs. To address these issues, we propose a novel and effective meta-learning framework for FSNC based on structural information theory. First, we introduce the concept of minimal sufficient meta-knowledge, a theoretical principle inherited from information bottleneck, which optimally balances the expressiveness and robustness of the learned meta-knowledge. Guided by this principle, we develop a meta-learning model, named SE-FSNC, that extracts the minimal sufficient meta-knowledge using an encoding tree derived from the input graph with minimal structural entropy. We then propose an effective algorithm to train SE-FSNC by incorporating the encoding tree with graph contrastive learning. Extensive experiments on several datasets demonstrate the superiority of our model compared with other state-of-the-art methods.
Keywords:
Few-shot node classification
meta-learning
structural entropy
encoding tree
information bottleneck
Journal
IF:
10.4
Papers:
6.9K
Citations:
3.2W
Organization
Cited Papers
ArnetMiner.png)
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data miningIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more