KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification

被引:0
作者
Wu, Likang [1 ,2 ]
Jiang, Junji [3 ]
Zhao, Hongke [4 ]
Wang, Hao [1 ,2 ]
Lian, Defu [1 ,2 ]
Zhang, Mengdi [5 ]
Chen, Enhong [1 ,2 ]
机构
[1] Univ Sci & Technol China, Hefei, Anhui, Peoples R China
[2] State Key Lab Cognit Intelligence, Hefei, Peoples R China
[3] Fudan Univ, Shanghai, Peoples R China
[4] Tianjin Univ, Tianjin, Peoples R China
[5] Meituan Dianping Grp, Beijing, Peoples R China
来源
PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023 | 2023年
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis. This task aims to predict nodes from unseen classes which are unobserved in the training process. Existing work mainly utilizes Graph Neural Networks (GNNs) to associate features' prototypes and labels' semantics thus enabling knowledge transfer from seen to unseen classes. However, the multi-faceted semantic orientation in the feature-semantic alignment has been neglected by previous work, i.e. the content of a node usually covers diverse topics that are relevant to the semantics of multiple labels. It's necessary to separate and judge the semantic factors that tremendously affect the cognitive ability to improve the generality of models. To this end, we propose a Knowledge-Aware Multi-Faceted framework (KMF) that enhances the richness of label semantics via the extracted KG (Knowledge Graph)-based topics. And then the content of each node is reconstructed to a topic-level representation that offers multi-faceted and fine-grained semantic relevancy to different labels. Due to the particularity of the graph's instance (i.e., node) representation, a novel geometric constraint is developed to alleviate the problem of prototype drift caused by node information aggregation. Finally, we conduct extensive experiments on several public graph datasets and design an application of zero-shot cross-domain recommendation. The quantitative results demonstrate both the effectiveness and generalization of KMF with the comparison of state-of-the-art baselines.
引用
收藏
页码:2361 / 2369
页数:9
相关论文
共 46 条
[1]  
[Anonymous], 2019, NURIPS
[2]  
[Anonymous], 2014, 12 PYTH SCI C, DOI DOI 10.1080/09515089.2013.771241
[3]  
[Anonymous], 2019, ACM SIGKDD 19, DOI DOI 10.1145/3292500.3330931
[4]  
Bhargava A., 2017, J Biodivers Endanger Species, V5, P187, DOI [DOI 10.4172/2332-2543.1000187, 10.4172/2332-2543.1000187]
[5]  
Bojchevski G, 6 ICLR 2018 VANC BC
[6]   Geometric Deep Learning Going beyond Euclidean data [J].
Bronstein, Michael M. ;
Bruna, Joan ;
LeCun, Yann ;
Szlam, Arthur ;
Vandergheynst, Pierre .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) :18-42
[7]  
Chen Ming, 2020, P MACHINE LEARNING R, V119
[8]   Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks [J].
Chiang, Wei-Lin ;
Liu, Xuanqing ;
Si, Si ;
Li, Yang ;
Bengio, Samy ;
Hsieh, Cho-Jui .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :257-266
[9]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[10]  
Endres I., 2009, Computer Vision and Pattern Recognition, P1778