Task-Adaptive Few-shot Node Classification

• URL: http://arxiv.org/abs/2206.11972v1
• Date: Thu, 23 Jun 2022 20:48:27 GMT
• Title: Task-Adaptive Few-shot Node Classification
• Authors: Song Wang, Kaize Ding, Chuxu Zhang, Chen Chen, Jundong Li
• Abstract summary: We propose a task-adaptive node classification framework under the few-shot learning setting. Specifically, we first accumulate meta-knowledge across classes with abundant labeled nodes. Then we transfer such knowledge to the classes with limited labeled nodes via our proposed task-adaptive modules.
• Score: 49.79924004684395
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Node classification is of great importance among various graph mining tasks. In practice, real-world graphs generally follow the long-tail distribution, where a large number of classes only consist of limited labeled nodes. Although Graph Neural Networks (GNNs) have achieved significant improvements in node classification, their performance decreases substantially in such a few-shot scenario. The main reason can be attributed to the vast generalization gap between meta-training and meta-test due to the task variance caused by different node/class distributions in meta-tasks (i.e., node-level and class-level variance). Therefore, to effectively alleviate the impact of task variance, we propose a task-adaptive node classification framework under the few-shot learning setting. Specifically, we first accumulate meta-knowledge across classes with abundant labeled nodes. Then we transfer such knowledge to the classes with limited labeled nodes via our proposed task-adaptive modules. In particular, to accommodate the different node/class distributions among meta-tasks, we propose three essential modules to perform \emph{node-level}, \emph{class-level}, and \emph{task-level} adaptations in each meta-task, respectively. In this way, our framework can conduct adaptations to different meta-tasks and thus advance the model generalization performance on meta-test tasks. Extensive experiments on four prevalent node classification datasets demonstrate the superiority of our framework over the state-of-the-art baselines. Our code is provided at https://github.com/SongW-SW/TENT.

Related papers

• Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training [22.473322546354414]
  We propose a novel framework for few-shot node classification called Meta-GPS++. We first adopt an efficient method to learn discriminative node representations on homophilic and heterophilic graphs. We also apply self-training to extract valuable information from unlabeled nodes.
  arXiv  Detail & Related papers  (2024-07-20T03:05:12Z)
• Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks [68.60884768323739]
  We introduce Contrastive Few-Shot Node Classification (COLA) COLA uses graph augmentations to identify semantically similar nodes, which enables the construction of meta-tasks without the need for label information. Through extensive experiments, we validate the essentiality of each component in our design and demonstrate that COLA achieves new state-of-the-art on all tasks.
  arXiv  Detail & Related papers  (2023-09-19T07:24:10Z)
• KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification [75.95647590619929]
  Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis. We propose a Knowledge-Aware Multi-Faceted framework (KMF) that enhances the richness of label semantics. A novel geometric constraint is developed to alleviate the problem of prototype drift caused by node information aggregation.
  arXiv  Detail & Related papers  (2023-08-15T02:38:08Z)
• Contrastive Meta-Learning for Few-shot Node Classification [54.36506013228169]
  Few-shot node classification aims to predict labels for nodes on graphs with only limited labeled nodes as references. We create a novel contrastive meta-learning framework on graphs, named COSMIC, with two key designs.
  arXiv  Detail & Related papers  (2023-06-27T02:22:45Z)
• Task-Equivariant Graph Few-shot Learning [7.78018583713337]
  It is important for Graph Neural Networks (GNNs) to be able to classify nodes with a limited number of labeled nodes, known as few-shot node classification. We propose a new approach, the Task-Equivariant Graph few-shot learning (TEG) framework. Our TEG framework enables the model to learn transferable task-adaptation strategies using a limited number of training meta-tasks.
  arXiv  Detail & Related papers  (2023-05-30T05:47:28Z)
• Few-shot Node Classification with Extremely Weak Supervision [39.54361983108562]
  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. It is usually difficult to obtain abundant labeled nodes for many classes.
  arXiv  Detail & Related papers  (2023-01-06T20:40:32Z)
• Graph Few-shot Learning with Task-specific Structures [38.52226241144403]
  Existing graph few-shot learning methods typically leverage Graph Neural Networks (GNNs) We propose a novel framework that learns a task-specific structure for each meta-task. In this way, we can learn node representations with the task-specific structure tailored for each meta-task.
  arXiv  Detail & Related papers  (2022-10-21T17:40:21Z)
• Association Graph Learning for Multi-Task Classification with Category Shifts [68.58829338426712]
  We focus on multi-task classification, where related classification tasks share the same label space and are learned simultaneously. We learn an association graph to transfer knowledge among tasks for missing classes. Our method consistently performs better than representative baselines.
  arXiv  Detail & Related papers  (2022-10-10T12:37:41Z)
• Graph Prototypical Networks for Few-shot Learning on Attributed Networks [72.31180045017835]
  We propose a graph meta-learning framework -- Graph Prototypical Networks (GPN) GPN is able to perform textitmeta-learning on an attributed network and derive a highly generalizable model for handling the target classification task.
  arXiv  Detail & Related papers  (2020-06-23T04:13:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.