期刊
KNOWLEDGE-BASED SYSTEMS
卷 251, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.knosys.2022.109262
关键词
Multi-relational learning; Knowledge graph completion; Graph neural network; Attention mechanism
资金
- National Natural Science Foundation of China [61977021, 62101179, 62077020]
- Major Project of Hubei Province [2019ACA144]
- School Project of Hubei University [202111903000001, 202011903000002]
- China University Collaborative Innovation Fund [2020ITA05050]
This paper proposes a novel heterogeneous graph neural network framework based on a hierarchical attention mechanism for modeling knowledge graphs. The proposed model achieves outstanding performance on various heterogeneous graph tasks.
Knowledge graphs are multi-relational data that contain massive entities and relations. As an effective graph representation technique based on deep learning, graph neural network has reported outstand-ing performance for modeling knowledge graphs in recent studies. However, previous graph neural network-based models have not fully considered the heterogeneity of knowledge graphs. Furthermore, the attention mechanism has demonstrated its great potential in many areas. In this paper, a novel heterogeneous graph neural network framework based on a hierarchical attention mechanism is proposed, including entity-level, relation-level, and self-level attentions. Thus, the proposed model can selectively aggregate informative features and weights them adequately. Then the learned embeddings of entities and relations can be utilized for the downstream tasks. Extensive experimental results on various heterogeneous graph tasks demonstrate the superior performance of the proposed model compared to several state-of-the-art methods. (C) 2022 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据