Uncertainty-sensitive reasoning for inferring sameAs facts in linked data - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Uncertainty-sensitive reasoning for inferring sameAs facts in linked data

Abstract

Discovering whether or not two URIs described in Linked Data -- in the same or different RDF datasets -- refer to the same real-world entity is crucial for building applications that exploit the cross-referencing of open data. A major challenge in data interlinking is to design tools that effectively deal with incomplete and noisy data, and exploit uncertain knowledge. In this paper, we model data interlinking as a reasoning problem with uncertainty. We introduce a probabilistic framework for modelling and reasoning over uncertain RDF facts and rules that is based on the semantics of probabilistic Datalog. We have designed an algorithm, ProbFR, based on this framework. Experiments on real-world datasets have shown the usefulness and effectiveness of our approach for data linkage and disambiguation.
Fichier principal
Vignette du fichier
albakri2016a.pdf (283.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01366296 , version 1 (14-09-2016)

Identifiers

Cite

Mustafa Al-Bakri, Manuel Atencia, Jérôme David, Steffen Lalande, Marie-Christine Rousset. Uncertainty-sensitive reasoning for inferring sameAs facts in linked data. 22nd european conference on artificial intelligence (ECAI), Aug 2016, Der Haague, Netherlands. pp.698-706, ⟨10.3233/978-1-61499-672-9-698⟩. ⟨hal-01366296⟩
344 View
330 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More