Approximate structure-preserving semantic matching

Giunchiglia, Fausto and McNeill, Fiona and Yatskevich, Mikalai and Pane, Juan and Besana, Paolo and Shvaiko, Pavel (2008) Approximate structure-preserving semantic matching. UNSPECIFIED.

Download (391Kb) | Preview


    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-reserving 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.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Additional Information: Accepted to the 7th International Conference on Ontologies, DataBases, and Applications of Semantics (ODBASE 2008), Monterrey, Mexico, Nov 11 - 13, 2008.
    Report Number: DISI-08-039
    Repository staff approval on: 27 Aug 2008

    Actions (login required)

    View Item