Service Integration through Structure-Preserving Semantic Matching

The problem of integrating services is becoming increasingly pressing. In large, open environments such as the Semantic Web, huge numbers of services are developed by vast numbers of different users. Imposing strict semantics standards in such an environment is useless; fully predicting in advance which services one will interact with is not always possible as services may be temporarily or permanently unreachable, may be updated or may be superseded by better services. In some situations, characterised by unpredictability, such as the emergency response scenario described in this case, the best solution is to enable decisions about which services to interact with to be made on-the-fly. We propose a method of doing this using matching techniques to map the anticipated call to the input that the service is actually expecting. To be practical, this must be done during run-time. In this case, we present our structure-preserving semantic matching algorithm (SPSM), which performs this matching task both for perfect and approximate matches between calls. In addition, we introduce the OpenKnowledge system for service interaction which, using the SPSM algorithm, along with many other features, facilitates on-the-fly interaction between services in an arbitrarily large network without any global agreements or pre-run-time knowledge of who to interact with or how interactions will proceed. We provide a preliminary evaluation of the SPSM algorithm within the OpenKnowledge framework.

Download Full-text

Service Integration through Structure-Preserving Semantic Matching

Journal of Cases on Information Technology ◽

10.4018/jcit.2009072102 ◽

2009 ◽

Vol 11 (4) ◽

pp. 26-46

Author(s):

Fiona McNeill ◽

Paolo Besana ◽

Juan Pane ◽

Fausto Giunchiglia

Keyword(s):

Semantic Web ◽

Emergency Response ◽

Matching Task ◽

Preliminary Evaluation ◽

Large Network ◽

Semantic Matching ◽

Matching Algorithm ◽

Structure Preserving ◽

Matching Technique ◽

Run Time

The problem of integrating services is becoming increasingly pressing. In large, open environments such as the Semantic Web, huge numbers of services are developed by vast numbers of different users. Imposing strict semantics standards in such an environment is useless; fully predicting in advance which services one will interact with is not always possible as services may be temporarily or permanently unreachable, may be updated or may be superseded by better services. In some situations, characterised by unpredictability, such as the emergency response scenario described in this case, the best solution is to enable decisions about which services to interact with to be made on-the-fly. We propose a method of doing this using matching technique to map the anticipated call to the input that the service is actually expecting. To be practical, this must be done during run-time. In this case, we present our structure-preserving semantic matching algorithm (SPSM), which performs this matching task both for perfect and approximate matches between calls. In addition, we introduce the OpenKnowledge system for service interaction which, using the SPSM algorithm, along with many other features, facilitates on-the-fly interaction between services in an arbitrarily large network without any global agreements or pre-run-time knowledge of who to interact with or how interactions will proceed. We provide a preliminary evaluation of the SPSM algorithm within the OpenKnowledge framework.

Download Full-text

A Novel Matching Algorithm for Shopbot Agents acting in Marketplaces

Intelligent Technologies and Techniques for Pervasive Computing - Advances in Computational Intelligence and Robotics ◽

10.4018/978-1-4666-4038-2.ch004 ◽

2013 ◽

pp. 59-84

Author(s):

George Karasmanoglou ◽

Blerina Lika

Keyword(s):

Semantic Web ◽

Electronic Markets ◽

Experimental Results ◽

Semantic Matching ◽

Matching Algorithm ◽

Content Representation ◽

Open Environments ◽

Specific Provider ◽

Product Description ◽

Matching Techniques

During the last years, the emergence of Semantic Web has produced a vast amount of resources and a variety of content representation schemes. The latter has increased the complexity that the users are facing when searching for information in open environments. A representative example is Electronic Markets (EMs). In EMs users try to find and purchase products through interactions with providers. In such scenarios, shopbots can offer a number of advantages. Shopbots are agents that help users to find the products they want, saving them a lot of time and effort. However, building efficient shopbots is a challenging task. This is more imperative when shopbots interact with providers using different ontological terms for product description. In this chapter, the authors propose a generic ontology to describe products in EMs. They also introduce a matching algorithm that maps the specific provider ontology to the generic one in order to be used by a shopbot. Their algorithm, called S+, is based on a set of linguistic and semantic matching techniques. The authors present their approach and compare it with other proposed algorithms. Finally, they discuss their experimental results that reveal the performance of their methodology.

