SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

Published on Sep 27, 20133365 Views

The Internet has enabled the creation of a growing number of large-scale knowledge bases in a variety of domains containing complementary information. Tools for automatically aligning these knowledge

Related categories

Chapter list

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases00:00
Motivation: merging knowledge bases00:11
Linking open data project00:57
Outline01:23
Formalization: knowledge base alignment01:41
Current approaches04:58
Motivating example & intuition05:55
Quadratic Assigment objective07:36
Simple Greedy Matching (SiGMa)10:07
Experiments: 1) Large-Scale KBs15:00
Experiments: 2) benchmarks17:11
When should you use SiGMa?17:50
Conclusions & future work17:56
Thanks for listening!19:19