Learning Hierarchical Task Structures for Few-shot Graph Classification

被引:0
作者
Wang, Song [1 ]
Dong, Yushun [1 ]
Huang, Xiao [2 ]
Chen, Chen [1 ]
Li, Jundong [1 ]
机构
[1] Univ Virginia, Charlottesville, VA 22903 USA
[2] Hong Kong Polytech Univ, Hong Kong 999077, Peoples R China
基金
美国国家科学基金会;
关键词
Few-shot learning; graph classification; data mining; graph neural networks;
D O I
10.1145/3635473
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:20
相关论文
共 54 条
[1]  
[Anonymous], 2016, Proceedings of the 30th International Conference on Neural Information Processing Systems
[2]  
[Anonymous], 2009, P 12 INT C ART INT S
[3]  
Baek Jinheon, 2020, P NEUR INF PROC SYST
[4]   SimGNN: A Neural Network Approach to Fast Graph Similarity Computation [J].
Bai, Yunsheng ;
Ding, Hao ;
Bian, Song ;
Chen, Ting ;
Sun, Yizhou ;
Wang, Wei .
PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, :384-392
[5]  
Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
[6]  
Chami I, 2019, ADV NEUR IN, V32
[7]   Heterogeneous Network Embedding via Deep Architectures [J].
Chang, Shiyu ;
Han, Wei ;
Tang, Jiliang ;
Qi, Guo-Jun ;
Aggarwal, Charu C. ;
Huang, Thomas S. .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :119-128
[8]  
Chauhan Jatin, 2020, P INT C LEARN REPR, P1
[9]  
Crisostomi Donato, 2022, P LEARN GRAPHS C
[10]   Graph Prototypical Networks for Few-shot Learning on Attributed Networks [J].
Ding, Kaize ;
Wang, Jianling ;
Li, Jundong ;
Shu, Kai ;
Liu, Chenghao ;
Liu, Huan .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :295-304