Timezone: »

 
Poster
Graph Few-shot Learning with Task-specific Structures
Song Wang · Chen Chen · Jundong Li

Tue Nov 29 09:00 AM -- 11:00 AM (PST) @ Hall J #209
in Poster Session 1 »

Graph few-shot learning is of great importance among various graph learning tasks. Under the few-shot scenario, models are often required to conduct classification given limited labeled samples. Existing graph few-shot learning methods typically leverage Graph Neural Networks (GNNs) and perform classification across a series of meta-tasks. Nevertheless, these methods generally rely on the original graph (i.e., the graph that the meta-task is sampled from) to learn node representations. Consequently, the learned representations for the same nodes are identical in all meta-tasks. Since the class sets are different across meta-tasks, node representations should be task-specific to promote classification performance. Therefore, to adaptively learn node representations across meta-tasks, we propose a novel framework that learns a task-specific structure for each meta-task. To handle the variety of nodes across meta-tasks, we extract relevant nodes and learn task-specific structures based on node influence and mutual information. In this way, we can learn node representations with the task-specific structure tailored for each meta-task. We further conduct extensive experiments on five node classification datasets under both single- and multiple-graph settings to validate the superiority of our framework over the state-of-the-art baselines.

Keywords: Few-Shot Learning · graph neural networks · Graph Mining

Author Information

Song Wang (University of Virginia)
Chen Chen
Jundong Li (University of Virginia)

More from the Same Authors