H-MATCH: an Algorithm for Dynamically Matching Ontologies in Peer-based Systems
Contributo in Atti di convegno
Data di Pubblicazione:
2003
Citazione:
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.
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.
Tipologia IRIS:
03 - Contributo in volume
Elenco autori:
S. Castano, A. Ferrara, S. Montanelli
Link alla scheda completa:
Titolo del libro:
SWDB'03 : Proceedings