Web Services Discovery Based On Semantic Distance Algorithm

With the fast development of internet, the growing number of web services available on the Web raises new and challenging search problems: efficiently locating functionality-desired web services among numbers of web services. However, traditional web service discovering technology is done by keyword match based on the syntactic description of web service. Such web service discovering technology can not capture the semantic information of web service and is lack of intelligence. The purpose of Semantic web is to extend the current Web, makes the information on the Web semanti cand understood, managedby machine. So semantic-based web service discovering technology is becoming a hot research topic.This paper make a summary of advantage of existing service discovering technology, proposes a web service discovery algorithm based on semantic distance, which using semantic distance of two concepts compute the concept similarity , and then using concept similarity compute the similarity of service , for this , the following three parts are studied in this paper:Imporvement algorithem of semantic distance:the base relation of concepts include equavalation relation, subsume relation, inheritance relation and self-define relation, the paper based on the difference of this relation ,give a strength for each relation, and then compute the semantic distance of concepts, make the computing of semantic distance more precisely.The compute of semantic similarity:the purpose of semantic distance is for the compute of semantic similartiy, in this paper , semantic similarity include three kinds of similarity:concept similarity, concept set similarity, service similarity . This paper also show how to compute this similarity.