Sorted Neighborhood for the Semantic Web

Authors

  • Mayank Kejriwal University of Texas at Austin

DOI:

https://doi.org/10.1609/aaai.v29i1.9707

Keywords:

Data Matching, Linked Data, Semantic Web, Entity Resolution

Abstract

Entity Resolution (ER) concerns identifying logically equivalent entity pairs across databases. To avoid quadratic pairwise comparisons of entities, blocking methods are used. Sorted Neighborhood is an established blocking method for relational databases. It has not been applied on graph-based data models such as the Resource Description Framework (RDF). This poster presents a modular workflow for applying Sorted Neighborhood to RDF. Real-world evaluations demonstrate the workflow's utility against a popular baseline.

Downloads

Published

2015-03-04

How to Cite

Kejriwal, M. (2015). Sorted Neighborhood for the Semantic Web. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9707