An Improved Semantic Web Services Grades Matching Algorithm
Dai Yao-wen · Techniques of Automation and Applications · 2010
One of the key problems of the Web Services is how to meet user requirement quickly and efficiently.Aiming at OWL-S/ UDDI grades matching algorithm which has large rank size of grades and do not make a distinction within same grades.The paper presented an improved algorithm.The method is on basis of level of refinement,and take advantage of recall and precision of informatin retrieval,at the same time combined with the calculation of semantic similarity to convert the discrete way into the continuous representation in the asymmetric ways,also make a distinction within same grades and improve the search accurate degree.The comparison operations have been done when the services hava been published.The experimental results show that the service response time is far less than the OWL-S/UDDI grades matching algorithm.