Quantified Matchmaking of Heterogeneous Services
George Athanasopoulos2006
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
As the service-oriented computing paradigm and its related technologies mature, it is expected that electronic services will continue to grow in numbers. In such a setting, the course of service discovery could yield many alternative yet heterogeneous services which, by all means, may be of different type and moreover distinguished by their quality characteristics. To come through such situations and ease the task of service selection, service search engines need to be powered by an efficient matchmaking mechanism, which will abstract requesters from service heterogeneity and provide them with the means for choosing the service that best fits their requirements, among a wide set of services with similar functionally. In this paper, we present an efficient service matchmaking algorithm, which facilitates the task of heterogeneous service selection, whilst combining and exploiting the syntactic, semantic, and Quality-of-Service (QoS) properties contained in service advertisements.
Related papers
Flexible Semantic-Based Service Matchmaking and Discovery
World Wide Web, 2008
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.
Evaluating similarity and difference in service matchmaking
Recently, enterprise interoperability has been improved by the Web Service technology, making available an ever-growing number of services. Service discovery is considered a crucial issue; in particular, flexibility of the discovery process, that is, the ability of recognizing not only exact matches between the requests and offers, but also partial ones, should be enhanced. We propose a composite approach to flexible service matchmaking focused on different matching models that are able to evaluate similarity and difference between offers and requests. The approach is based on an ontological framework adding semantics to service descriptions. Optimization and ranking techniques are provided.
Matchmaking by difference in Service Discovery
Service discovery over the Web is considered a crucial issue; in particular, flexibility of the discovery process, that is, the ability of recognizing not only exact matches between the requests and offers, but also partial ones, needs to be enhanced. We have defined a composite approach to flexible service matchmaking with different matching mod- els. In this paper we present the novel difference-based matching model. The approach is based on an ontological framework adding semantics to service descriptions. Optimization and ranking techniques are provided.
Flexible matching and ranking of web service advertisements
2007
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunctional properties, such as QoS and reputation parameters. Current matchmakers only support predefined service description languages and predefined third-party repositories of service description documents, which both are hardcoded inside their internal structure, forcing providers to publish their services using a specific service publishing component. Therefore, current matchmakers are not able to look for existing services which are published using different service publishers.
Matchmaking of web services based on the DAML-S service model
Proceedings of the second international joint …, 2003
Intelligent Matching for Public Internet Web Services Towards Semi-Automatic Internet Services Mashup
2009 IEEE International Conference on Web Services, 2009
In this paper, we propose an Internet public Web service matching approach that paves the way for (semi-)automatic service mashup. We will first provide the overview of the solution, which requires a detailed review of two fundamental models-schema/graph matching and semantic space. Based on the conceptual model and the literature study, the complete service matching approach is then provided with four essential steps-semantic space, parameter tree, similarity measures, and WSDL operation matching. The system demonstration that proves the concept proposed in this approach is finally presented. The solution has the potential to facilitate the Internet services mashup.
A Semantic Web Service Retrieval Approach that Combines Semantic Matching With Quality of Service Matching
Journal of ICT, Design, Engineering and Technological Science
Web services have been utilized in many sectors such as educational, business, and government sectors. Examples are the tax information system of the Bureau of Internal Revenue and any kind of utility payment system and student achievement report system. Today, there are a large number of various web services on the Internet, creating a dif iculty in performing search and a problem of selection. For this reason, the author proposes a new web service search system that exploits the information structure of OWLS documents which consists of information from service history class, service model class, and basic service class. This information is used to construct indexes and their individual weights which are used to compare the level of similarity between a semantic query from a user and each web service by a vector space model. Then, the result is used in a web service selection procedure based on a formal concept analysis. A web service is selected through the structure of a concept lattice of Qos consisting of service availability and response time. Experimental results show that this proposed system provided an average accuracy of 71.9%. Moreover, it can provide alternative web services that are closely related to the query in order for the user to have lexibility in utilizing the search results.
Modeling, Matching and Ranking Services Based on Constraint Hardness
Lecture Notes in Computer Science, 2006
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expressing constraints in service descriptions of different strengths, i.e. Hard and Soft Constraints. Semantic service discovery can be performed by matching DL descriptions, expressing both Hard and Soft constraints, and exploiting DL inferences. Additionally, a method for solving the problem of ranking services is proposed which is based on the use of a semantic similarity measure for DL. This method can rank (matched) service descriptions on the grounds of their semantic similarity w.r.t. the service request, by preferring those that are able to better satisfy both Hard and Soft Constraints. p) I |)) = 5 8 • max(5 8 , 5 5) = 0.625
Behavioral matchmaking for service retrieval
2006
The capability to easily find useful services (software applications, software components, scientific computations) becomes increasingly critical in several fields. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. Recent works have demonstrated that this approach is not sufficient to discover relevant components. In this paper we argue that, in many situations, the service discovery should be based on the specification of service behavior (in particular, the conversation protocol). The idea behind is to develop matching techniques that operate on behavior models and allow delivery of partial matches and evaluation of semantic distance between these matches and the user requirements. Consequently, even if a service satisfying exactly the user requirements does not exist, the most similar ones will be retrieved and proposed for reuse by extension or modification. To do so, we reduce the problem of behavioral matching to a graph matching problem and we adapt existing algorithms for this purpose. A prototype is presented (available as a web service) which takes as input two conversation protocols and evaluates the semantic distance between them; the prototype provides also the script of edit operations that can be used to alter the first model to render it identical with the second one.
Context-aware Dynamic Service Matchmaking
In pervasive environments, the current service matchmaking is lack of context information with machine understandable and unable to deal with uncertainty of service properties, so it cannot achieve intelligent service discovery. This paper presents a fuzzy rough set theory based context-aware dynamic service matchmaking approach that composes an application through combining semantic information and context information. The proposed approach consists of formalized service description model with semantics and context attributes, and fuzzy rough set based service matchmaking. By describing the context attributes, the proposed approach is capable of composing context-aware application. Through a transformation technique, the incomplete information system is converted into a simpler system and then reducts are obtained from the transformed system based fuzzy rough set theory. Afterwards, the candidate service sets are selected by the function of the degree of keyword match and ranked through the function of the degree of service match. This paper describes the design and mechanism of the proposed approach. The proposed approach is expected to increase users' satisfaction in pervasive environments.
Related papers
Aggregating Web Service matchmaking variants using web search engine and machine learning
2010 2nd International Symposium on Aware Computing, 2010
Web Services discovery that locates adequate services, has been studied very actively for better quality of service retrieval. Starting from conventional keyword matching, logic-based matching and combination of the methods with information retrieval approach have been proposed to enable better discovery performance. The combining method using term-similarity can overcome the decision failure when the keyword or the logic-based methods were applied, and it was shown that the methods outperform the existing methods. And researches to aggregate matchmaking variants by machine learning has been attempted, and it also improves the discovery performance. The approaches still suffer from fixed corpus set for term similarity calculation. In this research, we attempted to calculate the similarity based on search engine to reflect the current Web context. Tokenized terms are used for the matchmaking degree. Variants for the matchmaking from ontology and term similarity are aggregated using Support Vector Machine (SVM) with non-linear kernel function. Matchmaking test on the trip domain service discovery was conducted. Experimental result based on the standard measure of precision and recall rate for the top 1-20 services of matched result on the trip domain test set are shown.
UltiMatch-NL: A Web Service Matchmaker Based on Multiple Semantic Filters
PLoS ONE, 2014
In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semanticaware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters.
Improved Service Ranking and Scoring: Semantic Advanced Matchmaker (Sam)
Proceedings of the Second International Conference on Evaluation of Novel Approaches to Software Engineering, 2007
In recent years Semantic Web has drawn a lot of attention in order to solve the problem of automatic discovery and processing of web services. Although there are different efforts and frameworks for semantic annotation and discovery of web services, they mostly classify the discovered web services as set-based. Improvement in matching process could be gained by the use of ontological information in a useful form. The goal of this research is to propose a more accurate discovery method using the ontological distance information defined and ranked by users. In this paper, we focus on one of the most challenging tasks in service discovery: matchmaking process. We use an efficient matchmaking algorithm based on bi-partite graphs. Our proposed algorithm uses attribute ranking through weight assignment. Our experiment results show that bi-partite matchmaking has advantages over other approaches in the literature for parameter pairing problem. We present value added approaches in matchmaking such as property-level matching, semantic distance information and WordNet scoring. The value added approaches provide better scoring scheme and allows similarity to be captured resulting in ranking of services according to their relatedness.
Leveraging web services discovery with customizable hybrid matching
2006
Abstract. Improving web service discovery constitutes a vital step for making a reality the Service Oriented Computing (SOC) vision of dynamic service selection, composition and deployment. Matching allows for comparing user requests with descriptions of available service implementations, and sits at the heart of the service discovery process.
Parameterized Algorithms for Matching and Ranking Web Services
Lecture Notes in Computer Science, 2014
The paper presents two parameterized and customizable algorithms for matching and ranking Web services. Given a user query and a set of available Web services, the matching algorithm performs a logic-based semantic matchmaking to select services that functionally match the query and maintains those which fully verify the constraints specified by the user. The ranking algorithm takes as input the matching Web services, assigns to each one a score in the range 0-1 and finally rank them based on the score values. The algorithms have been implemented, evaluated and compared to iSEM and SPARQLent. Results show that the algorithms behave globally well in comparison to these frameworks.
Customizable Web Services Matching and Ranking Tool: Implementation and Evaluation
Web Information Systems and Technologies, 2017
The matchmaking is a crucial operation in Web service discovery and selection. The objective of the matchmaking is to discover and select the most appropriate Web service among the different available candidates. Different matchmaking frameworks are now available in the literature but most of them present at least one of the following shortcomings: (1) use of strict syntactic matching; (2) use of capability-based matching; (3) lack of customization support; and (4) lack of accurate ranking of matching Web service. The objective of this paper is thus to present the design, implementation and evaluation of the Parameterized Matching-Ranking Framework (PMRF) that fully overcomes the first, third and fourth shortcomings cited above and partially addresses the second one. The comparison of PMRF to iSeM-logic-based and SPAR-QLent, using the OWLS-TC4 datasets, shows that the algorithms supported by PMRF outperform those proposed in iSeM-logic-based and SPARQLent.
A Context-Aware Service Matchmaking Method Using Description Logic
2007
The current trend of Web Service research is towards automatic service composition. Undoubtedly, service matchmaking is one of the critical problem to achieve the intention. Previous methods concerns service matchmaking considers the problem in a context free manner , in another word, they are domain independent. Obviously, without the consideration of context information, the degree of recall and precision regarding service matchmaking can be significantly declined. In this paper, we formally analyzed the problem using Description Logic and present a complete solution to resolve it. * This work is supported by NSFC of Peoples Republic of China. 2007 IEEE Asia-Pacific Services Computing Conference 0-7695-3051-6/07 $25.00
Semantic-Enriched Service Discovery
22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
Automated techniques and tools are required to effectively locate services that fulfil a given user request. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and contextdependent requirements in distributed environments. Our aim in this work is to propose a semantic-enriched framework to describe services and an ontology-based hybrid approach where such framework is exploited combining together different kinds of comparison strategies to provide a flexible and efficient matchmaking between service descriptions. For service discovery two matchmaking strategies are proposed: a deductive strategy based on Description Logics, with a reasoning procedure exploiting ontology knowledge to assess the type of match between services; a similarity-based strategy, exploiting retrieval metrics to measure the degree of match between services.
A Framework for Parameterized Semantic Matchmaking and Ranking of Web Services
Proceedings of the 12th International Conference on Web Information Systems and Technologies, 2016
The Parameterized Semantic Matchmaking and Ranking (PMRF) is a highly configurable framework supporting a parameterized matching and ranking of Web services. The paper introduces the matching and ranking algorithms supported by the PMRF and presents its architecture. It also evaluates the performance of the PMRF and compares it to the iSeM-logic-based and SPARQLent frameworks using the OWLS-TC4 datasets. The comparison results show that the algorithms included in PMRF behave globally well in comparison to iSeM-logic-based and SPARQLent.
Towards fine-grained service matchmaking by using concept similarity
2007
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the current proposals for defining notions of match between service advertisements and requests are based on subsumption checking in more or less expressive Description Logics, thus providing boolean match functions, rather than a fine-grained, numerical degree of match. By contrast, concept similarity measures investigated in the DL literature explicitely include such a quantitative notion. In this paper we try to take a step forward in this area by means of an analysis of existing approaches from both semantic web service matching and concept similarity, and provide preliminary ideas on how to combine these two building blocks in a unified service selection framework.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.