These days, with the tremendous growth of network-based service and shared information
on networks, the risk of network attacks and intrusions increases too, therefore network …

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 …

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 …

The widely addressed topic of ontology alignment to this day contains several open
research questions that remain either unanswered or only vaguely tackled. One of them is …

Data load balancing is a challenging task in the P2P systems. Distributed hash table (DHT)
abstraction, heterogeneous nodes, and non uniform distribution of objects are the reasons to …

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 …

A central problem in data integration and data cleansing is to identify pairs of entities in data
sets that describe the same real-world object. Many existing methods for matching entities …

Standards and benchmarking have traditionally been used as the main tools to formally
define and provably illustrate the level of the adequacy of systems to address the new …

This thesis entitled A Performance Analysis Framework for Coreference Resolution
Algorithms, focuses on the topic of coreference resolution of semantic datasets. In order for …