Complete feature learning and consistent relation modeling for few-shot knowledge graph completion

被引:6
作者
Liu, Jin [1 ]
Fan, Chongfeng [1 ]
Zhou, Fengyu [1 ]
Xu, Huijuan [2 ]
机构
[1] Shandong Univ, Jinan, Peoples R China
[2] Penn State Univ, Philadelphia, PA USA
关键词
Knowledge graph completion; Few-shot knowledge graph embedding; Complete Feature Learning; Relation modeling;
D O I
10.1016/j.eswa.2023.121725
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Few-shot knowledge graph completion focuses on predicting unseen facts of long-tail relations in knowledge graphs with only few reference sets. The key challenge for tackling this task is how to represent the complete entity features under low data regime conditions and further build the relation scoring function of the triplet for prediction. However, existing works mainly focus on aggregating entity representations and seriously ignore the process of consistent relation modeling, resulting in unsatisfactory performance on sparse neighbors and complex relations modeling. To address the issues, this paper designs a two-branch feature extractor to capture complementary and complete representation of entities for differentiating the few examples, where each branch focuses on diverse aspect of the entity features. Furthermore, we apply a diversity loss based on the minimization of cosine similarity is applied between the two-branch feature extractors to encourage the two-branch to learn complementary features. Conditioned on the entity features, we further incorporate the structural relation representation into the semantic relation learning to keep the consistent with triplet scoring function, and consider the consistency issue of various structural relation modeling between training and test generalization. Empirical results on two public benchmark datasets NELL-One and Wiki-One demonstrate that our approach outperforms the state-of-the-art results, with relative improvements on Hits@10 for 1-shot of 4.8% and 4.4%, respectively, and achieves new state-of-the-art results. Additionally, Extensive experiments also show proficiency in dealing with complex relations and sparse neighbors.
引用
收藏
页数:10
相关论文
共 45 条
[1]   RECON: Relation Extraction using Knowledge Graph Context in a Graph Neural Network [J].
Bastos, Anson ;
Nadgeri, Abhishek ;
Singh, Kuldeep ;
Mulang, Isaiah Onando ;
Shekarpour, Saeedeh ;
Hoffart, Johannes ;
Kaul, Manohar .
PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, :1673-1685
[2]  
Bordes A., 2011, P NATL C ARTIF INTEL, V1, P301, DOI DOI 10.1609/AAAI.V25I1.7917
[3]  
Bordes A., 2013, Adv. Neural Inf. Process. Syst., V26
[4]  
Carlson A, 2010, AAAI CONF ARTIF INTE, P1306
[5]  
Castellano G., 2022, Knowledge-Based Systems
[6]  
Chang Kai- Wei, 2014, P 2014 C EMPIRICAL M, P1568
[7]  
Chen MY, 2019, 2019 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND THE 9TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (EMNLP-IJCNLP 2019), P4217
[8]   KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization for Relation Extraction [J].
Chen, Xiang ;
Zhang, Ningyu ;
Xie, Xin ;
Deng, Shumin ;
Yao, Yunzhi ;
Tan, Chuanqi ;
Huang, Fei ;
Si, Luo ;
Chen, Huajun .
PROCEEDINGS OF THE ACM WEB CONFERENCE 2022 (WWW'22), 2022, :2778-2788
[9]  
Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811
[10]   MuKEA: Multimodal Knowledge Extraction and Accumulation for Knowledge-based Visual Question Answering [J].
Ding, Yang ;
Yu, Jing ;
Liu, Bang ;
Hu, Yue ;
Cui, Mingxin ;
Wu, Qi .
2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, :5079-5088