arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.09299cs.DB
收藏

关联数据的分布式整体聚类

Distributed Holistic Clustering on Linked Data

Markus Nentwig, Anika Groß, Maximilian Möller, Erhard Rahm

摘要:

链接发现是支持数据网络中数据集成的一个活跃研究领域。由于可用数据源的巨大规模和数量,高效和有效的链路发现是一项非常具有挑战性的任务。常见的成对链路发现方法不能扩展到具有非常大的实体集的许多源。在这里,我们提出了一个分布式的整体方法来连接许多数据源的基础上,代表同一个现实世界的对象的实体的集群。我们的聚类方法提供了一个紧凑和融合的实体表示,并可以识别现有的链接以及许多新的链接中的错误。我们支持分布式执行的集群方法,以实现更快的执行时间和可扩展性的大型现实世界的数据集。我们提供了一个新的黄金标准,多源聚类,并评估我们的方法的有效性和效率方面的大型数据集的地理和音乐领域。

英文摘要:

Link discovery is an active field of research to support data integration in the Web of Data. Due to the huge size and number of available data sources, efficient and effective link discovery is a very challenging task. Common pairwise link discovery approaches do not scale to many sources with very large entity sets. We here propose a distributed holistic approach to link many data sources based on a clustering of entities that represent the same real-world object. Our clustering approach provides a compact and fused representation of entities, and can identify errors in existing links as well as many new links. We support a distributed execution of the clustering approach to achieve faster execution times and scalability for large real-world data sets. We provide a novel gold standard for multi-source clustering, and evaluate our methods with respect to effectiveness and efficiency for large data sets from the geographic and music domains.

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

↑