Data Linking: Capturing and Utilising Implicit Schema-level Relations

Nikolov, A; Uren, V; Motta, E
Proc. Workshop Linked Data on the Web

Schema-level heterogeneity represents an obstacle for auto-
mated discovery of coreference resolution links between in-
dividuals. Although there is a multitude of existing schema
matching solutions, the Linked Data environment di ers
from the standard scenario assumed by these tools. In par-
ticular, large volumes of data are available, and repositories
are connected into a graph by instance-level mappings. In
this paper we describe how these features can be utilised to
produce schema-level mappings which facilitate the instance

Overcoming Schema Heterogeneity between Linked Semantic Repositories to Improve Coreference Resolution

Nikolov, A; Uren, V; Motta, E; Roeck, A de
Proc. ASWC Conf., LNCS 5926

Schema heterogeneity issues often represent an obstacle for discovering coreference links between individuals in semantic data repositories. In this paper we present an approach, which performs ontology schema matching in order to improve instance coreference resolution performance. A novel feature of the approach is its use of existing instance-level coreference links defined in third-party repositories as background knowledge for schema matching techniques.

Handling instance coreferencing in the KnoFuss architecture

Nikolov, A; Uren, V; Motta, E; Roeck, AD
Proc. IRSW2008 (Int. ESWC Workshop on Identity and Reference on the Semantic Web)

Finding RDF individuals that refer to the same real-world entities but have different URIs is necessary for the efficient use of data across sources. The requirements for such instance-level integration of RDF data are different from both database record linkage and ontology schema matching scenarios. Flexible configuration and reuse of different methods is needed to achieve good performance.

Syndicate content