TAGM: Task-Aware Graph Model for Few-shot Node Classification

被引:1
作者
Zhao, Feng [1 ]
Zhang, Min [1 ]
Huang, Tiancheng [1 ]
Wang, Donglin [1 ]
机构
[1] Westlake Univ, Hangzhou, Zhejiang, Peoples R China
来源
PROCEEDINGS OF THE 2023 ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA RETRIEVAL, ICMR 2023 | 2023年
关键词
Graph neural networks; Few-shot learning; Task adaptation;
D O I
10.1145/3591106.3592293
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph representation learning has attracted tremendous attention due to its remarkable performance in variety of real-world applications. However, because data labeling is always time and resource intensive, current supervised graph representation learning models for particular tasks frequently suffer from label sparsity issues. In light of this, graph few-shot learning has been proposed to tackle the performance degradation in face of limited annotated data challenge. While recent advances in graph few shot learning achieve promising performance, they typically force to use a generic feature embedding across various tasks. Ideally, we want to construct feature embeddings that are tuned for the given task because of the differences in distribution between tasks. In this work, we propose a novel Task-Aware Graph Model (TAGM) to learn task-aware node embedding. Specifically, we provide a new graph cell design that includes a graph convolution layer for aggregating and updating graph information as well as a two-layer linear transformation for node feature transformation. On this basis, we encode task information to learn the binary weight mask set and gradient mask set, where the weight mask set selects different network parameters for different tasks and the gradient mask set can dynamically update the selected network parameters in a different manner during the optimization process. Our model is more sensitive to task identity and performs better for a task graph input. Our extensive experiments on three graph-structured datasets demonstrate that our proposed method generally outperforms the state-of-the-art baselines in few-shot learning.
引用
收藏
页码:462 / 471
页数:10
相关论文
共 67 条
  • [1] Antoniou A, 2019, Arxiv, DOI arXiv:1810.09502
  • [2] Bhagat S, 2011, SOCIAL NETWORK DATA ANALYTICS, P115
  • [3] Bruna J, 2014, Arxiv, DOI arXiv:1312.6203
  • [4] Memory Matching Networks for One-Shot Image Recognition
    Cai, Qi
    Pan, Yingwei
    Yao, Ting
    Yan, Chenggang
    Mei, Tao
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 4080 - 4088
  • [5] Hierarchical Graph Neural Networks for Few-Shot Learning
    Chen, Cen
    Li, Kenli
    Wei, Wei
    Zhou, Joey Tianyi
    Zeng, Zeng
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2022, 32 (01) : 240 - 252
  • [6] Chauhan J, 2020, Arxiv, DOI arXiv:2002.12815
  • [7] Chen J, 2018, Arxiv, DOI arXiv:1801.10247
  • [8] Fallah A, 2020, PR MACH LEARN RES, V108, P1082
  • [9] Finn C, 2017, Arxiv, DOI arXiv:1703.03400
  • [10] Finn C, 2017, PR MACH LEARN RES, V70