Computing minimal and redundant mappings between lightweight ontologies

Maltese, Vincenzo and Autayeu, Aliaksandr (2008) Computing minimal and redundant mappings between lightweight ontologies. UNSPECIFIED.

Download (193Kb) | Preview


    The minimal mapping between two lightweight ontologies contains that minimal subset of mapping elements such that all the others can be efficiently computed from them. They have clear advantages in visualization and user interaction since they are the minimal amount of information that needs to be dealt with. They make the work of the user much easier, faster and less error prone. Experiments on our proposed algorithm to compute them demonstrate a substantial improvement both in run-time and number of elements found.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Additional Information: Presented at the AISB Workshop on Matching and Meaning 2009, 9th April 2009, Edinburgh, UK
    Report Number: DISI-08-079
    Repository staff approval on: 21 Sep 2009

    Actions (login required)

    View Item