A Continuous Rating for Webservice Matching
Wilfried van Asten · 2012
The semantic web is continuously growing. With the growing number of web services it is becoming more and more vital to choose the right web service. A method exists for ordering web services based on their match to a request, but this method does not make a very ne distinction between web services that do not provide the exact answer. This paper renes this method so a better choice can be made between the services. An algorithm that implements the improved method is presented and a complexity analysis is done. It is shown that the method performs well when it should and gives better results in exchange for performance when necessary.