Few-shot Heterogeneous Graph Learning via Cross-domain Knowledge Transfer

被引:15
作者
Zhang, Qiannan [1 ]
Wu, Xiaodong [1 ]
Yang, Qiang [1 ]
Zhang, Chuxu [2 ]
Zhang, Xiangliang [1 ,3 ]
机构
[1] King Abdullah Univ Sci & Technol, Thuwal, Saudi Arabia
[2] Brandeis Univ, Waltham, MA 02254 USA
[3] Univ Notre Dame, Notre Dame, IN 46556 USA
来源
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022 | 2022年
关键词
Heterogeneous Graphs; Few-shot Learning; Knowledge Transfer;
D O I
10.1145/3534678.3539431
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph few-shot learning seeks to alleviate the label scarcity problem resulting from the difficulties and high cost of data annotations in graph learning. However, the overwhelming solutions in graph few-shot learning focus on homogeneous graphs, ignoring the ubiquitous heterogeneous graphs (HGs), which represent real-world complex systems and domain knowledge with multi-typed nodes interconnected by multi-typed edges. To this end, we study the crossdomain few-shot learning problem over HGs and develop a novel model for Cross-domain Heterogeneous Graph Meta-learning (CrossHG-Meta). The general idea is to promote the HG node classification in the data-scarce target domain by transferring metaknowledge from a series of HGs in data-rich source domains. The key challenges are to 1) combat the heterogeneity in HGs to acquire the transferable meta-knowledge; 2) handle the domain shifts between the source HG and target HG; and 3) fast adapt to novel target tasks with few-shot annotated examples. Regarding the graph heterogeneity, CrossHG-Meta firstly builds a graph encoder to aggregate heterogeneous neighborhood information from multiple semantic contexts. Secondly, to tackle domain shifts, a cross-domain meta-learning strategy is proposed to include a domain critic, which is designed to explicitly lead cross-domain adaptation for metatasks in different domains and improve model generalizability. Last, to further alleviate data scarcity, CrossHG-Meta leverages unlabeled information in source domains with auxiliary self-supervised learning task to provide cross-domain contrastive regularization alongside the meta-optimization process to facilitate node embedding. Extensive experimental results on three multi-domain HG datasets demonstrate that the proposed model outperforms various state-of-the-art baselines for multiple few-shot node classification tasks under the cross-domain setting.
引用
收藏
页码:2450 / 2460
页数:11
相关论文
共 44 条
[1]  
[Anonymous], 2015, KDD 15 P 21 ACM SIGK, DOI DOI 10.1145/2783258.2783381
[2]  
[Anonymous], 2019, ICML
[3]  
Bose Avishek Joey, 2019, ARXIV191209867
[4]  
Dai Quanyu, 2020, TNNLS
[5]   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
[6]   metapath2vec: Scalable Representation Learning for Heterogeneous Networks [J].
Dong, Yuxiao ;
Chawla, Nitesh V. ;
Swami, Ananthram .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :135-144
[7]  
Du Yingjun, 2020, ICLR
[8]  
Finn C, 2017, PR MACH LEARN RES, V70
[9]   HIN2Vec: Explore Meta-paths in Heterogeneous Information Networks for Representation Learning [J].
Fu, Tao-yang ;
Lee, Wang-Chien ;
Lei, Zhen .
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, :1797-1806
[10]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864