Approximate Structure-Preserving Semantic Matching

Fausto Giunchiglia, Fiona McNeill, Mikalai Yatskevich, Juan Pane, Paolo Besana, Pavel Shvaiko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, e.g., between concepts in two ontologies. However, for applications such as web service integration, we need to establish whether full graph structures correspond to one another globally, preserving certain structural properties of the graphs being considered. The goal of this paper is to provide a new matching operation, called structure-preserving semantic matching . This operation takes two graph-like structures and produces a set of correspondences, ( i ) still preserving a set of structural properties of the graphs being matched, ( ii ) only in the case if the graphs are globally similar to one another. Our approach is based on a formal theory of abstraction and on a tree edit distance measure. We have evaluated our solution in various settings. Empirical results show the efficiency and effectiveness of our approach.
Original languageEnglish
Title of host publicationOn the Move to Meaningful Internet Systems: OTM 2008
Subtitle of host publicationOTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008, Monterrey, Mexico, November 9-14, 2008, Proceedings, Part II
EditorsRobert Meersman, Zahir Tari
PublisherSpringer-Verlag GmbH
Pages1217-1234
Number of pages18
ISBN (Print)978-3-540-88872-7
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume5332
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Approximate Structure-Preserving Semantic Matching'. Together they form a unique fingerprint.

Cite this