Sandwich: An Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Sandwich: An Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice

Nacira Abbas
Alexandre Bazin
Amedeo Napoli

Résumé

The discovery of link keys between two RDF datasets allows the identification of individuals which share common key characteristics. Actually link keys correspond to closed sets of a specific Galois connection and can be discovered thanks to an FCA-based algorithm. In this paper, given a pattern concept lattice where each concept intent is a link key candidate, we aim at identifying the most relevant candidates w.r.t adapted quality measures. To achieve this task, we introduce the "Sandwich" algorithm which is based on a combination of two dual bottom-up and top-down strategies for traversing the pattern concept lattice. The output of the Sandwich algorithm is a poset of the most relevant link key candidates. We provide details about the quality measures applicable to the selection of link keys, the Sandwich algorithm, and as well a discussion on the benefit of our approach.

Mots clés

Fichier principal
Vignette du fichier
abbas2021a.pdf (171.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03426543 , version 1 (12-11-2021)

Identifiants

Citer

Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli. Sandwich: An Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice. ICFCA 2021 - 16th international conference on formal concept analysis, Jun 2021, Strasbourg /Virtuel, France. pp.243-251, ⟨10.1007/978-3-030-77867-5_15⟩. ⟨hal-03426543⟩
62 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More