Sorted Neighborhood for Schema-free RDF Data thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Sorted Neighborhood for Schema-free RDF Data

Published on Jul 15, 20151563 Views

Entity Resolution (ER) concerns identifying pairs of entities that refer to the same underlying entity. To avoid O (n2) pairwise comparison of n entities, blocking methods are used. S

Related categories

Chapter list

Sorted Neighborhood for Schema-free RDF Data00:00
Instance Matching - 100:18
Instance Matching - 201:01
Primary Application: Linked Open Data01:27
EfficientInstance Matching02:28
A Two-step Instance Matcher - 103:54
A Two-step Instance Matcher - 204:33
Traditional Sorted Neighborhood04:55
How do we implement SN for schema-free RDF use-cases?07:37
Key Intuitions08:28
Proposed Workflow09:57
Constructing the SPARQL query11:57
Example:Constructing the SPARQL query12:45
Property Table13:56
Modified Sorted Neighborhood14:29
Example:Sliding window with w=216:07
Recap: proposed system16:41
Experiments: Datasets and Baselines17:05
Experiments: Metrics18:25
Results19:21
Conclusion20:19