Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding
We study the problem of node classification on graphs with few-shot novel labels, which has two distinctive properties: (1) There are novel labels to emerge in the graph; (2) The novel labels have only a few representative nodes for training a classifier. The study of this problem is instructive and corresponds to many applications such as recommendations for newly formed groups with only a few users in online social networks. To cope with this problem, we propose a novel Meta Transformed Network Embedding framework (MetaTNE), which consists of three modules: (1) A \emph{structural module} provides each node a latent representation according to the graph structure. (2) A \emph{meta-learning module} captures the relationships between the graph structure and the node labels as prior knowledge in a meta-learning manner. Additionally, we introduce an \emph{embedding transformation function} that remedies the deficiency of the straightforward use of meta-learning. Inherently, the meta-learned prior knowledge can be used to facilitate the learning of few-shot novel labels. (3) An \emph{optimization module} employs a simple yet effective scheduling strategy to train the above two modules with a balance between graph structure learning and meta-learning. Experiments on four real-world datasets show that MetaTNE brings a huge improvement over the state-of-the-art methods.
Code (1)
Tasks
General ClassificationGraph structure learningMeta-LearningNetwork EmbeddingNode ClassificationSchedulingSimilar Papers 제목 키워드 기반
Contrastive Meta-Learning for Few-shot Node Classification
Few-shot node classification, which aims to predict labels for nodes on graphs with only limited labeled nodes as references, is of great significance in real-world graph mining tasks. Particularly, in this paper, we ref…
ClassificationGraph MiningMeta-LearningNode ClassificationTransductive Linear Probing: A Novel Framework for Few-Shot Node Classification
Few-shot node classification is tasked to provide accurate predictions for nodes from novel classes with only few representative labeled nodes. This problem has drawn tremendous attention for its projection to prevailing…
ClassificationContrastive LearningMeta-LearningNode Classification+2Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training
Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning wit…
Contrastive LearningGraph LearningMeta-LearningNode ClassificationSupervised Graph Contrastive Learning for Few-shot Node Classification
Graphs are present in many real-world applications, such as financial fraud detection, commercial recommendation, and social network analysis. But given the high cost of graph annotation or labeling, we face a severe gra…
ClassificationContrastive LearningData AugmentationFew-Shot Learning+3Few-shot Node Classification with Extremely Weak Supervision
Few-shot node classification aims at classifying nodes with limited labeled nodes as references. Recent few-shot node classification methods typically learn from classes with abundant labeled nodes (i.e., meta-training c…
ClassificationMeta-LearningNode Classification