Welcome to the InfoSci Platform
Search of Web Service based on Weighted Association Rule

Search of Web Service based on Weighted Association Rule

Lei Wang, Lingyu Xu, Yunlan Xue, Gaowei Zhang, Xiangfeng Luo
Copyright: © 2015 |Volume: 7 |Issue: 3 |Pages: 12
ISSN: 1942-9045|EISSN: 1942-9037|EISBN13: 9781466677395|DOI: 10.4018/IJSSCI.2015070103
Cite Article Cite Article

MLA

Wang, Lei, et al. "Search of Web Service based on Weighted Association Rule." IJSSCI vol.7, no.3 2015: pp.46-57. http://doi.org/10.4018/IJSSCI.2015070103

APA

Wang, L., Xu, L., Xue, Y., Zhang, G., & Luo, X. (2015). Search of Web Service based on Weighted Association Rule. International Journal of Software Science and Computational Intelligence (IJSSCI), 7(3), 46-57. http://doi.org/10.4018/IJSSCI.2015070103

Chicago

Wang, Lei, et al. "Search of Web Service based on Weighted Association Rule," International Journal of Software Science and Computational Intelligence (IJSSCI) 7, no.3: 46-57. http://doi.org/10.4018/IJSSCI.2015070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The rapid growth of web services need efficiently discovering the desired web services for the users. Web service interfaces are defined with WSDL that is described by a bag of terms. Many similarity metrics are proposed to solve this problem, it is hardly to resolve the problem that only few pairs of terms between two services have high semantic distance, the semantic distance of other terms between two services are low. Using traditional keyword search metrics may acquire a wrong result that these two web services are similar, in addition, semantics of the web services is hardly to exploit. In this work the authors firstly help the request service to find the services that belong to the same class, and then they use association rule to find terms that are often appear together and find the most similar terms. The authors weaken the weight of the most similar term contained in an association rule and enhance the other terms' weight contained in an association rule to solve the situation above. The experiments show that our approach outperforms some searching methods.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.