Search

In recent years, the world has witnessed the increased maturity of service-oriented computing. The mashup, as one of the typical service-based applications, aggregates contents from more than one source into a single user interface. Facing the rapid growth of the number of web services, choosing appropriate web services for different mashup sources plays an important issue in mashup development, when, in particular, the new mashup is developed from the scratch. To solve this cold start problem when creating new mashups, we propose a web Service Recommendation approach for Mashup creation based on Graph network, called SRMG. SRMG makes service recommendation based on service characteristics and historical usage. It first leverages Bidirectional Encoder Representations from Transformers, to intelligently discover mashups with similar functionalities based on specifications. Afterward, it employs GraphGAN to obtain representation vectors for mashups and services based on historical usage, and further obtains mashup preferences for each service based on representation vectors. Finally, the new mashup's preference for target services is derived from the preference of existing mashups that are similar to it. The extensive experiments on real datasets from ProgrammableWeb demonstrate that SRMG is superior to the state-of-the-art ones. [ABSTRACT FROM AUTHOR]

Service-based systems (SBSs) reuse existing loosely coupled Web services to provide value-added composite ones, which brings about much flexibility when the business changes frequently. The advent of automatic Web service composition technology allows system designers to quickly build SBSs without having to manually create process models. Despite the large number of strategies proposed so far, most of them compose Web services through the user-provided initial inputs and expected target outputs, which is not convenient for users to express their functional requirements. To address this issue, we allow users to employ keywords to represent key tasks of the composed Web services. To automatically compose Web services based on the given keywords, we study a new problem of keyword search in the AND/OR graph constructed through semantically matching input-output interfaces of existing related Web services. Due to the complexity of the problem, we propose a heuristic search approach, called UP-DFS. To improve the performance of UP-DFS, we further design two types of pruning strategies. The empirical study shows that our approach can efficiently generate a semantic input-output-based Web service composition that contains all the key tasks in the right order required by users while minimizing the number of services in the composition. [ABSTRACT FROM AUTHOR]