Learning Hierarchical Task Structures for Few-shot Graph Classification
-
Published:2024-01-12
Issue:3
Volume:18
Page:1-20
-
ISSN:1556-4681
-
Container-title:ACM Transactions on Knowledge Discovery from Data
-
language:en
-
Short-container-title:ACM Trans. Knowl. Discov. Data
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.