Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching

2007 ◽  
Author(s):  
Umesh Bellur ◽  
Roshan Kulkarni
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Bipartite Graph ◽  
Graph Matching ◽  
Semantic Web Services ◽  
Bipartite Graph Matching

The Extended Algorithm of the Bipartite Graph Matching Semantic Web Service Discovery

2014 ◽  
Vol 886 ◽  
pp. 677-680
Author(s):  
Bing Yue Liu
Keyword(s):  
Semantic Web ◽  
Web Service ◽  
Bipartite Graph ◽  
Service Discovery ◽  
Graph Matching ◽  
Recall Rate ◽  
Semantic Web Service ◽  
Web Service Discovery ◽  
Bipartite Graph Matching ◽  
Semantic Web Service Discovery

In previous work, the ontology-based algorithm of bipartite graph matching semantic web service discovery was presented. But in these algorithms, the problem of finding augment path was not resolved very well. It will affect the recall rate and precision rate of web service discovery. In order to resolve these problems, this paper proposes an ontology-based bipartite graph matching semantic web service discovery algorithm, which extends the optimal bipartite graph matching algorithm. It uses the slack function to find the augment path in the equivalent sub graph. The algorithm also contributes to the improvement of the recall rate and precision rate of the service discovery.

PROCESS MODEL ONTOLOGY-BASED MATCHMAKING OF SEMANTIC WEB SERVICES

2011 ◽  
Vol 20 (04) ◽  
pp. 357-370 ◽  
Author(s):  
D. PAULRAJ ◽  
S. SWAMYNATHAN ◽  
M. MADHAIYAN
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Process Model ◽  
Service Discovery ◽  
Service Oriented Architecture ◽  
Semantic Web Services ◽  
Functional Part ◽  
Service Oriented ◽  
Concise Description

One of the key challenges of the Service Oriented Architecture is the discovery of relevant services for a given task. In Semantic Web Services, service discovery is generally achieved by using the service profile ontology of OWL-S. Profile of a service is a derived, concise description and not a functional part of the semantic web service. There is no schema present in the service profile to describe the input, output (IO), and the IOs in the service profile are not always annotated with ontology concepts, whereas the process model has such a schema to describe the IOs which are always annotated with ontology concepts. In this paper, we propose a complementary sophisticated matchmaking approach which uses the concrete process model ontology of OWL-S instead of the concise service profile ontology. Empirical analysis shows that high precision and recall can be achieved by using the process model-based service discovery.

Sign in / Sign up

Export Citation Format

Share Document