Efficient Retrieval of Web Services Using Prioritization and Clustering

Abstract

WEB services are software entities that have a well defined interface and perform a specific task. Typical examples include services returning information to the user, such as news or weather forecast services. A web service is formally described in a standardized language (WSDL). The service description may include the parameters associated with web services like input , output and quality of service. As web services and service providers proliferate, there will be a large number of candidate, and likely competing, services for fulfilling a desired task. Hence, effective service discovery mechanisms are required for identifying and retrieving the most appropriate services. The main contributions of our paper are summarized as follows; we propose and implement a method for determining dominance relationships among service advertisements that simultaneously takes into consideration multiple PDM criteria. We introduce a method for prioritization and clustering web services based on similarity measures using efficient algorithms

Keywords : Web Service , PDM , dominance score ,TKDD, clustering .