Abstract
In this paper, we explore service recommendation and selection in the reusable composition context. The goal is to aid developers finding the most appropriate services in their composition tasks. We specifically focus on mashups, a domain that increasingly targets people without sophisticated programming knowledge. We propose a probabilistic matrix factorization approach with implicit correlation regularization to solve this problem. In particular, we advocate that the co-invocation of services in mashups is driven by both explicit textual similarity and implicit correlation of services, and therefore develop a latent variable model to uncover the latent connections between services by analyzing their co-invocation patterns. We crawled a real dataset from Programmable Web, and extensively evaluated the effectiveness of our proposed approach.
Original language | English |
---|---|
Title of host publication | Proceedings - 2015 IEEE International Conference on Web Services, ICWS 2015 |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 217-224 |
Number of pages | 8 |
ISBN (Electronic) | 9781467380904 |
DOIs | |
Publication status | Published - 13 Aug 2015 |
Externally published | Yes |
Event | IEEE International Conference on Web Services, ICWS 2015 - New York, United States Duration: 27 Jun 2015 → 2 Jul 2015 |
Other
Other | IEEE International Conference on Web Services, ICWS 2015 |
---|---|
Country/Territory | United States |
City | New York |
Period | 27/06/15 → 2/07/15 |
Keywords
- latent variable model
- mashup
- matrix factorization
- recommendation