arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.02593cs.AIcs.LG
收藏

知识图谱中的类型约束表示学习

Type-Constrained Representation Learning in Knowledge Graphs

Siemens AG(西门子股份公司);Ludwig Maximilian University(路德维希-马克西米利安大学)

Denis Krompaß, Stephan Baier, Volker Tresp

摘要:

大型知识图谱越来越多地为需要机器识别和理解查询及其语义的各种应用增加价值,如在搜索或问答系统中。潜变量模型在知识图谱的统计建模中得到了越来越多的关注,在与知识图谱完成和清洗相关的任务中显示出有希望的结果。除了存储有关世界的事实外,基于模式的知识图谱还得到实体和关系类型的丰富语义描述的支持,使机器能够理解事物的概念及其语义关系。在这项工作中,我们研究了如何类型约束可以支持统计建模与潜变量模型。更确切地说,我们集成了现有知识的形式类型的约束,在各种国家的最先进的潜变量的方法。我们的实验结果表明,先验知识的关系类型显着提高这些模型的链接预测任务高达77%。当执行低模型复杂性时,所实现的改进尤其突出,这是将这些模型应用于非常大的数据集时的关键要求。不幸的是,类型约束既不总是可用的,也不总是完整的,例如,当实体缺少正确的类型时,它们可能变得模糊。我们表明,在这些情况下,它可以是有益的,应用一个本地的封闭世界的假设,近似的语义关系类型的基础上,在数据中的观察。

英文摘要:

Large knowledge graphs increasingly add value to various applications that require machines to recognize and understand queries and their semantics, as in search or question answering systems. Latent variable models have increasingly gained attention for the statistical modeling of knowledge graphs, showing promising results in tasks related to knowledge graph completion and cleaning. Besides storing facts about the world, schema-based knowledge graphs are backed by rich semantic descriptions of entities and relation-types that allow machines to understand the notion of things and their semantic relationships. In this work, we study how type-constraints can generally support the statistical modeling with latent variable models. More precisely, we integrated prior knowledge in form of type-constraints in various state of the art latent variable approaches. Our experimental results show that prior knowledge on relation-types significantly improves these models up to 77% in link-prediction tasks. The achieved improvements are especially prominent when a low model complexity is enforced, a crucial requirement when these models are applied to very large datasets. Unfortunately, type-constraints are neither always available nor always complete e.g., they can become fuzzy when entities lack proper typing. We show that in these cases, it can be beneficial to apply a local closed-world assumption that approximates the semantics of relation-types based on observations made in the data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