Goal-Driven Context-Aware Next Service Recommendation for Mashup Composition
Not on the map. Why?
Abstract (arXiv)
As service-oriented architecture becoming one of the most prevalent techniques to rapidly deliver functionalities to customers, increasingly more reusable software components have been published online in forms of web services. To create a mashup, it gets not only time-consuming but also error-prone for developers to find suitable services from such a sea of services. Service discovery and recommendation has thus attracted significant momentum in both academia and industry. This paper proposes a novel incremental recommend-as-you-go approach to recommending next potential service based on the context of a mashup under construction, considering services that have been selected to the current step as well as its mashup goal. The core technique is an algorithm of learning the embedding of services, which learns their past goal-driven context-aware decision making behaviors in addition to their semantic descriptions and co-occurrence history. A goal exclusionary negative sampling mechanism tailored for mashup development is also developed to improve training performance. Extensive experiments on a real-world dataset demonstrate the effectiveness of our approach.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 16 references that are in the map. First posted on arXiv 25 Oct 2022.
Builds on
3 of 16 references.
References · 3
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2014Distributed Representations of Sentences and Documentscited by 678
Built on by
Not cited yet.