LAUSR

Developers need to reuse web services and create mashups suitable for various scenarios. Currently, it relies on the developer’s adequate domain knowledge to be able to find services and verify their compatibility. Although service recommendation systems already exist to assist them, inexperienced developers may not be able to adequately express their requirements, resulting in inappropriate and incompatible recommendations. To tackle this problem, we define a service-keyword correlation graph (SKCG) to capture the relationship between services and keywords, and the compatibility among services. Then, we propose keyword-based deep reinforced Steiner tree search (K-DRSTS) to recommend services for mashup creation. K-DRSTS models the task of service discovery as a Steiner tree search problem against SKCG. Leveraging deep reinforcement learning, K-DRSTS provides an efficient solution for solving the NP-hard search problem of the Steiner tree. Extensive experiments on real-world data sets have shown the effectiveness of K-DRSTS.