Data linking over RDF knowledge graphs: A survey

10Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 approaches in the literature were developed to perform this process using different algorithmic techniques and search strategies. In this article, we aim to provide the rationale for IM and to survey the existing algorithms for performing this task. We begin by identifying the importance of such a process and define it formally. We also provide a new classification of these approaches depending on the “source of evidence,” which can be considered as the context information integrated explicitly or implicitly in the IM process. We survey and discuss the state-of-the-art IM methods regarding the context information. We, furthermore, describe and compare different state-of-the-art IM approaches in relation to several criteria. Such a comprehensive comparative study constitutes an asset and a guide for future research in IM.

Cite

CITATION STYLE

APA

Assi, A., Mcheick, H., & Dhifli, W. (2020). Data linking over RDF knowledge graphs: A survey. Concurrency and Computation: Practice and Experience, 32(19). https://doi.org/10.1002/cpe.5746

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free