首页> 外文期刊>World Wide Web >Open-world knowledge graph completion with multiple interaction attention
【24h】

Open-world knowledge graph completion with multiple interaction attention

机译:开放式世界知识图表完成多次交互关注

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

摘要

Knowledge Graph Completion (KGC) aims at complementing missing relationships between entities in a Knowledge Graph (KG). While closed-world KGC approaches utilizing the knowledge within KG could only complement very limited number of missing relations, more and more approaches tend to get knowledge from open-world resources such as online encyclopedias and newswire corpus. For instance, a recent proposed open-world KGC model called ConMask learns embeddings of the entity's name and parts of its text-description to connect unseen entities to the KGs. However, this model does not make full use of the rich feature information in the text descriptions, besides, the proposed relationship-dependent content masking method may easily miss to find the target-words. In this paper, we propose to use a Multiple Interaction Attention (MIA) mechanism to model the interactions between the head entity description, head entity name, the relationship name, and the candidate tail entity descriptions, to form the enriched representations. In addition, we try to use the additional textual features of head entity descriptions to enhance the head entity representation and apply the attention mechanism between candidate tail entities to enhance the representation of them. Besides, we try different scoring functions to increase the convergence of the model. Our empirical study conducted on three real-world data collections shows that our approach achieves significant improvements comparing to state-of-the-art KGC methods.
机译:知识图表完成(KGC)旨在补充知识图中的实体之间的缺失关系。虽然利用KG内的知识的封闭式KGC方法只能补充非常有限的缺失关系,但越来越多的方法倾向于从开放世界资源等知识,如在线百科全书和新闻记语料库。例如,最近提出的开放式世界KGC型号名为Conmask,了解实体的名称和其文本的部分的嵌入式,以便将解密的实体连接到KG。但是,此模型不会在文本描述中充分利用丰富的功能信息,此外,所提出的关系依赖性内容屏蔽方法可能很容易错过找到目标词。在本文中,我们建议使用多个交互关注(MIA)机制来模拟头部实体描述,头实体名称,关系名称和候选尾部实体描述之间的交互,以形成丰富的表示。此外,我们尝试使用头实体描述的附加文本特征来增强头部实体表示,并应用候选尾部实体之间的注意机制,以增强它们的表示。此外,我们尝试不同的评分功能来增加模型的融合。我们对三个现实世界数据收集进行的实证研究表明,我们的方法实现了与最先进的KGC方法相比的显着改进。

著录项

  • 来源
    《World Wide Web》 |2021年第1期|419-439|共21页
  • 作者单位

    Institute of Artificial Intelligence School of Computer Science and Technology Soochow University Suzhou China;

    Institute of Artificial Intelligence School of Computer Science and Technology Soochow University Suzhou China;

    King Abdullah University of Science and Technology Jeddah Saudi Arabia;

    Institute of Artificial Intelligence School of Computer Science and Technology Soochow University Suzhou China iFLYTEK Research Suzhou China;

    State Key Laboratory of Cognitive Intelligence iFLYTEK Suzhou China;

    Anhui Toycloud Technology Hefei China;

    School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China School of Computer Science and Technology Shandong University of Technology Shandong China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Knowledge graph completion; Attention; Open-world;

    机译:知识图完成;注意力;开放世界;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号