Discovering Homogenous Service Framework Based on Matching Mechanism and Clustering

How to efficiently select Web services that can best meet the requirements of consumers is an ongoing research direction in Web service community. However, current discovery systems support either WSDL or OWL-S Web services but not both.Through the automatically collected WSDL files and the OWL-S web service related matching mechanism, the idea of transforming various existing web services on the Internet into a service cluster of similar homogeneous , then we can create a service search engine successfully and at the same time the search space can be reduced. By means of providing a mechanism for matching the characteristics properties of relevant web services, we can put them all together into a group which can be found and applied.

[1]  Patrick Pantel,et al.  Document clustering with committees , 2002, SIGIR '02.

[2]  Wilson Wong,et al.  Web service clustering using text mining techniques , 2009, Int. J. Agent Oriented Softw. Eng..

[3]  A.S. Ali,et al.  Unique distance measure approach for K-means (UDMA-Km) clustering algorithm , 2007, TENCON 2007 - 2007 IEEE Region 10 Conference.

[4]  Roberto Chinnici,et al.  Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language , 2007 .

[5]  W. Liu,et al.  Trustworthy service selection and composition - reducing the entropy of service-oriented Web , 2005, INDIN '05. 2005 3rd IEEE International Conference on Industrial Informatics, 2005..