A Model for Web Services Discovery with Matching Algorithm

More Web Services have been used in the Internet. The way to search suitable Web Services concerned with User Service Request becomes research highlight of Web Services. Aiming at solving discovery problems, we proposed a model for Web Services Discovery with matching algorithm. For supporting model, we construct the whole framework. For achieving global optimal result, we implement match-scheduling and match pattern procedure in the framework by Cofactor Expansion Method and Vector Space Model respectively. Additionally, we improve Vogel´s Approximation Method as a substitute to get local optimal result in a short time. Compared with classic Services Discovery algorithm, our method returns more suitable services and shows good performance in Recall and Precision Ratio.