Efficiently finding web services using a clustering semantic approach

Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and UDDI registries also provide keyword searches for Web services. However, the search functionality is very simple and fails to account for relationships between Web services. Firstly, users are overwhelmed by the huge number of irrelevant returned services. Secondly, the intentions of users and the semantics in Web services are ignored. Inspired by the success of partitioning approach used in the database design, we used a novel clustering semantic algorithm to eliminate irrelevant services with respect to a query. Then we utilized Probabilistic Latent Semantic Analysis (PLSA), a machine learning method, to capture the semantics hidden behind the words in a query, and the descriptions in the services, so that service matching can be carried out at the concept level. This paper reports upon the preliminary experimental evaluation that shows improvements over recall and precision.

[1]  Antonio Pumariño,et al.  The binding point , 1997 .

[2]  Amit P. Sheth,et al.  Adding Semantics to Web Services Standards , 2003, ICWS.

[3]  Thomas Hofmann,et al.  Probabilistic Latent Semantic Analysis , 1999, UAI.

[4]  Richi Nayak,et al.  Web Service Discovery with additional Semantics and Clustering , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[5]  Eleni Stroulia,et al.  Semantic Structure Matching for Assessing Web-Service Similarity , 2003, ICSOC.

[6]  Yanchun Zhang,et al.  Algorithm for Web Services Matching , 2004, APWeb.

[7]  Sachindra Joshi,et al.  A matrix density based algorithm to hierarchically co-cluster documents and words , 2003, WWW '03.

[8]  Gerard Salton,et al.  Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

[9]  Takahiro Kawamura,et al.  Semantic Matching of Web Services Capabilities , 2002, SEMWEB.

[10]  Czeslaw Danilowicz,et al.  Re-ranking method based on inter-document distances , 2005, Inf. Process. Manag..

[11]  G. Clark,et al.  Reference , 2008 .

[12]  Boi Faltings,et al.  Flexible and efficient matchmaking and ranking in service directories , 2005, IEEE International Conference on Web Services (ICWS'05).

[13]  Yanchun Zhang,et al.  A probabilistic semantic approach for discovering web services , 2007, WWW '07.

[14]  Yanchun Zhang,et al.  Discovering Web Services Based on Probabilistic Latent Factor Model , 2007, APWeb/WAIM.

[15]  Nicholas Kushmerick,et al.  Learning to Attach Semantic Metadata to Web Services , 2003, International Semantic Web Conference.

[16]  Colin Atkinson,et al.  A Practical Approach to Web Service Discovery and Retrieval , 2007, IEEE International Conference on Web Services (ICWS 2007).

[17]  Jun Zhang,et al.  Simlarity Search for Web Services , 2004, VLDB.

[18]  Yanchun Zhang,et al.  Discovering User Access Pattern Based on Probabilistic Latent Factor Model , 2005, ADC.

[19]  Thomas Haselwanter.  Finding Web Services , 2007 .

[20]  Mark Klein,et al.  Massachusetts Institute of Technology Abraham Bernstein University of Zurich Toward High-Precision Service Retrieval , 2022 .

[21]  Athanasios K. Tsakalidis,et al.  Web Service Discovery Mechanisms: Looking for a Needle in a Haystack? , 2004 .

[22]  Michael W. Berry,et al.  Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices , 2005, TOMS.

[23]  Witold Abramowicz,et al.  Architecture for Web Services Filtering and Clustering , 2007, Second International Conference on Internet and Web Applications and Services (ICIW'07).

[24]  Michael W. Berry,et al.  GTP (General Text Parser) Software for Text Mining , 2003 .