【24h】

Multi-step Reasoning for Knowledge Graph Completion

机译:知识图完成的多步推理

获取原文

摘要

Most Knowledge Graphs (KGs) have the problem of missing relationships, although embedding methods that map entities and relationships to low-dimensional spaces can achieve certain results. But they only focus on the direct relationship between entities and ignore the importance of the semantic features of entity types. In addition, a large amount of unstructured text can effectively supplement the semantic information of the Knowledge Graph (KG). In order to solve the problem of scattered knowledge and lack of relationships in the KG, we propose a neural network model which is based on attention mechanism. The model combines the semantic information and the entity type captured by the attention layer to predict the link of tripe. We performed link prediction tasks on public datasets, and under the premise of sufficient data sources, also confirmed that our method is innovative and has research value.
机译:大多数知识图表(kgs)具有缺失关系的问题,尽管嵌入方法将实体和与低维空间的关系映射可以实现某些结果。但他们只关注实体之间的直接关系,忽略实体类型的语义特征的重要性。另外,大量的非结构化文本可以有效地补充知识图(kg)的语义信息。为了解决散落知识的问题和KG中的关系缺乏关系,我们提出了一种基于注意机制的神经网络模型。该模型组合了语义信息和注意力层捕获的实体类型来预测Trave的链接。我们在公共数据集上执行了链接预测任务,在足够的数据源的前提下,还证实了我们的方法是创新的并且具有研究价值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号