Sorted Neighborhood for the Semantic Web

Kejriwal, Mayank (University of Texas at Austin)

AAAI Conferences 

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. Entity Resolution (ER) is the abstract problem of identifying Figure 1: A simple instance of ER in an RDF graph pairs of entities across databases that are syntactically disparate but logically equivalent. The problem goes by multiple names in the AI community, examples being record Table 1: Tuples sorted using blocking key values (BKVs) linkage, instance matching, and coreference resolution (Elmagarmid, ID First Name Last Name Zip BKV Ipeirotis, and Verykios 2007).

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found