N2R-part: identity link discovery using partially aligned ontologies

Authors:
Nathalie Pernelle;Fatiha Saïs;Brigitte Safar;Maria Koutraki;Tushar Ghosh
Affiliations:
LRI, Paris Sud University, Orsay, France;LRI, Paris Sud University, Orsay, France;LRI, Paris Sud University, Orsay, France;ETIS, Cergy-Pontoise Univ., Cergy, FR;LRI & INRIA Saclay, Orsay, France
Venue:
Proceedings of the 2nd International Workshop on Open Data
Year:
2013

Citing 7
Cited 0

SOFIE: a self-organizing framework for information extraction

Proceedings of the 18th international conference on World wide web
Combining a Logical and a Numerical Method for Data Reconciliation

Journal on Data Semantics XII
A framework for semantic link discovery over relational data

Proceedings of the 18th ACM conference on Information and knowledge management
Discovering and Maintaining Links on the Web of Data

ISWC '09 Proceedings of the 8th International Semantic Web Conference
KD2R: a key discovery method for semantic reference reconciliation

OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Ontology Matching: State of the Art and Future Challenges

IEEE Transactions on Knowledge and Data Engineering
Data Linking for the Semantic Web

International Journal on Semantic Web & Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thanks to the initiative of Linked Open Data, the RDF datasets that are published on the Web are more and more numerous. One active research field currently concerns the problem of finding links between entities. We focus in this paper on ontology-based data linking approaches which use linking rules based on the available schemas (or ontologies). This kind of systems assume to have beforehand a set of mappings between ontology elements. However, this set of mappings could be incomplete. We propose in this paper a data linking approach called N2R-Part. It is based on the computation of similarity scores by exploiting at the same time properties for which a mapping exists and those for which there is no mapping. We illustrate throughout an example how the exploitation of the unmapped properties improves the data linking results.