Link key candidate extraction with relational concept analysis

Manuel Atencia 1 Jérôme David 1 Jérôme Euzenat 1 Amedeo Napoli 2 Jérémy Vizzini 1
1 MOEX - Evolution de la connaissance
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : Linked data aims at publishing data expressed in RDF (Resource Description Framework) at the scale of the worldwide web. These datasets interoperate by publishing links which identify individuals across heterogeneous datasets. Such links may be found by using a generalisation of keys in databases, called link keys, which apply across datasets. They specify the pairs of properties to compare for linking individuals belonging to different classes of the datasets. Here, we show how to recast the proposed link key extraction techniques for RDF datasets in the framework of formal concept analysis. We define a formal context, where objects are pairs of resources and attributes are pairs of properties, and show that formal concepts correspond to link key candidates. We extend this characterisation to the full RDF model including non functional properties and interdependent link keys. We show how to use relational concept analysis for dealing with cyclic dependencies across classes and hence link keys. Finally, we discuss an implementation of this framework.
Document type :
Journal articles
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download
Contributor : Jérôme Euzenat <>
Submitted on : Monday, July 29, 2019 - 2:16:49 PM
Last modification on : Wednesday, July 31, 2019 - 1:03:29 AM


Files produced by the author(s)



Manuel Atencia, Jérôme David, Jérôme Euzenat, Amedeo Napoli, Jérémy Vizzini. Link key candidate extraction with relational concept analysis. Discrete Applied Mathematics, 2019, ⟨10.1016/j.dam.2019.02.012⟩. ⟨hal-02196757⟩



Record views


Files downloads