Similarity Based Semantic Web Service Match

Authors:
Hui Peng;Wenjia Niu;Ronghuai Huang
Affiliations:
R&D Center for Knowledge Engineering, Beijing Normal University, Beijing, China 100875;Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China 100190;R&D Center for Knowledge Engineering, Beijing Normal University, Beijing, China 100875
Venue:
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Year:
2009

Citing 7
Cited 0

Exploiting hierarchical domain structure to compute similarity

ACM Transactions on Information Systems (TOIS)
Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Semantic Web Services Composition Using AI Planning of Description Logics

APSCC '06 Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing
Improving Grade Match to Value Match for Semantic Web Service Discovery

ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 05
HTN planning for Web Service composition using SHOP2

Web Semantics: Science, Services and Agents on the World Wide Web
Structural and semantic similarity metrics for web service matchmaking

EC-Web'07 Proceedings of the 8th international conference on E-commerce and web technologies
Detecting similarities in ontologies with the SOQA-SimPack toolkit

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semantic web service discovery aims at returning the most matching advertised services to the service requester by comparing the semantic of the request service with an advertised service. The semantic of a web service are described in terms of inputs, outputs, preconditions and results in Ontology Web Language for Service (OWL-S) which formalized by W3C. In this paper we proposed an algorithm to calculate the semantic similarity of two services by weighted averaging their inputs and outputs similarities. Case study and applications show the effectiveness of our algorithm in service match.