LINDA
- 29 October 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2104-2108
- https://doi.org/10.1145/2396761.2398582
Abstract
Linked Data has emerged as a powerful way of interconnecting structured data on the Web. However, the cross-linkage between Linked Data sources is not as extensive as one would hope for. In this paper, we formalize the task of automatically creating "sameAs" links across data sources in a globally consistent manner. Our algorithm, presented in a multi-core as well as a distributed version, achieves this link generation by accounting for joint evidence of a match. Experiments confirm that our system scales beyond 100 million entities and delivers highly accurate results despite the vast heterogeneity and daunting scaleKeywords
This publication has 14 references indexed in Scilit:
- Joint Entity ResolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Beyond 100 million entitiesPublished by Association for Computing Machinery (ACM) ,2012
- Scalable and distributed methods for entity matching, consolidation and disambiguation over linked data corporaJournal of Web Semantics, 2012
- PARISProceedings of the VLDB Endowment, 2011
- Block-based load balancing for entity resolution with MapReducePublished by Association for Computing Machinery (ACM) ,2011
- Scalable Iterative Graph Duplicate DetectionIEEE Transactions on Knowledge and Data Engineering, 2011
- Large-scale collective entity matchingProceedings of the VLDB Endowment, 2011
- Frameworks for entity matching: A comparisonData & Knowledge Engineering, 2010
- An Entity Based Model for Coreference ResolutionPublished by Society for Industrial & Applied Mathematics (SIAM) ,2009
- Discovering and Maintaining Links on the Web of DataLecture Notes in Computer Science, 2009