Efficient web service discovery using hierarchical clustering

Abstract

This paper presents an efficient web service discovery approach using hierarchical agglomerative clustering (HAC). Services in a repository are clustered based on a dissimilarity measure from attached matchmaker. Service discovery is then performed over the resulting dendrogram (binary tree), which has time complexity of O(log n). In comparison with conventional approaches that mostly perform exhaustive search, service-clustering method brings a dramatic improvement on time complexity with an acceptable loss in precision. © 2013 Springer-Verlag.