首页> 外文会议>IEEE International Congress on Big Data >Holistic entity matching across knowledge graphs
【24h】

Holistic entity matching across knowledge graphs

机译:整体实体符合知识图形的匹配

获取原文

摘要

Entity matching is the problem of determining if two entities in a data set refer to the same real-world object. In the last decade a growing number of large-scale knowledge bases have been created online. Tools for automatically aligning these sources would make it possible to unify them in a structured knowledge and to answer complex queries. Here we present Holistic Entity Matching (HolisticEM), an algorithm based on Personalized Page Rank for aligning instances in large knowledge bases. It consists of two steps. First, a graph of potential matching pairs is constructed; second, local and global information from the relationship graph is propagated via Personalized Page Rank. We demonstrate that HolisticEM performs competitively and can efficiently handle databases with 110M and 203M entities accurately resolving 1.6M of matching entity pairs.
机译:实体匹配是确定数据集中是否有两个实体的问题,请参阅相同的真实对象。在过去的十年中,已经在线创建了越来越多的大型知识库。自动对齐这些源的工具将使它们可以在结构化知识中统一,并回答复杂的查询。在这里,我们呈现整体实体匹配(HOLISTICEM),这是一种基于个性化页面的算法,用于对齐大知识库的对齐实例。它由两个步骤组成。首先,构建潜在匹配对的图表;第二,来自关系图中的本地和全局信息通过个性化页面传播。我们展示全能竞争性地执行,可以高效地处理110米和203M实体的数据库,准确地解析1.6M匹配实体对。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号