Effective web-service discovery using K-means clustering

11Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Web Services are proving to be a convenient way to integrate distributed software applications. As service-oriented architecture is getting popular, vast numbers of web services have been developed all over the world. But it is a challenging task to find the relevant or similar web services using web services registry such as UDDI. Current UDDI search uses keywords from web service and company information in its registry to retrieve web services. This information cannot fully capture user's needs and may miss out on potential matches. Underlying functionality and semantics of web services need to be considered. In this study, we explore the resemblance among web services using WSDL document features such as WSDL Content and Web Services name. We compute the similarity of web services and use this data to generate clusters using K-means clustering algorithm. This approach has really yielded good results and can be efficiently used by any web service search engine to retrieve similar or related web services. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Vijayan, A. S., & Balasundaram, S. R. (2013). Effective web-service discovery using K-means clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7753 LNCS, pp. 455–464). Springer Verlag. https://doi.org/10.1007/978-3-642-36071-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free