首页> 外文期刊>Expert Systems with Application >SDT: An integrated model for open-world knowledge graph reasoning
【24h】

SDT: An integrated model for open-world knowledge graph reasoning

机译:SDT:开放世界知识图推理的综合模型

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

摘要

Knowledge graphs (KGs) have a wide range of applications, such as recommender systems, relation extraction, and intelligent question answering systems. However, existing KGs are far from complete. Knowledge graph reasoning (KGR) has been studied to complete KGs by inferring missing entities or relations. But most previous methods require that all entities should be seen during training, which is impractical for real-world KGs with new entities emerging daily. In this paper, we address the open-world KGR task: how to perform reasoning when entities are not observed at training time. The description-embodied knowledge representation learning (DKRL) model attempts to study the open-world KGR task. We find that DKRL does not consider hierarchical type information contained in entities when learning entities and relations representations, which results in poor performance. To address this problem, we propose a novel model, SDT, that incorporates the structural information, entity descriptions, and hierarchical type information of entities into a unified framework to learn more representative embeddings for KGs. Specifically, for entity descriptions, we explore continuous bag-of-words and convolutional neural networks models to encode the semantics of entity representations. For hierarchical types, we utilize a recursive hierarchy encoder and a weighted hierarchy encoder to construct the projection matrices of hierarchical types. We evaluate the SDT model on both open-world and closed-world reasoning tasks, including entity prediction and relation prediction. Experimental results on large-scale datasets show that SDT achieves a lower mean rank and higher Hits@10 than the baseline methods.
机译:知识图表(KGS)具有广泛的应用,例如推荐系统,关系提取和智能问题应答系统。但是,现有的公斤远非完整。知识图形推理(KGR)已经通过推断出缺失的实体或关系来完成KGs。但最先前的方法要求在培训期间可以看到所有实体,这对于每天新的新实体的现实世界KGS是不切实际的。在本文中,我们解决了开放世界的KGR任务:如何在培训时间未观察到实体时进行推理。描述体现的知识表示学习(DKRL)模型试图研究开放式世界KGR任务。我们发现,当学习实体和关系表示时,DKRL不考虑实体中包含的分层类型信息,从而导致性能不佳。为了解决这个问题,我们提出了一种新颖的模型,SDT,它将实体的结构信息,实体描述和分层类型信息纳入统一的框架,以了解kgs的更多代表性嵌入。具体而言,对于实体描述,我们探索连续的单词和卷积神经网络模型来编码实体表示的语义。对于分层类型,我们利用递归层级编码器和加权层次编码器来构造分层类型的投影矩阵。我们评估开放世界和封闭世界推理任务的SDT模型,包括实体预测和关系预测。大规模数据集的实验结果表明,SDT实现了比基线方法更低的平均等级和更高的击球。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号