Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli, Non-redundant link keys in RDF data: preliminary steps, in: Proc. 9th IJCAI workshop on What can FCA do for Artificial Intelligence? (FCA4AI), Montréal (CA), pp125-130, 2021
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 induced by a link key and we introduce the notion of non-redundant link key candidate.
Linked data, RDF, Link key, Formal concept analysis, Pattern structure