Download Full-text

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.760-762.1708 ◽

2013 ◽

Vol 760-762 ◽

pp. 1708-1712

Author(s):

Ying Fang Li ◽

Ying Jiang Li ◽

Yan Li ◽

Yang Bo

Keyword(s):

Semantic Web ◽

Web Service ◽

Formal Concept Analysis ◽

Service Discovery ◽

Concept Lattice ◽

Concept Analysis ◽

Formal Concept ◽

Semantic Web Service ◽

Matching Algorithm ◽

Service Matching

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

Download Full-text

Conceptual apraxia and semantic memory deficit in Alzheimer's disease: Two sides of the same coin?

Journal of the International Neuropsychological Society ◽

10.1017/s1355617700666079 ◽

2000 ◽

Vol 6 (6) ◽

pp. 693-703 ◽

Cited By ~ 33

Author(s):

CATHERINE DUMONT ◽

BERNADETTE SKA ◽

YVES JOANETTE

Keyword(s):

Alzheimer’S Disease ◽

Alzheimer's Disease ◽

Cognitive Model ◽

Semantic Knowledge ◽

Matching Task ◽

Semantic Matching ◽

Language Deficit ◽

Sequential Organization ◽

Action Knowledge ◽

Actual Use

This study was designed to examine the patterns of apraxic disturbances and the relationships between action knowledge and other measures of semantic knowledge about objects in 10 well-characterized Alzheimer's disease (AD) patients. Five tasks were used to assess components of action knowledge (action–tool relationships, pantomime recognition, and sequential organization of action) and praxis execution (actual use, pantomiming) according to the cognitive model of praxis. Three tasks (verbal comprehension, naming, and a visual semantic matching task) were used to assess verbal–visual semantics. Considering patterns of apraxia first, conceptual apraxia was found in 9 out of the 10 AD patients, suggesting that it is a common feature even in the early stages of AD. Second, we found partly parallel deficits in tests of action-semantic and verbal–visual semantic knowledge in 9 AD patients. Impaired action knowledge was found only in patients with a semantic language deficit. These findings provide no evidence that “action semantics” may be separated from other semantic information. Our results support the view of a unitary semantic system, given that the representations of action-semantic and other semantic knowledge of objects are often simultaneously disrupted in AD. (JINS, 2000, 6, 693–703.)

Download Full-text

A Semantic Matching Strategy for Very Large Knowledge Bases Integration

International Journal of Information Technology and Web Engineering ◽

10.4018/ijitwe.2020040101 ◽

2020 ◽

Vol 15 (2) ◽

pp. 1-29

Author(s):

Antonio M. Rinaldi ◽

Cristiano Russo ◽

Kurosh Madani

Keyword(s):

State Of The Art ◽

Knowledge Bases ◽

Data Reuse ◽

Semantic Matching ◽

Formal Ontologies ◽

Upper Level ◽

Analyse Data ◽

Matching Strategy ◽

Definition Of ◽

Matching Techniques

Over the last few decades, data has assumed a central role, becoming one of the most valuable items in society. The exponential increase of several dimensions of data, e.g. volume, velocity, variety, veracity, and value, has led the definition of novel methodologies and techniques to represent, manage, and analyse data. In this context, many efforts have been devoted in data reuse and integration processes based on the semantic web approach. According to this vision, people are encouraged to share their data using standard common formats to allow more accurate interconnection and integration processes. In this article, the authors propose an ontology matching framework using novel combinations of semantic matching techniques to find accurate mappings between formal ontologies schemas. Moreover, an upper-level ontology is used as a semantic bridge. An implementation of the proposed framework is able to retrieve, match, and align ontologies. The framework has been evaluated with the state-of-the-art ontologies in the domain of cultural heritage and its performances have been measured by means of standard measures.

Download Full-text

Brokering Web Services via a Hybrid Ontology Mediation Approach Using Multi Agent Systems (MAS)

Advances in E-Business Research - Transforming E-Business Practices and Applications ◽

10.4018/978-1-60566-910-6.ch023 ◽

2010 ◽

pp. 431-444

Author(s):

Saravanan Muthaiyah ◽

Larry Kerschberg

Keyword(s):

Web Services ◽

Empirical Evidence ◽

Hybrid Approach ◽

Semantic Relatedness ◽

Semantic Matching ◽

Multi Agent Systems ◽

Mapping Algorithm ◽

