A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Workflow discovery: the problem, a case study from e-Science and a graph-based solution
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Discovering Semantic Web Services with and without a Common Ontology Commitment
SCW '06 Proceedings of the IEEE Services Computing Workshops
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
ECOWS '06 Proceedings of the European Conference on Web Services
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
WISE: A Workflow Information Search Engine
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Workflow matching using semantic metadata
Proceedings of the fifth international conference on Knowledge capture
Ranking and Clustering Web Services Using Multicriteria Dominance Relationships
IEEE Transactions on Services Computing
User profile based activities in flexible processes
Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
| Hi-index | 0.00 |
Existing techniques for Web service discovery focus mainly on matching functional parameters of atomic services, such as inputs and outputs. However, one of the main advantages of Web services is that they are often composed into more complex processes to achieve a given goal. Applying such techniques in these cases, ignores the workflow structure of the composite process, and therefore may produce matches that are not very accurate. To overcome this limitation, we propose in this paper a graph-based method for matching composite services, that are semantically described as OWL-S processes. We propose a graph representation of composite OWL-S processes and we introduce a matching algorithm that performs comparisons not only at the level of individual components but also at the structural level, taking into consideration the control flow among the atomic components. We also report our preliminary results of our experimental evaluation.