Discovering semantic associations among Web services based on the qualitative probabilistic network

Yue, Kun; Liu, Weiyi; Wang, Xiaoling; Zhou, Aoying; Li, Jin

doi:10.1016/j.eswa.2008.12.044

Cited by 11 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For comparing two services, many languages are used such as : WSDL, OWL, OIL 3 , DAML 4 , and etc. We used the service repository (UDDI) to do the semantic matching of web services.…”

Section: Discussionmentioning

confidence: 99%

A New Approach for Semantic Web Matching

Zamanifar

Heidary

Nematbakhsh

et al. 2010

Communications in Computer and Information Science

View full text Add to dashboard Cite

In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services` functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.

show abstract

“…For comparing two services, many languages are used such as : WSDL, OWL, OIL 3 , DAML 4 , and etc. We used the service repository (UDDI) to do the semantic matching of web services.…”

Section: Discussionmentioning

confidence: 99%

A New Approach for Semantic Web Matching

Zamanifar

Heidary

Nematbakhsh

et al. 2010

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…In this work, they use association-rulemining approach and a hierarchical clustering algorithm for parameter names of Web services. In [5] by mining the historical invocations of component services, they construct a semantic model to describe their behavior rules based on the qualitative probabilistic network. Works which have 2010 2nd International Conference on Software Technology and Engineering(ICSTE)…”

Section: Related Workmentioning

confidence: 99%

“…• The process model gives a detailed description of a service's operation; and the • Grounding which provides details on how to interoperate with a service, via messages. In particular, the semantic service profile in OWL specifies the semantics of the service signature that is the inputs required by the service and the outputs generated [5]. Furthermore, because a service may need external conditions to be satisfied, the profile also describes the preconditions to be satisfied before, and after execution of the service, some expected effects may happen.…”

Section: ) Overlookmentioning

confidence: 99%

How to discover a semantic Web service by knowing its functionality parameters

Heidary

Zamanifar

Nematbakhsh

et al. 2010

2010 2nd International Conference on Software Technology and Engineering

View full text Add to dashboard Cite

In this work, we show how to discover a semantic web service among a repository of web services. A new approach for web service discovering based on calculating the functions similarity. We define the Web service functions with Ontology Web Language (OWL). We wrote some rules for comparing two web services` parameters. Our algorithm compares the parameters of two web services` inputs/outputs by making a bipartite graph. We compute the similarity rate by using the Ford-Fulkerson algorithm. Higher the similarity, the less are the differences between their functions. At last our algorithm chooses the service which has the highest similarity. As a consequence, our method is useful when we need to find a web service suitable to replace an existing one that has failed. Especially in autonomic systems, this situation is very common and important since we need to ensure availability of the application which is based on the failed web service. We use Universal Description, Discovery and Integration (UDDI) compliant web service registry.

show abstract

“…Furthermore, reasoning with qualitative probabilities is much more efficient than reasoning with precise ones, the inference complexity of QPN is a polynomial in the size of the network [5], rather than NP-hard [6]. Therefore, many approaches have been proposed for QPN modeling and inference according to various kinds of applications [7][8][9][10][11][12][13][14][15][16][17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%