Non-Redundant Link Keys in RDF Data: Preliminary Steps - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Non-Redundant Link Keys in RDF Data: Preliminary Steps

Nacira Abbas
Alexandre Bazin
Jérôme David
  • Fonction : Auteur
  • PersonId : 845592
Amedeo Napoli

Résumé

A link key between two RDF datasets D1 and D2 is a set ofpairs of properties allowing to identify pairs of individuals, say x1 in D1 and x2 in D2, which can be materialized as ax1owl:sameAs x2 identity link. There exist several ways to mine such link keys but no one takes into account the fact that owl:sameAs is an equivalence relation, which leads to the discovery of non-redundant link keys. Accordingly, in this paper, we present the link key discovery based on Pattern Structures(PS). PS output a pattern concept lattice where every concept has an extent representing a set of pairs of individuals and an intent representing the related link key candidate. Then, we discuss the equivalence relation in duced by a link key and we introduce the notion of non-redundant link key candidate.
Fichier principal
Vignette du fichier
paper12.pdf (685.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03482955 , version 1 (16-12-2021)

Identifiants

  • HAL Id : hal-03482955 , version 1

Citer

Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli. Non-Redundant Link Keys in RDF Data: Preliminary Steps. FCA4AI 2021 - 9th Workshop on What can FCA do for Artificial Intelligence?, Aug 2021, Montréal/Online, Canada. pp.1-6. ⟨hal-03482955⟩
51 Consultations
36 Téléchargements

Partager

Gmail Facebook X LinkedIn More