Interlinking Linked Data Sources Using a Domain-Independent System [chapter]

Khai Nguyen, Ryutaro Ichise, Bac Le
2013 Lecture Notes in Computer Science  
Linked data interlinking is the discovery of every owl:sameAs links between given data sources. An owl:sameAs link declares the homogeneous relation between two instances that co-refer to the same real-world object. Traditional methods compare two instances by predefined pairs of RDF predicates, and therefore they rely on the domain of the data. Recently, researchers have attempted to achieve the domainindependent goal by automatically building the linkage rules. However they still require the
more » ... uman curation for the labeled data as the input for learning process. In this paper, we present SLINT+, an interlinking system that is training-free and domain-independent. SLINT+ finds the important predicates of each data sources and combines them to form predicate alignments. The most useful alignments are then selected in the consideration of their confidence. Finally, SLINT+ uses selected predicate alignments as the guide for generating candidate and matching instances. Experimental results show that our system is very efficient when interlinking data sources in 119 different domains. The very considerable improvements on both precision and recall against recent systems are also reported.
doi:10.1007/978-3-642-37996-3_8 fatcat:haui2ti5zna6hachqqwpyqbfzu