With the rapid development of the Internet, the number of Web APIs is increasing. How to recommend accurate and appropriate Web APIs to mashups has become a focus and difficulty in the field of service computing. The existing methods are mainly based on collaborative filtering technology, but these methods have problems such as the data sparsity and cold start, which leads to poor recommendation effects. This paper proposes a service recommendation model based on knowledge graph and collaborative filtering. In this model, the knowledge graph connects the APIs and mashups related information to mine the potential relations between mashups and APIs, hence reducing the impact of data sparsity. All the API entities in the service knowledge graph are embedded into the low-dimensional space through the representation learning algorithm, then the distances between the API vectors are calculated to recommend the related APIs. In addition, in order to solve the cold-start problem of recommending APIs to target mashups that have no APIs usage, the similarities of functional sets extracted from mashups are calculated to recommend APIs for target mashups. At the same time, the model obtains the Mashup-API usage record, using the technology of collaborative filtering to recommend appropriate APIs to target mashups. Finally, the similarities of the above recommended APIs are normalized and sorted to form the final recommendation result. The experimental results show that our proposed model significantly improves the accuracy of service recommendation.
Even though the number of services is increasing, a single service can just complete simple tasks. In the face of complex tasks, we require composite multiple services to complete them. For the purpose of improving the efficiency of web service composition, we propose a service composition approach based on an improved fireworks algorithm (FWA++). First, we use the strategy of random selection to keep N − 1 individuals for the next generation, and the purpose is to speed up the convergence speed of the FWA++ and enhance the search ability. Second, we randomize the total number of sparks and maximum amplitude of sparks for each generation. In this way, the search ability and the ability to jump out of the local optimal solution are dynamically balanced throughout the execution of the algorithm. Our experimental results show that compared with other existing approaches, the approach proposed in this paper is more efficient and stable.
Thanks to the rapid development of service-oriented computing (SOC) technologies, the number of Web services, such as Web API, is increasing rapidly. However, this brings some difficulties for mashup (a kind of Web API composition) developers to choose appropriate Web Services to build their projects. Finding required Web APIs from a large number of candidates and recommending them to developers has become a vital issue in mashup development. The traditional collaborative filtering algorithm has the problems of cold start and sparse data. In order to solve the deficiency of the collaborative filtering algorithm, we propose an improved hybrid method that combines the two kinds of information to generate word embedding and node embedding, avoiding the cold start problem and data sparsity problem. Experiments on real-world data sets show that our proposed approach is better than five state-of-the-art approaches, which verifies the effectiveness of our approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.