ORCHID - Reduction-Ratio-Optimal Computation of Geo-Spatial Distances for Link Discovery thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

ORCHID - Reduction-Ratio-Optimal Computation of Geo-Spatial Distances for Link Discovery

Published on Nov 28, 20134050 Views

The discovery of links between resources within knowledge bases is of crucial importance to realize the vision of the Semantic Web. Addressing this task is especially challenging when dealing with geo

Related categories

Chapter list

Orchid - Reduction-Ratio-Optimal Computation of Geo-Spatial Distances for Link Discovery00:00
Why Link Discovery?00:21
Why is it difficult? - 101:23
Why is it difficult? - 202:53
Linking Geo-Spatial Entities - 103:22
Linking Geo-Spatial Entities - 204:20
Linking Geo-Spatial Entities - 304:35
Linking Geo-Spatial Entities - 404:55
Hausdorff Distance05:05
Bound Approach06:20
Indexed Approach - 107:11
Indexed Approach - 207:54
Indexed Approach - 309:17
ORCHID - 110:14
ORCHID - 210:52
ORCHID - 311:49
Experimental Setup12:18
Results - Runtime - 112:47
Results - Runtime - 213:07
Results - Orchid - 113:20
Results - Orchid - 213:33
Scalability13:54
Conclusion14:16
Thank You14:51