Incorporating LDA With Word Embedding for Web Service Clustering

2018 ◽  
Vol 15 (4) ◽  
pp. 29-44 ◽  
Author(s):  
Yi Zhao ◽  
Chong Wang ◽  
Jian Wang ◽  
Keqing He

With the rapid growth of web services on the internet, web service discovery has become a hot topic in services computing. Faced with the heterogeneous and unstructured service descriptions, many service clustering approaches have been proposed to promote web service discovery, and many other approaches leveraged auxiliary features to enhance the classical LDA model to achieve better clustering performance. However, these extended LDA approaches still have limitations in processing data sparsity and noise words. This article proposes a novel web service clustering approach by incorporating LDA with word embedding, which leverages relevant words obtained based on word embedding to improve the performance of web service clustering. Especially, the semantically relevant words of service keywords by Word2vec were used to train the word embeddings and then incorporated into the LDA training process. Finally, experiments conducted on a real-world dataset published on ProgrammableWeb show that the authors' proposed approach can achieve better clustering performance than several classical approaches.

2020 ◽  
Vol 17 (4) ◽  
pp. 32-54
Author(s):  
Banage T. G. S. Kumara ◽  
Incheon Paik ◽  
Yuichi Yaguchi

With the large number of web services now available via the internet, web service discovery has become a challenging and time-consuming task. Organizing web services into similar clusters is a very efficient approach to reducing the search space. A principal issue for clustering is computing the semantic similarity between services. Current approaches do not consider the domain-specific context in measuring similarity and this has affected their clustering performance. This paper proposes a context-aware similarity (CAS) method that learns domain context by machine learning to produce models of context for terms retrieved from the web. To analyze visually the effect of domain context on the clustering results, the clustering approach applies a spherical associated-keyword-space algorithm. The CAS method analyzes the hidden semantics of services within a particular domain, and the awareness of service context helps to find cluster tensors that characterize the cluster elements. Experimental results show that the clustering approach works efficiently.


2013 ◽  
Vol 12 (5) ◽  
pp. 967-974 ◽  
Author(s):  
Yu Yue Du ◽  
Yong Jun Zhang ◽  
Xing Lin Zhang

Author(s):  
Sreeparna Mukherjee ◽  
Asoke Nath

The success of the web depended on the fact that it was simple and ubiquitous. Over the years, the web has evolved to become not only the repository for accessing information but also for storing software components. This transformation resulted in increased business needs and with the availability of huge volumes of data and the continuous evolution in Web services functions derive the need of application of data mining in the Web service domain. Here we focus on applying various data mining techniques to the cluster web services to improve the Web service discovery process. We end this with the various challenges that are faced in this process of data mining of web services.


Author(s):  
Banage T. G. S. Kumara ◽  
Incheon Paik ◽  
Koswatte R. C. Koswatte

Existing technologies for web services have been extended to give the value-added customized services to users through the service composition. Service composition consists of four major stages: planning, discovery, selection, and execution. However, with the proliferation of web services, service discovery and selection are becoming challenging and time-consuming tasks. Organizing services into similar clusters is a very efficient approach. Existing clustering approaches have problems that include discovering semantic characteristics, loss of semantic information, and a shortage of high-quality ontologies. Thus, the authors proposed hybrid term similarity-based clustering approach in their previous work. Further, the current clustering approaches do not consider the sub-clusters within a cluster. In this chapter, the authors propose a multi-level clustering approach to prune the search space further in discovery process. Empirical study of the prototyping system has proved the effectiveness of the proposed multi-level clustering approach.


Sign in / Sign up

Export Citation Format

Share Document