Semantic web services matchmaking using bipartite graph matching with ranking

Authors:
S. Ringe;J. Gadge
Affiliations:
Fr. Conceicao Rodrigues College of Engineering, Bandra-west, Mumbai, India;Thadomal Shahani Engineering College, Bandra-west, Mumbai, India
Venue:
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Year:
2010

Citing 3
Cited 0

Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Searching Semantic Web Services: An Intelligent Agent Approach Using Semantic Enhancement of Client Input Term(s) and Matchmaking Step

CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
Pellet: A practical OWL-DL reasoner

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service discovery has been well recognized challenge in the application of Service Oriented Architecture. Semantic Web Services enable discovery, execution and composition of automated web services by combining web services based on standards, such as SOAP, WSDL and UDDI, with semantic web technologies such as RDF, DAML+OIL and OWL. In this way, services are able to dynamically adapt themselves to changes without human intervention. Semantic Matchmaking Algorithm of the web service discovery is proposed by M. Paolucci [1]. Bipartite Graph Matchmaking algorithm [2] used in this paper overcomes the problems of this original algorithm, due to its greedy nature and removes false positive/false negative results by inverting the rules for Plugin and Subsume degree of match and accurate the results. In this paper, a Ranking algorithm, based on the Semantic Similarity between two nodes in Ontology, is proposed to Rank the results of service retrievals of Bipartite Graph Matchmaking algorithm. Comparative results show that the algorithm is able to refine the search.