Abstract. Linked data aims at publishing data expressed in RDF (Resource Description Framework) at the scale of the worldwide web.

Abstract. Data interlinking is an important task for linked data inter- operability. One of the possible techniques for finding links is the use of.

Jun 27, 2024 · Link key candidate extraction with relational concept analysis · Manuel Atencia · Jérôme David · Jérôme Euzenat · Jérémy Vizzini.

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 ...

Abstract. Data interlinking is an important task for linked data inter- operability. One of the possible techniques for finding links is the use of.

This position paper focuses on link key which consists of sets of pairs of properties identifying the same entities across heterogeneous datasets, ...

We show how link key candidates may be directly extracted from RDF data sets by encoding the extraction problem in relational concept analysis. This method ...

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 ...

A link key extraction procedure in case of circular dependencies is presented. It uses relational concept analysis and extends the procedure of Deliverable ...

Links between heterogeneous data sets may be found by using a generalisation of keys in databases, called linkkeys, which apply across data sets.