Computing minimal mappings

Giunchiglia, Fausto and Maltese, Vincenzo and Autayeu, Aliaksandr (2008) Computing minimal mappings. UNSPECIFIED.

Download (268Kb) | Preview


    Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such that i) all the others can be computed from them in time linear in the size of the input ontologies, and ii) none of them can be dropped without losing property i). In this paper we provide a formal definition of minimal mappings and define a time efficient computation algorithm which minimizes the number of comparisons between the nodes of the two input ontologies. The experimental results show a substantial improvement both in the computation time and in the number of mapping elements which need to be handled.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Uncontrolled Keywords: lightweight ontologies, ontology matching, minimal mappings
    Additional Information: At the ISWC Ontology Matching Workshop (OM 2009), 25th October 2009, Washington DC, USA
    Report Number: DISI-08-078
    Repository staff approval on: 21 Sep 2009

    Actions (login required)

    View Item