Conference proceedings

Approximate structure-preserving semantic matching

Giunchiglia F, McNeill F, Yatskevich M, Pane J, Besana P, Shvaiko P ...see all

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5332 LNCS, issue PART 2 (2008) pp. 1217-1234

  • 20


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.
  • N/A


    ScienceDirect users who have downloaded this article.
Sign in to save reference


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Paolo BesanaHEC MontrĂ©al, departement of management

  • Fausto Giunchiglia

  • Fiona McNeill

  • Mikalai Yatskevich

  • Juan Pane

  • Pavel Shvaiko

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free