Abstract

Mashup is emerging as a promising software development method for allowing software developers to compose existing Web APIs to create new or value-added composite Web services. However, the rapid growth in the number of available Mashup services makes it difficult for software developers to select a suitable Mashup service to satisfy their requirements. Even though clustering based Mashup discovery technique shows a promise of improving the quality of Mashup service discovery, Mashup service clustering with high accuracy for discovery of Mashup services is still a challenge problem. In this paper, we propose a novel Mashup service clustering method for Mashup service discovery with high accuracy by exploiting LDA topic model built from multiple data sources. It enables to infer topic probability distribution of Mashup services, which serves as a basis of computation of similarity of Mashup services. K-means and Agnes algorithm are used to perform Mashup service clustering in terms of their similarities. Compared with other service clustering approaches, experimental results show that our approach achieves significant improvement in terms of precision, recall and F-measure rate, which will improve Mashup service discovery.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call