Entity-Context and Relation-Context Combined Knowledge Graph Embeddings

被引:0
作者
Yong Wu
Wei Li
Xiaoming Fan
Binjun Wang
机构
[1] People’s Public Security University of China,School of Information Technology and Cyber Security
[2] Queensland University of Technology,School of Chemistry and Physics
来源
Arabian Journal for Science and Engineering | 2022年 / 47卷
关键词
Knowledge graphs; Hierarchical structures; Link prediction; Graph convolution network;
D O I
暂无
中图分类号
学科分类号
摘要
Hierarchical structures are very common in knowledge graphs, and semantic hierarchy-preserved knowledge graph embeddings have achieved promising results in the knowledge graph link prediction task. However, handling one-to-many, many-to-one, and many-to-many relations that can provide hierarchical information is challenging and brings entity indistinguishability issues. To address this limitation, this paper proposes a novel knowledge graph embedding model, namely Entity-context and Relation-context combined Knowledge Graph Embeddings (ERKE), in which each relation is defined as a rotation with variable moduli from the source entity to the target entity in the polar coordinate system. It can be seen as a combination of two spaces—modulus space and phase space. In the modulus space, modulus information is used to model semantic hierarchies, and entity-context information is adopted to make node representations more expressive. Besides, based on the design of the propagation rule of Graph Convolution Network (GCN), a new GCN model suitable for processing semantic hierarchies in knowledge graphs is proposed. In the phase space, relation-context information is used to make entities easier to distinguish. Specifically, a rotation operation in the polar coordinate system is transformed to the addition operation in the rectangular coordinate system, and relations between entities are mapped into their entity-specific hyperplanes. The proposed method is verified by the experiments on three benchmark datasets, and experimental results demonstrate that the proposed method can learn the semantic hierarchies in knowledge graphs and improve the prediction accuracy of complex one-to-many, many-to-one, and many-to-many cases simultaneously.
引用
收藏
页码:1471 / 1482
页数:11
相关论文
empty
未找到相关数据