Home > Table of Contents


Proceedings of 2009 International Workshop on Information Security and Application (IWISA 2009)

Qingdao, China, November 21-22, 2009

Editors: Feng Gao and Xijun Zhu

AP Catalog Number: AP-PROC-CS-09CN004

ISBN: 978-952-5726-06-0

Page(s): 465-468

Matching Algorithm of Web Services Based on Semantic Distance

Pengbin Fu, Shanshan Liu, Huirong Yang, and Liheng Gu

Full text: PDF


With the growing number of web services ,the importance of matching and discovery web services is increasing. Using domain ontology to describe the semantic of web services and matching the web services on the semantic level is a hot research pot. In this paper, the problem of matching web services is transformed to the computation of semantic similarity between concepts in domain ontology. We propose the semantic similarity can be measured from the semantic distance and consider the factors of pathlengh, depth, local density and numberofdowndir-ection in the algorithm. We establish that such a measure is an effective means of discriminating services at a level of granularity that is able to enhance the matching process in semantic web services.

Index Terms

domain ontology, matchmaking the Web Services,semantic similarity,semantic distance

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved