Web service discovery based on maximum weighted bipartite graphs

摘要

Web service discovery is the process that service requestor or user finds services to meet their requirements, its core technologies include Web service description language and the service matching algorithm. Duo to services with more ambiguity, using service-oriented computing in the process of finding service without strong restriction can cause some error services which have the same background but not satisfy the initial request returned. In order to eliminate the effect of this kind of situation in service-oriented computing, we present a novel approach for Web service retrieval based on the evaluation of similarity between Web service interfaces. The algorithm automatically distributes the keyword weights for the request service, in order to weaken the weight of some keywords in request service have the same background in services set, which is to help the request service find the more accurate results. The experiments show that our solution outperforms some searching methods.