In the context of Linked Data, different kinds of semantic links can be established between
data. However when data sources are huge, detecting such links manually is not feasible …

This article presents an unsupervised system that performs instance matching between
entities in schema-free Resource Description Framework (RDF) files. Rather than relying on …

In the last years, thanks to the standardization of Semantic Web technologies, we are
experiencing an unprecedented production of data, published online as Linked Data. In this …

The goal of this survey is to present the state of the art instance matching benchmarks for
Linked Data. We introduce the principles of benchmark design for instance matching …

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 …

Since over a decade coreference resolution systems have been developed in order to find
simple 1-to-1 equivalent map** (sameAs relations) between instances of different linked …

Web of linked data is one of the main principles for realization of semantic web ideals. In
recent years, different data providers have produced many data sources in the Linking Open …

In this paper we describe an ontology to ontology (OtO) matching system which implements
a novel instance matching algorithm. The proposed multi-strategy matching system is …

In this paper, we describe our system, SBUEI, for instances coreference resolution between
various sources even with heterogeneous schemas. It is the first participation of SBUEI in …

The World Wide Web is an interlinked collection of documents that are generally devoid of
any structure and primarily meant for human consumption. In 2006, Sir Tim Berners-Lee, the …