0.25
0.5
0.75
1.25
1.5
1.75
2
The Lazy Traveling Salesman - Memory Management for Large - Scale Link Discovery
Published on Jul 28, 20161399 Views
Links between knowledge bases build the backbone of the Linked Data Web. In previous works, several time-efficient algorithms have been developed for computing links between knowledge bases. Most of t
Related categories
Chapter list
The Lazy Traveling Salesman Memory Management for Large-Scale Link Discovery00:00
Link Discovery00:18
Why is it dificult?01:56
Problem03:13
Goal04:18
GNOME - 105:08
Task Graph08:18
GNOME - 208:59
Problem Reformulation10:03
Step 1: Clustering - 110:53
Step 1: Clustering - 212:27
Untitled13:18
Step 2: Scheduling - 214:37
Step 2: Scheduling - 316:13
Experimental Setup17:17
Evaluation of Clustering - 117:44
Evaluation of Clustering - 218:25
Evaluation of Scheduling18:36
GNOME vs. Caching Approaches19:04
Scalability19:48
Conclusion and Future Work20:54
Thank you21:51