Skip to Main content Skip to Navigation
Conference papers

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

Simon Lacoste-Julien 1 Konstantina Palla 2 Alex Davies 2 Gjergji Kasneci 3 Thore Graepel 4 Zoubin Ghahramani 2 
1 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : 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 bases would make it possible to unify many sources of structured knowledge and answer complex queries. However, the efficient alignment of large-scale knowledge bases still poses a considerable challenge. Here, we present Simple Greedy Matching (SiGMa), a simple algorithm for aligning knowledge bases with millions of entities and facts. SiGMa is an iterative propagation algorithm that leverages both the structural information from the relationship graph and flexible similarity measures between entity properties in a greedy local search, which makes it scalable. Despite its greedy nature, our experiments indicate that SiGMa can efficiently match some of the world's largest knowledge bases with high accuracy. We provide additional experiments on benchmark datasets which demonstrate that SiGMa can outperform state-of-the-art approaches both in accuracy and efficiency.
Complete list of metadata
Contributor : Simon Lacoste-Julien Connect in order to contact the contributor
Submitted on : Saturday, December 14, 2013 - 3:28:48 AM
Last modification on : Thursday, March 17, 2022 - 10:08:44 AM
Long-term archiving on: : Tuesday, March 18, 2014 - 1:20:41 PM


Explicit agreement for this submission




Simon Lacoste-Julien, Konstantina Palla, Alex Davies, Gjergji Kasneci, Thore Graepel, et al.. SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases. KDD 2013 - The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug 2013, Chicago, United States. pp.572-580, ⟨10.1145/2487575.2487592⟩. ⟨hal-00918671⟩



Record views


Files downloads