Algorithm for Semantic Web Services Clustering and Discovery

With the quick increase of web services on the Internet, how to discover proper services efficiently in a large number of web services becomes more and more difficult. Services discovery efficiency can be improved greatly after services have been classified well, so an algorithm of clustering services which uses graph theory and a corresponding algorithm of discover services are proposed in this paper. The algorithms in this paper are for semantic web services because it is the direction of web services. Ontology is used to represent the I/O parameters of semantic web service to benefit from the advantages of using ontology.