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.

Computing Minimal and Redundant Mappings between Lightweight Ontologies

Maltese, Vincenzo;Autayeu, Aliaksandr
2009-01-01

Abstract

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.
2009
AISB
s.l.
s.n.
Maltese, Vincenzo; Autayeu, Aliaksandr
File in questo prodotto:
File Dimensione Formato  
079.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 193.76 kB
Formato Adobe PDF
193.76 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/105552
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact