In this paper, we present h-match, an algorithm for dynamically matching distributed ontologies. By exploiting ontology knowledge descriptions, h-match can be used to dynamically perform ontology matching at different levels of depth, with different degrees of flexibility and accuracy. h-match has been developed in the Helios framework, conceived for supporting knowledge sharing and ontology-addressable content retrieval in peer-based systems.
H-MATCH: an Algorithm for Dynamically Matching Ontologies in Peer-based Systems / S. Castano, A. Ferrara, S. Montanelli - In: SWDB'03 : Proceedings / [a cura di] I.F. Cruz, V. Kashyap, S. Decker, R. Eckstein. - [s.l] : ACM, 2003. - pp. 218-237 (( Intervento presentato al 1. convegno International Workshop on Semantic Web and Databases tenutosi a Berlin nel 2003.
H-MATCH: an Algorithm for Dynamically Matching Ontologies in Peer-based Systems
S. CastanoPrimo
;A. FerraraSecondo
;S. MontanelliUltimo
2003
Abstract
In this paper, we present h-match, an algorithm for dynamically matching distributed ontologies. By exploiting ontology knowledge descriptions, h-match can be used to dynamically perform ontology matching at different levels of depth, with different degrees of flexibility and accuracy. h-match has been developed in the Helios framework, conceived for supporting knowledge sharing and ontology-addressable content retrieval in peer-based systems.
| File | Dimensione | Formato | |
|---|---|---|---|
|
10.1.1.86.3547.pdf
accesso riservato
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
526.81 kB
Formato
Adobe PDF
|
526.81 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
