The Research Of Semantic Web Service Discovery

The existing standard technologies on description of the web services such as WSDL, UDDI and so on, most of them are based on the syntax layer leading to low precision of search based on keywords, which don't have the ability to describe the function of the services on the semantic layer. The key part of the solution to the existing problems is to put the rich and normalization semantic description on the web services. The rapidly, precisely finding the required service from the huge services released is the basis of the Web service's architecture. Classic algorithm don't take full advantage of the semantic information provided by the service ontology that will induce the low precision of the discovery, and all the services released should participate in the matching process which results in the rapidly increasing of processing time and the space.To overcome the shortcoming of the classic algorithm, with analyzing the description of the web service using the owl-s, an algorithm named ICWSMA being proposed. To reduce the number of the services really should participate in the processing procedure and improve the efficient of the discovery; ICWSMA filters the services using the name space and the information describing the service, and gets the candidate service set entering the function matching of the services. In the procedure of the description filtering, an algorithm main used to solve the problem of the similarity between small text data.In order to improve the precision of the discovery, ICWSMA makes the best of semantic information provided by the ontology and takes the semantic relationships between concepts into account appropriately, at last the idea of infinite classification was proposed to distinguish the service have the same match degree.At last, the performance analysis of the matching algorithm realized show that the algorithm has a good performance in average response time, the recall and precision ratio.