RDF dataset profiling–a survey of features, methods, vocabularies and applications

M Ben Ellefi, Z Bellahsene, JG Breslin… - Semantic …, 2018 - content.iospress.com
Abstract The Web of Data, and in particular Linked Data, has seen tremendous growth over
the past years. However, reuse and take-up of these rich data sources is often limited and …

A Contextualised Semantics for owl:sameAs

W Beek, S Schlobach, F van Harmelen - … , Crete, Greece, May 29--June 2 …, 2016 - Springer
Identity relations are at the foundation of the Semantic Web and the Linked Data Cloud. In
many instances the classical interpretation of identity is too strong for practical purposes …

Using ontology-based data summarization to develop semantics-aware recommender systems

T Di Noia, C Magarelli, A Maurino, M Palmonari… - The Semantic Web: 15th …, 2018 - Springer
In the current information-centric era, recommender systems are gaining momentum as tools
able to assist users in daily decision-making tasks. They may exploit users' past behavior …

LIMES: A Framework for Link Discovery on the Semantic Web

AC Ngonga Ngomo, MA Sherif, K Georgala… - KI-Künstliche …, 2021 - Springer
Abstract The Linked Data paradigm builds upon the backbone of distributed knowledge
bases connected by typed links. The mere volume of current knowledge bases as well as …

Vickey: Mining conditional keys on knowledge bases

D Symeonidou, L Galárraga, N Pernelle, F Saïs… - The Semantic Web …, 2017 - Springer
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we
show how such keys can be mined automatically on large knowledge bases (KBs). For this …

Linking and disambiguating entities across heterogeneous RDF graphs

M Achichi, Z Bellahsene, MB Ellefi, K Todorov - Journal of Web Semantics, 2019 - Elsevier
Establishing identity links across RDF datasets is a central and challenging task on the way
to realising the Data Web project. It is well-known that data supplied by different sources can …

Data linking over RDF knowledge graphs: A survey

A Assi, H Mcheick, W Dhifli - Concurrency and Computation …, 2020 - Wiley Online Library
Instance matching (IM) is the process of matching instances across Knowledge Bases (KBs)
that refer to the same real‐world object (eg, the same person in two different KBs). Several …

Automatic key selection for data linking

M Achichi, M Ben Ellefi, D Symeonidou… - … Conference, EKAW 2016 …, 2016 - Springer
The paper proposes an RDF key ranking approach that attempts to close the gap between
automatic key discovery and data linking approaches and thus reduce the user effort in …

KeyRanker: Automatic RDF key ranking for data linking

H Farah, D Symeonidou, K Todorov - Proceedings of the 9th Knowledge …, 2017 - dl.acm.org
Automatic approaches to key discovery on RDF datasets generate sets of discriminative
properties that can be used to configure data linking systems relying on link specifications …

Discovery of keys for graphs [extended version]

M Alipourlangouri, F Chiang - arxiv preprint arxiv:2205.15547, 2022 - arxiv.org
Keys for graphs uses the topology and value constraints needed to uniquely identify entities
in a graph database. They have been studied to support object identification, knowledge …