MHEC: One-shot relational learning of knowledge graphs completion based on multi-hop information enhancement

被引:0
|
作者
Ma, Ruixin [1 ,2 ]
Gao, Buyun [1 ,2 ]
Wang, Weihe [1 ,2 ]
Wang, Longfei [1 ,2 ]
Wang, Xiaoru [1 ,2 ]
Zhao, Liang [1 ,2 ]
机构
[1] School of Software Technology, Dalian University of Technology, Dalian, China
[2] The Key Laboratory for Ubiquitous Network and Service of Liaoning Province, Dalian, China
关键词
Contrastive Learning - Federated learning - Graph algorithms - Zero-shot learning;
D O I
10.1016/j.neucom.2024.128760
中图分类号
学科分类号
摘要
With the wide application of knowledge graphs, knowledge graph completion has garnered increasing attention in recent years. However, we find that the long tail relation is more common in the KG. These relations typically do not have a large number of triples for training and are referred to as few-shot relations. The knowledge graph completion in the few-shot scenario is a major challenge currently. The current mainstream knowledge graph completion algorithms have the following drawbacks. The metric-based methods lack interpretability of results, while the algorithms based on path interaction are not suitable for few-shot scenarios and the availability of the model is limited in sparse knowledge graphs. In this paper, we propose a one-shot relational learning of knowledge graphs completion based on multi-hop information enhancement(MHEC). Firstly, MHEC extracts entity concepts from multi-hop paths to obtain task related entity concepts and filters out noisy neighbor attributes. Then, MHEC combines multi-hop path information between head and tail to represent entity pairs. Compared to previous completion methods that only consider structural features of entities, MHEC considers the reasoning logic between entity pairs, which not only includes structural features but also possesses rich semantic features. Next, MHEC introduces a reasoning process in the completion task to address the issues of lack of interpretability in the one-shot scenario. In addition, to improve completion and reasoning quality in sparse knowledge graphs, MHEC utilizes contrastive learning to enhance pre-training vector representations of entities and relations and proposes a matching processor that leverages the semantic information of pre-training vectors to assist the reasoning model in expanding the multi-hop paths. Experiments demonstrate that MHEC outperforms the state-of-the-art completion techniques on real-world datasets NELL-One and FB15k237-One. © 2024 Elsevier B.V.
引用
收藏
相关论文
共 37 条
  • [1] One-Shot Relational Learning for Knowledge Graphs
    Xiong, Wenhan
    Yu, Mo
    Chang, Shiyu
    Guo, Xiaoxiao
    Wang, William Yang
    2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), 2018, : 1980 - 1990
  • [2] One-shot relational learning for extrapolation reasoning on temporal knowledge graphs
    Ma, Ruixin
    Mei, Biao
    Ma, Yunlong
    Zhang, Hongyan
    Liu, Meihong
    Zhao, Liang
    DATA MINING AND KNOWLEDGE DISCOVERY, 2023, 37 (04) : 1591 - 1608
  • [3] One-shot relational learning for extrapolation reasoning on temporal knowledge graphs
    Ruixin Ma
    Biao Mei
    Yunlong Ma
    Hongyan Zhang
    Meihong Liu
    Liang Zhao
    Data Mining and Knowledge Discovery, 2023, 37 : 1591 - 1608
  • [4] TransD-based Multi-hop Meta Learning for Few-shot Knowledge Graph Completion
    Li, Jindi
    Yu, Kui
    Li, Yuling
    Zhang, Yuhong
    2023 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, IJCNN, 2023,
  • [5] One-shot knowledge graph completion based on disentangled representation learning
    Zhang, Youmin
    Sun, Lei
    Wang, Ye
    Liu, Qun
    Liu, Li
    Neural Computing and Applications, 2024, 36 (32) : 20277 - 20293
  • [7] SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs
    Ren, Hongyu
    Dai, Hanjun
    Dai, Bo
    Chen, Xinyun
    Zhou, Denny
    Leskovec, Jure
    Schuurmans, Dale
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 1472 - 1482
  • [8] ONLINE MULTI-HOP INFORMATION BASED KERNEL LEARNING OVER GRAPHS
    Zong, Zixiao
    Shen, Yanning
    2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021), 2021, : 2980 - 2984
  • [9] MetaP: Meta Pattern Learning for One-Shot Knowledge Graph Completion
    Jiang, Zhiyi
    Gao, Jianliang
    Lv, Xinqi
    SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 2232 - 2236
  • [10] A Multi-hop Link Prediction Approach Based on Reinforcement Learning in Knowledge Graphs
    Chen, Heng
    Li, Guanyu
    Sun, Yunhao
    Jiang, Wei
    Chen, Xinying
    2018 11TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 1, 2018, : 165 - 169