首页> 外文期刊>Neurocomputing >Representation learning over multiple knowledge graphs for knowledge graphs alignment
【24h】

Representation learning over multiple knowledge graphs for knowledge graphs alignment

机译:通过多个知识图的表示学习来进行知识图对齐

获取原文
获取原文并翻译 | 示例
       

摘要

The goal of representation learning of knowledge graph is to encode both entities and relations into a low-dimensional embedding spaces. Mostly current works have demonstrated the benefits of knowledge graph embedding in single knowledge graph completion, such as relation extraction. The most significant distinction between multiple knowledge graphs embedding and single knowledge graph embedding is that the former must consider the alignments between multiple knowledge graphs which is very helpful to some applications built on multiple KGs, such as KB-QA and KG integration. In this paper, we proposed a new automatic representation learning model over Multiple Knowledge Graphs (MGTransE) by adopting a bootstrapping method. More specifically, MGTransE consists of three core components: Structure Model, Semantically Smooth Embedding Model and Iterative Smoothness Model. The experiment results on two real-world datasets show that our method achieves better performance on two new multiple KGs tasks compared with state-of-the-art KG embedding models and also preserves the key properties of knowledge graph embedding on traditional single KG tasks as compared to those methods learned from single KG. (C) 2018 Elsevier B.V. All rights reserved.
机译:知识图的表示学习的目标是将实体和关系都编码为低维的嵌入空间。大多数当前的工作已经证明了将知识图嵌入到单个知识图完成中的好处,例如关系提取。多个知识图嵌入和单个知识图嵌入之间最显着的区别在于,前者必须考虑多个知识图之间的对齐方式,这对基于多个KG的某些应用程序(例如KB-QA和KG集成)非常有帮助。在本文中,我们通过采用自举方法,提出了一种新的基于多知识图(MGTransE)的自动表示学习模型。更具体地说,MGTransE由三个核心组件组成:结构模型,语义平滑嵌入模型和迭代平滑性模型。在两个真实世界数据集上的实验结果表明,与最新的KG嵌入模型相比,我们的方法在两个新的多个KG任务上实现了更好的性能,并且保留了传统传统KG任务上知识图嵌入的关键特性,例如与从单个幼稚园学到的方法相比。 (C)2018 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号