Computer Engineering and Applications ›› 2022, Vol. 58 ›› Issue (15): 202-209.DOI: 10.3778/j.issn.1002-8331.2112-0057

• Pattern Recognition and Artificial Intelligence • Previous Articles     Next Articles

Temporal Aware Approach for Dynamic Knowledge Graph Completion

LI Fengying, FAN Weihao   

  1. Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, Guangxi 541004, China
  • Online:2022-08-01 Published:2022-08-01



  1. 桂林电子科技大学 广西可信软件重点实验室,广西 桂林 541004

Abstract: Most current approaches for dynamic knowledge graph completion embed temporal dimension into entities or relations. In other words, quaternions are reduced into triples to be completed in the theory of static knowledge graph completion. However, static knowledge graph completion approaches usually focus on entities and relations, which ignore the role of temporal information in the quaternions. Meanwhile, there are sparsity and irregularity in the temporal representation within the knowledge base. To address the above problems, a temporal aware encoder and a temporal convolutional decoder are proposed in this paper. The temporal aware encoder embeds temporal entities, relations and times as same scale vectors and extracts features of quaternions by an improved graph convolutional networks. The temporal convolutional decoder is improved by convolutional neural networks. And it evaluates featrures of the quaternions extracted by the encoder for link prediction. Proposed approach provides more accurate features of time dimension and improves the performance of the completion in temporal knowledge graph. Experiments verify the effectiveness of the proposed work on ICEWS14, ICEWS05-15, Wikidata12k and YAGO11k datasets. Even more, the proposed approach makes a significant improvement in link prediction.

Key words: temporal knowledge graph completion, link prediction, graph convolutional networks, attentional mechanism

摘要: 针对动态知识图谱的补全方法大多将时间维度内嵌于实体或关系中,将四元组降维成三元组后以静态知识图谱补全理论进行补全。静态补全方法通常只对实体关系建模,忽略了时间信息在四元组中的重要作用。同时知识库内时间表述存在稀疏性和不规则性。针对以上问题,提出了时序感知编码器和时序卷积解码器。时序感知编码器将时间维度同实体和关系嵌入为同规模向量,通过改进的图卷积神经网络实现四元组的特征提取。针对时序编码器特征提取后的四元组向量,时序卷积解码器利用卷积神经网络评估全局关系以进行链接预测。所提出的方法可以提供更精确的时间维度特征,提升补全时序图谱的性能。在ICEWS14、ICEWS05-15、Wikidata12k和YAGO11k数据集上的实验验证了提出方法的有效性,同时链接预测效果较优。

关键词: 动态知识图谱补全, 链接预测, 图卷积神经网络, 注意力机制