Web Service Advertisements Research Articles

Semantic Web Service matchmakers: state of the art and challenges

Web services provide a standard means for the interoperable operations between electronic devices in a network. The mission of Web service discovery is to seek an appropriate Web service for a service requester on the basis of the service descriptions in Web service advertisements and the service requester's requirements. Nevertheless, the standard language used for encoding service descriptions does not have the capacity to specify the capabilities of a Web service, leading to the problem of ambiguity in the service discovery process. This brings up the vision of Semantic Web Services and Semantic Web Service discovery, which make use of the Semantic Web technologies to enrich the semantics of service descriptions for service discovery. Semantic Web Service matchmakers are the programs or frameworks designed to implement the task of Semantic Web Service discovery and have drawn a significant amount of attention from both academia and industry from the start of this century. In this paper, we conduct a survey of the contemporary Semantic Web Service matchmakers in order to obtain an overview of the state of the art in this research area. We summarize six technical dimensions from the past literature and analyze the typical Semantic Web Service matchmakers mostly developed during the past 4 or 5 years in terms of the six dimensions. By means of this analysis, we gain an understanding of the current research and summarize a series of potential issues to that would provide the foundation for future research in this area.

Ranking and Clustering Web Services Using Multicriteria Dominance Relationships

As the web is increasingly used not only to find answers to specific information needs but also to carry out various tasks, enhancing the capabilities of current web search engines with effective and efficient techniques for web service retrieval and selection becomes an important issue. Existing service matchmakers typically determine the relevance between a web service advertisement and a service request by computing an overall score that aggregates individual matching scores among the various parameters in their descriptions. Two main drawbacks characterize such approaches. First, there is no single matching criterion that is optimal for determining the similarity between parameters. Instead, there are numerous approaches ranging from Information Retrieval similarity measures up to semantic logic-based inference rules. Second, the reduction of individual scores to an overall similarity leads to significant information loss. Determining appropriate weights for these intermediate scores requires knowledge of user preferences, which is often not possible or easy to acquire. Instead, using a typical aggregation function, such as the average or the minimum of the degrees of match across the service parameters, introduces undesired bias, which often reduces the accuracy of the retrieval process. Consequently, several services, e.g., those having a single unmatched parameter, may be excluded from the result set, while being potentially good candidates. In this work, we present two complementary approaches that overcome the aforementioned deficiencies. First, we propose a methodology for ranking the relevant services for a given request, introducing objective measures based on dominance relationships defined among the services. Second, we investigate methods for clustering the relevant services in a way that reveals and reflects the different trade-offs between the matched parameters. We demonstrate the effectiveness and the efficiency of our proposed techniques and algorithms through extensive experimental evaluation on both real requests and relevance sets, as well as on synthetic scenarios.

Qualitative Analysis on Matchmaking Techniques for Web Service Discovery

The ample adoption of web services raises the challenging problem in web service discovery. Web service discovery is the process of finding appropriate services for the user defined tasks. The big challenge in web service discovery is to discover the services that suit the user requirements and to enhance the efficiency and accuracy in matchmaking procedures. This poster focuses on matchmaking in web service discovery. The objective of matchmaking is to match the service requests with the web service advertisements and to offer appropriate services. This paper is focus on the matchmaking architecture, its information flow and types of matchmaking techniques (functional based matchmaking, non-functional based matchmaking and hybrid matchmaking). It sets the basis for analysis of each matchmaking technique, the existing amenity and snag of it as well as the amendment of each technique.