Semantic Information Interoperability in Open Networked Systems

Castano, Silvana; Ferrara, Alfio; Montanelli, Stefano; Racca, G.

doi:10.1007/978-3-540-30145-5_13

Cited by 21 publications

(15 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Castano et al [9] describe the H-Match algorithm to dynamically match ontologies. H-Match provides, for each concept from an ontology, a ranked list of similar concepts in the other ontology.…”

Section: Related Workmentioning

confidence: 99%

Matching object catalogues

Leme

Brauner

Breitman

et al. 2008

Innovations Syst Softw Eng

View full text Add to dashboard Cite

A catalogue holds information about a set of objects, typically classified using terms taken from a given thesaurus, and described with the help of a set of attributes. Matching a pair of catalogues means to find a relationship between the terms of their thesauri and a relationship between their attributes. This paper first introduces a matching approach, based on the notion of similarity, that applies to both thesauri and attribute matching. It then describes matchings based on mutual information and introduces variations that explore certain heuristics. Finally, it discusses experimental results that evaluate the precision of the matchings and that measure the influence of the heuristics.

show abstract

Section: Related Workmentioning

confidence: 99%

Matching object catalogues

Leme

Brauner

Breitman

et al. 2008

Innovations Syst Softw Eng

View full text Add to dashboard Cite

show abstract

“…Most schema matching algorithms (Li et al, 2000), (Doan et al, 2003), (Mitra et al, 2000), (Milo and Zohar, 1998), (Palopoli et al, 2000), (Castano et al, 2004), (Do and Rahm, 2001), (Melnik et al, 2002), (Noy and Musen, 2001), (Giunchiglia et al, 2004) produce similarity scores between source and target schemas nodes such as the ones we produce in section 5.3; however, such a mapping result partially solves the problem. First, produced similarities between individual nodes are not enough to produce access paths for retrieving data from the available sources.…”

Section: Discovery Of Nodes and Edges Matchesmentioning

confidence: 99%

Conceptual Framework for XML Schema Mapping

Lamolle¹,

Zerdazi²,

Menet³

2008

Proceedings of the Tenth International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

Today's web-based applications and web services publish their data using XML, as this helps interoperability with other applications and services. The heterogeneity of XML data has led to recent research in schema matching, schema transformation, and schema integration for XML. In this paper, we propose an approach for mapping integration for XML schema. The basic idea is to drive direct as well as complex matches with their associated transformation operations from the computed element similarities. The representation of a mapping element in a source-to-target mapping clearly declares both the semantics correspondences as well as the access paths to access and load data from source into a target schema. We detail our mapping generation process and proceed in four steps to specify a formal representation of a source-to-target mapping in order to discover structural mappings between XML schemas.

show abstract

“…To support the matchmaking between the request and the advertisement, the knowledge contained in the domain ontology DomON T is extended by means of a thesaurus T H, where terms used as names of ontological concepts are related to other terms by means of terminological relationships (e.g., synonymy, hypernymy, hyponymy, etc.). Following a procedure similar to that proposed by [9], the thesaurus T H is automatically derived by considering the set T of terms denoting atomic concepts in DomON T and the lexical system WordNet [12]. To be compliant with real ontologies, where names can be composed by one or more terms, we select terms and terminological relationships to be stored in T H as follows.…”

Section: Semantic Infrastructure For Service Discoverymentioning

confidence: 99%

Flexible Semantic-Based Service Matchmaking and Discovery

2008

View full text Add to dashboard Cite

Automated techniques and tools are required to effectively locate services that fulfill a given user request in a mobility context. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and context-dependent requirements. Our aim in this work is to propose an ontology-based hybrid approach where different kinds of matchmaking strategies are combined together to provide an adaptive, flexible and efficient service discovery environment. The approach, in particular, exploits the semantic knowledge about the business domain provided by a domain ontology underlying service descriptions, and the semantic organization of services in a service ontology, at different levels of abstraction.Keywords hybrid service matchmaking approach · ontology-based service discovery · service ontology

show abstract

Semantic Information Interoperability in Open Networked Systems

Cited by 21 publications

References 15 publications

Matching object catalogues

Matching object catalogues

Conceptual Framework for XML Schema Mapping

Flexible Semantic-Based Service Matchmaking and Discovery

Contact Info

Product

Resources

About