Home · Documentation · Publications · Downloads · ISLab · Web Links September 21 2017 17:54:04
Navigation
Home
Documentation
Publications
Downloads

FAQ
Search
Web Links
Users Online
Guests Online: 1
No Members Online

Registered Members: 158
Newest Member: download
Downloads: Publications
ISLab HMatch Results for OAEI 2006
In this paper, we discuss our experience in testing the HMatch match-
making system by means of the tracks proposed in the ontology alignment evalu-
ation initiative of 2006 1 . HMatch is a system conceived for the goal of ontology
matching in open and distributed systems. It is based on linguistic and structural
matching techniques for the evaluation of affinity considering concept names and
concept contexts. The paper discusses the results that have been obtained and the
possible improvements of the matching techniques in ongoing and future work.

@inproceedings{ Castano_OAEI_06,
author = "Silvana Castano and Alfio Ferrara and Gianpaolo Messa",
title = "ISLab HMatch Results for OAEI 2006",
booktitle = "Proc. of International Workshop on Ontology Matching, collocated with the 5th International Semantic Web Conference ISWC-2006",
year = "2006",
address = "Athens, Georgia, USA",
month = "November"
}
License: O/S: Version:
Added: 12.04.07 Downloads: 1603 Download ()
Matching Ontologies in Open Networked Systems: Techniques and Applications
S. Castano, A. Ferrara, S. Montanelli

In open networked systems a varying number of nodes interact each other just on the basis of their own independent ontologies and of knowledge discovery requests submitted to the network. Ontology matching techniques are essential to enable knowledge discovery and sharing in order to determine mappings between semantically related concepts of different ontologies. In this paper, we describe the H-Match algorithm and related techniques for performing matching of independent ontologies in open networked systems. A key feature of H-Match is that it can be dynamically configured for adaptation to the semantic complexity of the ontologies to be compared, where the number and type of ontology features that can be exploited during the matching process is not known in advance as it is embedded in the current knowledge request. Furthermore, this number can vary, also for the same ontologies, each time a new matching execution comes into play triggered by a knowledge request. We describe how H-Match enforces this capabilities through a combination of syntactic and semantic techniques as well as through a set of four matching models, namely surface, shallow, deep, and intensive. Then, we describe the application of H-Match and its implementation for knowledge discovery in the framework of the Helios peer-based system. Finally, we present experimental results of using HMatch on different test cases, along with a discussion on precision and recall.

@article{ JoDS05,
author = "S. Castano and A. Ferrara and S. Montanelli",
title = "Matching Ontologies in Open Networked Systems: Techniques and Applications",
journal = "Journal on Data Semantics (JoDS)",
year = "2005",
key = "ontology matching, H-MATCH",
volume = "V"
}
License: - O/S: - Version: -
Added: 10.04.06 Downloads: 1226 Download (External Link)
From Surface to Intensive Matching of Semantic Web Ontologies
S. Castano, A. Ferrara, S. Montanelli, G. Racca

In the Semantic Web context, the Web is enriched with several domain ontologies specifying formal semantics of data for various intelligent services for information search, retrieval, and transformation. The high number of different ontologies over the Web requires automatic and effective techniques for ontology matching in order to find mappings between them for discovery and sharing of knowledge. In this paper, we describe H-MATCH, an algorithm for dynamically perform ontology matching at different levels of depth, with different degrees of flexibility and accuracy.

@inproceedings{ WEBS04,
author = "S. Castano and A. Ferrara and S. Montanelli and G. Racca",
title = "From Surface to Intensive Matching of Semantic Web Ontologies",
booktitle = "Proc. of the 3rd DEXA Int. Workshop on Web Semantics (WEBS 2004)",
key = "Ontology matching, helios",
pages = "140-144",
year = "2004",
address = "Zaragoza, Spain",
month = "August",
publisher = "IEEE Computer Society"
}
License: - O/S: PDF Version: -
Added: 10.04.06 Downloads: 1218 Download (300 KB)
Semantic Information Interoperability in Open Networked Systems
S. Castano, A. Ferrara, S. Montanelli, G. Racca

In open networked systems, each node shares part of its informational resources on the network and is responsible of providing their ontological description. To enable semantic information interoperability in networked contexts with a multitude of autonomous ontologies, appropriate matching techniques are required to determine semantic mappings between concepts of different ontologies. In this paper, we describe H-Match, an algorithm for dynamically performing ontology matching in multi-ontology contexts. H-Match provides several matching models and metrics to work at different levels of depth, with different degrees of flexibility and accuracy, thus supporting semantic interoperability in a flexible way.

@inproceedings{ ICSNW04,
author = "S. Castano and A. Ferrara and S. Montanelli and G. Racca",
title = "Semantic Information Interoperability in Open Networked Systems",
booktitle = "Proc. of the Int. Conference on Semantics of a Networked World (ICSNW), in cooperation with ACM SIGMOD 2004",
key = "ontology matching",
pages = "215-230",
year = "2004",
address = "Paris, France",
month = "June"
}
License: - O/S: PDF Version: -
Added: 10.04.06 Downloads: 1279 Download (284 KB)
Matching Techniques for Resource Discovery in Distributed Systems Using Heterogeneous Ontology Descr
S. Castano, A. Ferrara, S. Montanelli, G. Racca

In this paper, we propose a semantic approach for the dynamic resource discovery based on ontologies for a semantically rich description of the metadata characterizing the resources to be shared, and on semantic matching techniques for dynamically and flexibly comparing ontological resource descriptions against a target resource request.

@inproceedings{ ITCC-04,
author = "S. Castano and A. Ferrara and S. Montanelli and G. Racca",
title = "Matching Techniques for Resource Discovery in Distributed Systems Using Heterogeneous Ontology Descriptions",
booktitle = "Proc. of the Int. Conference on Coding and Computing (ITCC 2004)",
key = "helios",
year = "2004",
address = "Las Vegas, Nevada, USA",
month = "April",
publisher = "IEEE Computer Society"
}
License: - O/S: PDF Version: -
Added: 10.04.06 Downloads: 2519 Download (150 KB)
H-Match: an Algorithm for Dynamically Matching Ontologies in Peer-based Systems
S. Castano, A. Ferrara, S. Montanelli

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.

@inproceedings{ SWDB-03,
author = "S. Castano and A. Ferrara and S. Montanelli",
title = "H-MATCH: an Algorithm for Dynamically Matching Ontologies in Peer-based Systems",
booktitle = "Proc. of the 1st VLDB Int. Workshop on Semantic Web and Databases (SWDB 2003)",
key = "helios, ontology",
year = "2003",
address = "Berlin, Germany",
month = "September"
}
License: - O/S: PDF Version: -
Added: 10.04.06 Downloads: 1309 Download (540 KB)
Login
Username

Password



Forgotten your password?
Request a new one here.