Reference Hub11
Clustering Mashups by Integrating Structural and Semantic Similarities Using Fuzzy AHP

Clustering Mashups by Integrating Structural and Semantic Similarities Using Fuzzy AHP

Weifeng Pan, Xinxin Xu, Hua Ming, Carl K. Chang
Copyright: © 2021 |Volume: 18 |Issue: 1 |Pages: 24
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781799859284|DOI: 10.4018/IJWSR.2021010103
Cite Article Cite Article

MLA

Pan, Weifeng, et al. "Clustering Mashups by Integrating Structural and Semantic Similarities Using Fuzzy AHP." IJWSR vol.18, no.1 2021: pp.34-57. http://doi.org/10.4018/IJWSR.2021010103

APA

Pan, W., Xu, X., Ming, H., & Chang, C. K. (2021). Clustering Mashups by Integrating Structural and Semantic Similarities Using Fuzzy AHP. International Journal of Web Services Research (IJWSR), 18(1), 34-57. http://doi.org/10.4018/IJWSR.2021010103

Chicago

Pan, Weifeng, et al. "Clustering Mashups by Integrating Structural and Semantic Similarities Using Fuzzy AHP," International Journal of Web Services Research (IJWSR) 18, no.1: 34-57. http://doi.org/10.4018/IJWSR.2021010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Mashup technology has become a promising way to develop and deliver applications on the web. Automatically organizing Mashups into functionally similar clusters helps improve the performance of Mashup discovery. Although there are many approaches aiming to cluster Mashups, they solely focus on utilizing semantic similarities to guide the Mashup clustering process and are unable to utilize both the structural and semantic information in Mashup profiles. In this paper, a novel approach to cluster Mashups into groups is proposed, which integrates structural similarity and semantic similarity using fuzzy AHP (fuzzy analytic hierarchy process). The structural similarity is computed from usage histories between Mashups and Web APIs using SimRank algorithm. The semantic similarity is computed from the descriptions and tags of Mashups using LDA (latent dirichlet allocation). A clustering algorithm based on the genetic algorithm is employed to cluster Mashups. Comprehensive experiments are performed on a real data set collected from ProgrammableWeb. The results show the effectiveness of the approach when compared with two kinds of conventional approaches.

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.