Learning high-order structural and attribute information by knowledge graph attention networks for enhancing knowledge graph embedding

被引:5
|
作者
Liu, Wenqiang [1 ]
Cai, Hongyun [1 ]
Cheng, Xu [1 ]
Xie, Sifa [1 ]
Yu, Yipeng [1 ]
Dukehyzhang [1 ]
机构
[1] Tencent Inc, Interact Entertainment Grp, Shenzhen, Peoples R China
关键词
Knowledge graph; Representation learning; Knowledge graph embedding;
D O I
10.1016/j.knosys.2022.109002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The goal of representation learning of knowledge graph is to encode both entities and relations into a low-dimensional embedding space. Many recent works have demonstrated the benefits of knowledge graph embedding on knowledge graph completion task, such as relation extraction. However, we observe that: (1) existing methods simply take direct relations between entities into consideration and fails to express high-order structural relationships between entities; (2) these methods simply leverage relation triples of Knowledge Graphs while ignoring a large number of attribute triples that encode rich semantic information. To overcome these limitations, this paper proposes a novel knowledge graph embedding method, named (KANE), which is inspired by the recent developments in graph convolutional networks (GCN). KANE can capture both high-order structural and attribute information of Knowledge Graphs in an efficient, explicit and unified manner under the graph convolutional networks framework. Empirical results on three datasets show that KANE significantly outperforms seven state-of-the-art methods. Further analysis verify the efficiency of our method and the benefits brought by the attention mechanism. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] Learning to Leverage High-Order Medical Knowledge Graph for Joint Entity and Relation Extraction
    Yang, Zhe
    Huang, Yi
    Feng, Junlan
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2023), 2023, : 9023 - 9035
  • [32] Attention-based Learning for Multiple Relation Patterns in Knowledge Graph Embedding
    Song, Tengwei
    Luo, Jie
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT I, 2022, 13368 : 658 - 670
  • [33] HARPA: hierarchical attention with relation paths for knowledge graph embedding adversarial learning
    Zhang, Naixin
    Wang, Jinmeng
    He, Jieyue
    DATA MINING AND KNOWLEDGE DISCOVERY, 2023, 37 (02) : 521 - 551
  • [34] HARPA: hierarchical attention with relation paths for knowledge graph embedding adversarial learning
    Naixin Zhang
    Jinmeng Wang
    Jieyue He
    Data Mining and Knowledge Discovery, 2023, 37 : 521 - 551
  • [35] HoGRN: Explainable Sparse Knowledge Graph Completion via High-Order Graph Reasoning Network
    Chen, Weijian
    Cao, Yixin
    Feng, Fuli
    He, Xiangnan
    Zhang, Yongdong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (12) : 8462 - 8475
  • [36] PRGNN: Modeling high-order proximity with relational graph neural network for knowledge graph completion
    Zhu, Danhao
    NEUROCOMPUTING, 2024, 594
  • [37] Knowledge Graph Attention Network with Attribute Significance for Personalized Recommendation
    Wang, Chenyu
    Zhang, Haiyang
    Li, Lingxiao
    Li, Dun
    NEURAL PROCESSING LETTERS, 2023, 55 (04) : 5013 - 5029
  • [38] Uncertain Knowledge Graph Embedding Using Auxiliary Information
    Bahaj, Adil
    Ghogho, Mounir
    IEEE ACCESS, 2024, 12 : 138351 - 138361
  • [39] Knowledge Graph Attention Network with Attribute Significance for Personalized Recommendation
    Chenyu Wang
    Haiyang Zhang
    Lingxiao Li
    Dun Li
    Neural Processing Letters, 2023, 55 : 5013 - 5029
  • [40] MKGE: Knowledge graph embedding with molecular structure information
    Zhang, Yi
    Li, Zhouhan
    Duan, Biao
    Qin, Lei
    Peng, Jing
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2022, 100