Agent Systems ◽

Multi Agent ◽

Matching Techniques

This chapter introduces a hybrid ontology mediation approach for deploying Semantic Web Services (SWS) using Multi-agent systems (MAS). The methodology that the authors have applied combines both syntactic and semantic matching techniques for mapping ontological schemas so as to 1) eliminate heterogeneity; 2)provide higher precision and relevance in matched results; 3) produce better reliability and 4) achieve schema homogeneity. The authors introduce a hybrid matching algorithm i.e. SRS (Semantic Relatedness Score) which is a composite matcher that comprises thirteen well established semantic and syntactic algorithms which have been widely used in linguistic analysis. This chapter provides empirical evidence via several hypothesis tests for validating our approach. A detailed mapping algorithm as well as a Multi-agent based system (MAS) prototype has been developed for brokering Web services as proof-of-concept and to further validate the presented approach. Agent systems today provide brokering services that heavily rely on matching algorithms that at present focus mainly only on syntactic matching techniques. The authors provide empirical evidence that their hybrid approach is a better solution to this problem.

Download Full-text

Cell Generator-Based Technology Mapping by Constructive Tree-Matching and Dynamic Covering

VLSI Design ◽

10.1155/1995/18576 ◽

1995 ◽

Vol 3 (1) ◽

pp. 1-12 ◽

Cited By ~ 3

Author(s):

Martin Lefebvre ◽

Cliff Liem

Keyword(s):

Logic Synthesis ◽

Large Cell ◽

Technology Mapping ◽

Circuit Realization ◽

Matching Algorithm ◽

Logic Network ◽

Feasibility Constraints ◽

Matching Techniques ◽

Physical Components

Technology mapping is the final step of logic synthesis which consists of mapping an optimized technology independent logic network representation into a circuit realization in a given technology. An important component of the technology mapping problem is the identification of feasible library cells for the realization of the logic operators in the logic tree. There are two main classes of such matching algorithms. Library-based matching algorithms [1–4] require that all available physical components be represented explicitly in a pattern library. Sections of the logic network are then matched against this pattern list for the identification of suitable components. In contrast, cell generator-based matching techniques [6–8] accept feasibility constraints on the complexity and quantity of physical components according to limits imposed by the target technology or the capabilities of the cell generator. Hence, individual patterns are not stored in a library and are instead generated as needed. In this paper, we present a new cell generator-based constructive matching algorithm. Because the algorithm builds matched patterns incrementally, very large cell families can be accommodated using time and space resources that are proportional to the size of the largest feasible cell pattern and not the size of the library of patterns as would be the case for library-based approaches. Also, whereas existing cell generator-based matching techniques combine the tasks of matching (identification) and covering (selection), constructive matching provides more flexibility by not restricting the covering phase. Empirical results demonstrate the increased quality of the technology-mapped circuits when larger cells are available.

Download Full-text

Research on the Matching Algorithm of Semantic Web Service in Pervasive Environments

2008 International Seminar on Future BioMedical Information Engineering ◽

10.1109/fbie.2008.88 ◽

2008 ◽

Author(s):

Cuncun Wei

Keyword(s):

Semantic Web ◽

Web Service ◽

Semantic Web Service ◽

Matching Algorithm ◽

Pervasive Environments

Download Full-text

The Semantic Side of Service-Oriented Architectures

Electronic Services ◽

10.4018/978-1-61520-967-5.ch039 ◽

2010 ◽

pp. 644-659

Author(s):

Catarina Ferreira da Silva ◽

Paulo Rupino da Cunha ◽

Parisa Ghodous ◽

Paulo Melo

Keyword(s):

Web Services ◽

Semantic Web ◽

Enterprise Application Integration ◽

Semantic Web Services ◽

Semantic Matching ◽

Application Integration ◽

Service Oriented Architectures ◽

Enterprise Application ◽

Consumer Services ◽

Service Oriented

In Service-Oriented Architectures (SOA), service descriptions are fundamental elements. In order to automatically execute SOA tasks, such as services discovery, it is necessary to capture and process the semantics of services. We review several Semantic Web Services frameworks that intend to bring semantics to Web Services. This chapter depicts some ideas from SOA and Semantic Web services and their application to enterprise application integration. We illustrate an example of logic-based semantic matching between consumer services and provided services, which are described in ontologies.

Download Full-text