Study of Web Service Discovery Algorithm Based on Semantic

摘要

Most of the exiting discovery algorithms focus on the functional properties calculation, and the process model has not been taken into account which leads to the low recall and precision of web service. In the similarity computation of service functional properties, the input and output parameters are divided into pairs by their relationships and process model is transformed into corresponding directed trees, and we can get the similarity between processes by the isomorphism of the directed trees and the similarity computation of tree's nodes and edges. As experiments state, the cache-based discovery algorithm will significantly improve web service discovery in precision and time consumed.