Maximum Portfolio: A Query Condition Optimization Method

摘要

Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, service discovery becomes important. In the process of discovery, although the user is not familiar with service interfaces, he wants to obtain the best services with some limited simple keywords. Because the keywords are often incomplete or wrong or fuzzy to match with the services in service library, it is difficult to get the satisfying services. This paper provides an approach named as Maximum portfolio to deal with the problem. The aim of maximum portfolio is that the suitable composition is found out from ambiguous input keyword set. The improved service matching algorithm is proposed and applied to the Service Generating Platform. The result of experiment shows the algorithm can improve efficiency of service discovery.