Learning Hierarchical Task Structures for Few-shot Graph Classification

Author:

Wang Song1ORCID,Dong Yushun1ORCID,Huang Xiao2ORCID,Chen Chen1ORCID,Li Jundong1ORCID

Affiliation:

1. University of Virginia, USA

2. Hong Kong Polytechnic University, Hong Kong

Abstract

The problem of few-shot graph classification targets at assigning class labels for graph samples, where only limited labeled graphs are provided for each class. To solve the problem brought by label scarcity, recent studies have proposed to adopt the prevalent few-shot learning framework to achieve fast adaptations to graph classes with limited labeled graphs. In particular, these studies typically propose to accumulate meta-knowledge across a large number of meta-training tasks, and then generalize such meta-knowledge to meta-test tasks sampled from a disjoint class set. Nevertheless, existing studies generally ignore the crucial task correlations among meta-training tasks and treat them independently. In fact, such task correlations can help promote the model generalization to meta-test tasks and result in better classification performance. On the other hand, it remains challenging to capture and utilize task correlations due to the complex components and interactions in meta-training tasks. To deal with this, we propose a novel few-shot graph classification framework FAITH to capture task correlations via learning a hierarchical task structure at different granularities. We further propose a task-specific classifier to incorporate the learned task correlations into the few-shot graph classification process. Moreover, we derive FAITH+, a variant of FAITH that can improve the sampling process for the hierarchical task structure. The extensive experiments on four prevalent graph datasets further demonstrate the superiority of FAITH and FAITH+ over other state-of-the-art baselines.

Funder

National Science Foundation

JP Morgan Chase Faculty Research Award

Cisco Faculty Research Award

Jefferson Lab subcontracts

Commonwealth Cyber Initiative

Collaborative Research

UVA 3Cavaliers Seed Research Grant

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference54 articles.

1. Jinheon Baek, Dong Bok Lee, and Sung Ju Hwang. 2020. Learning to extrapolate knowledge: Transductive few-shot out-of-graph link prediction. In Proceedings of the Neural Information Processing Systems.

2. SimGNN

3. Meta-graph: Few shot link prediction via meta learning;Bose Avishek Joey;arXiv:1912.09867,2019

4. Shaosheng Cao Wei Lu and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In Proceedings of the 30th AAAI Conference on Artificial Intelligence .

5. Ines Chami Zhitao Ying Christopher Ré and Jure Leskovec. 2019. Hyperbolic graph convolutional neural networks. Advances in Neural Information Processing Systems 32 (2019) 4869–4880.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3