scholarly journals Modeling the Evaluation Criteria for Security Patterns in Web Service Discovery

2010 ◽  
Vol 1 (13) ◽  
pp. 53-60 ◽  
Author(s):  
V. Prasath
Author(s):  
Nwe Nwe Htay Win ◽  
Bao Jianmin ◽  
Cui Gang ◽  
Saif Ur Rehman

In recent years, although semantic has been widely used in service discovery mechanisms, it still needs to exploit all semantic aspects included in service documents so that the discovered service can highly be relevant with user request. Moreover, it also needs to consider self-adaptability in discovering the services which can adapt to searching conditions or parameters in order to find other suitable and potential services if no feasible solution could exactly satisfy user QoS requirements. Therefore, this paper proposes a novel self-adaptive QoS-based service discovery mechanism which can adapt the discovery process with the help of semantically structured ontology trees if unexpected results are encountered. The discovery process matches the equivalences between service advertisement and requirement using three similarity evaluation criteria namely concept, attribute and constraint similarity. This discovery process is repeated until feasible solution is found and a set of most suitable services are returned to the users. The authors prototype their system called SQoSD to evaluate the efficiency and adaptability compared with OWLS-CPS and RQSS. The experimental results prove that our mechanism is superior to the other compared mechanisms.


2018 ◽  
Vol 6 (9) ◽  
pp. 311-314
Author(s):  
Rahul P. Mirajkar ◽  
Nikhil D. Karande ◽  
Surendra Yadav

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.


Sign in / Sign up

Export Citation Format

Share Document