Web Service Recommendation Research Articles

A graph-based QoS prediction approach for web service recommendation

With the development of the Internet, the recommendation based on Quality of Service(QoS) is proven to be an efficient way to deal with the ever-increasing web services in both industry and academia. However, it is hard to make an accurate recommendation using sparse QoS data, which makes QoS prediction a growing concern in the context of web service recommendation. In this research, a novel Graph-based Matrix Factorization approach(GMF) is proposed for QoS prediction. First, a concept of integrated-graph is put forward to consolidate multi-source information from user–aware context and service-aware context, and to deep mine potential relationships based on QoS matrix. Furthermore, the integrated-graph is divided into several sub-graphs by cutting insignificant edges to reduce noises and strengthen interactions between users and services. Based on the local information of each sub-graph and the global information of integrated-graph, a Gaussian Mixture Model(GMM) of QoS value is built as a fusion method to combine local and global information adaptively and to complete final QoS prediction. The extensive experimental analysis on a publicly available dataset indicate that our graph-based method is both accurate and practical.

WITHDRAWN: Recent web service recommendation methods: A review

Web services have become a substantial part of today’s world they are helping to fulfill users’ needs and are making their life easier by providing the services which the users need as per the expectations. The complications behind the service provisions are kept hidden from the customers and the services are provided in a very simple manner. The web service recommendations are helping the users for choosing the services and the software systems they want to use. The important fact for choosing the best web services is the simple task of utilizing the QoS to recommend the services to the clients. Web services are growing day by day making the paramount data for web services. This is a tedious job for a customer to choose a suitable service. A Contemptible service assurance will lead to unsatisfactory results for the consumers. This paper presents the research and investigation of various web service recommendation approaches.

Service Recommendation with High Accuracy and Diversity

In recent years, the number of web services grows explosively. With a large amount of information resources, it is difficult for users to quickly find the services they need. Thus, the design of an effective web service recommendation method has become the key factor to satisfy the requirements of users. However, traditional recommendation methods often tend to pay more attention to the accuracy of the results but ignore the diversity, which may lead to redundancy and overfitting, thus reducing the satisfaction of users. Considering these drawbacks, a novel method called DivMTID is proposed to improve the effectiveness by achieving accurate and diversified recommendations. First, we utilize users’ historical scores of web services to explore the users’ preferences. And we use the TF-IDF algorithm to calculate the weight vector of each web service. Second, we utilize cosine similarity to calculate the similarity between candidate web services and historical web services and we also forecast the ranking scores of candidate web services. At last, a diversification method is used to generate the top- K recommended list for users. And through a case study, we show that DivMTID is an effective, accurate, and diversified web service recommendation method.

Strategies of similarity propagation in web service recommender systems.

Recently, web service recommender systems have attracted much attention due to the popularity of Service-Oriented Computing and Cloud Computing. Memory-based collaborative filtering approaches which mainly rely on the similarity calculation are widely studied to realize the recommendation. In these research works, the similarity between two users is computed based on the QoS data of their commonly-invoked services and the similarity between two services is computed based on the common users who invoked them. However, most approaches ignore that the similarity calculation is not always accurate under a sparse data condition. To address this problem, we propose a similarity propagation method to accurately evaluate the similarities between users or services. Similarity propagation means that "if A and B are similar, and B and C are similar, then A and C will be similar to some extent". Firstly, the similarity graph of users or services is constructed according to the QoS data. Then, the similarity propagation paths between two nodes on the similarity graph are discovered. Finally, the similarity along each propagation path is measured and the indirect similarity between two users or services is evaluated by aggregating the similarities of different paths connecting them. Comprehensive experiments on real-world datasets demonstrate that our similarity propagation method can outstandingly improve the QoS prediction accuracy of memory-based collaborative filtering approaches.

Web Service Instant Recommendation for Sustainable Service Mashup

Service Mashups can help users to integrate data of multiple sources based on Web services composition. Considering a kind of sustainable service Mashup whose data requirement cannot be predetermined, so users need to choose and compose services in a tentative manner. Meanwhile, users can choose and compose services continually to obtain more data based on existing composition results. In such Mashups, a Web service is chosen according to the data provided by the service. Because it is difficult for users to choose from large amounts of services manually, it is a challenge to recommend services instantly for users during the construction of a sustainable service Mashup. This paper proposes an approach to recommend Web services instantly for a sustainable service Mashup. According to the services used in the service Mashup under construction, candidate services are chosen based on the Mashups that are similar to the constructing Mashup, as well as the parameter correlations of services from the perspective of actual operations of Web service composition. Experimental results indicate that the proposed approach has better precision, recall, and coverage values compared to existing state-of-the-art approaches, and therefore, it is more suitable for instant service recommendation of sustainable service Mashups.

Web Service Recommendation Method of Hybrid Item-Memory based Collaborative Filtering for Scalability of Data

Web Service Recommendation Method of Hybrid Item-Memory based Collaborative Filtering for Scalability of Data

An LSTM Based Time Series Forecasting Framework for Web Services Recommendation

The convergence of Social Mobility Analytics and Cloud (SMAC) technologies gives rise to an unforeseen aggrandization of the web services on the internet. The resilience and payment-based approach of the cloud makes it an obvious choice for the deployment of web services-based applications. Out of available web services, to gratify the similar functionalities, the choice of the web service based on the personalized quality of service (QoS) parameters plays an importantrole in determining the selection of the web service. The role of time is rarely being discussed in deciding the QoS of web services. The delivery of QoS is not made as declared due to the non-functional performance of web services correlated behavior with the invocation time. This happens because service status usually changes over time. Hence, the design of the time a ware web service recommendation system based on the personalized QoS parameters is very crucial and becomes a challenging research issue. In this study, LSTM based deep learning models were used for the prediction of these time aware QoS parameters and the results are compared with the previous approaches. The experimental results show that the LSTM based Time Series Forecasting Framework is performing better. The RMSE, MAE, and MAPE are used as an evaluation metric and their value for the prediction of Response time (RT) is found to be 0.030269, 0.02382 and 0.59773 respectively with adaptive moment estimation as the training option and is found to be 0.66988, 0.66465 and 27.9934 respectively with root mean square propagation as the training option. The RMSE, MAE, and MAPE value for the prediction of through put (TP) is found to be 0.77787, 0.4792 and 1.61 respectively with adaptive moment estimation as the training option and is found to be 0.2.7087, 1.4076 and 7.1559 respectively with root mean square propagation as the training option respectively. Thus, the experimental results show that the LSTM model of Time Series Fore casting for Web Services Recommendation Framework is performing better as compared to previous methods.

Heterogeneous ensemble learning method for personalized semantic web service recommendation

Semantic web service (SWS) discovery and recommendation (SWSR) has emerged as a potential technology which aims to fulfill the user requirements by providing an improved recommendation for Academic and business communities. In SWSR, the user search pattern is adopted to make service discovery as well as recommendation. In order to achieve the precise recommendation of SWS, the ensemble learning method is utilized. This method encompasses the elimination of in-appropriate features and selects the optimal features of the requirements for the Academic and business communities. Semantic analysis is the one of the dominant technologies for SWSR, but it has not yet been explored by applying the ensemble learning over the service features to make optimal selection of features and to provide personalized recommendation. With this motive, in this paper a Heterogeneous Ensemble Learning method for Semantic web service Personalization and recommendation (HEL-SWSR) framework has been proposed. It will revitalize the industries to select optimal services SWS discovery. HEL-SWSR assists the feature extractions, concatenation of features selection using user profiles and triples from the OWL-S files. This framework combines various methods that eventually ensure service selection through the Maximum Voting Ensemble (MVE) technique. The MVE helps to select the services and recommends the top-10 services. From that list, the Academic or Business communities can be able to predict the appropriate services. The proposed framework performance is noticeably enhanced when compared with the traditional user search pattern technique.

Performance Analysis of a Clustering Model for QoS-Aware Service Recommendation

The numbers of web services are growing rapidly in recent years. One of the most challenging issues in service computing is the personalized recommendation of Web services. Most of the current research recommends services based on Quality of Service (QoS)-aware data with few considerations of service-side factors, such as service functions. In this paper, a new QoS-aware Web service recommendation model based on user and service clustering (RMUSC) is proposed to gain an advance in recommended accuracy. Firstly, similar users are clustered together by a Top-N similarity algorithm through the user QoS records. Secondly, a K-means++ based filtering service cluster is established. Finally, a user and services collaborative scheme is exploited and obtains potential user QoS preferences to generate recommendations. The experimental results show that when the density of the service invocation matrix is 5%, 10% and 20%. the average absolute error (MAE) and root mean square error (RMSE) of RMUSC are lower than those of other methods.

Topic-aware Web Service Representation Learning

The advent of Service-Oriented Architecture (SOA) has brought a fundamental shift in the way in which distributed applications are implemented. An overwhelming number of Web-based services (e.g., APIs and Mashups) have leveraged this shift and furthered development. Applications designed with SOA principles are typically characterized by frequent dependencies with one another in the form of heterogeneous networks, i.e., annotation relations between tags and services, and composition relations between Mashups and APIs. Although prior work has shown the utility gained by exploring these networks, their analysis is still in its infancy. This article develops an approach to learning representations of the Web service network, which seeks to embed Web services in low-dimensional continuous vectors with preserved information of the network structure, functional tags, and service descriptions, such that services with similar functional properties and network structures are mapped together in the learned latent space. We first propose a topic generative model for constructing two topic distribution networks (Mashup-Topic and API-Topic) from the service content. Then, we present an efficient optimization process to derive low-dimensional vector representations of Web services from a tri-layer bipartite network with the Mashup-Topic and API-Topic networks on two ends and the Mashup-API composition network in the middle. Experiments on real-word datasets have verified that our approach is effective to learn robust low-rank service representations, i.e., 25% F1-measure gain over the state-of-the-art in Web service recommendation task.

A Web service recommendation system based on QoS attribute based collaborative filtering

A Web service recommendation system based on QoS attribute based collaborative filtering

Geographic-aware collaborative filtering for web service recommendation

The explosion of reusable Web services (e.g., open APIs, open data sources, and cloud/IoT services), has become a new opportunity for modern service-composition based applications development. However, this enormous growth of Web services increases the difficulty of selecting the best suitable Web services for a particular application. Hence, the design of an effective and efficient Web service recommendation, primarily based on user feedback, has become a challenge. In the mashup-API recommendation scenario, the most available feedback is the implicit invocation data, i.e., the binary data indicating whether or not a mashup has invoked an API. Various efforts are exploiting potential impact factors, such as the invocation context, to augment the implicit invocation data with the aim to improve service recommendation performance. One significant factor affecting the context of Web service invocations is geographical location, but it has been given less attention in the implicit-based service recommendation. In this paper, we propose a probabilistic matrix factorization based recommendation approach, which considers geographic location information in the derivation of the preference degree underlying a mashup-API interaction. The geographic information, which is integrated with functional descriptions, complements the mashup-API invocation data input for our matrix factorization model. We demonstrate the effectiveness of our approach by conducting extensive experiments on a real dataset crawled from ProgrammableWeb. The evaluation results show that augmenting the implicit data with geographical location information increases the precision of API recommendation for mashup services.

A probability distribution detection based hybrid ensemble QoS prediction approach

Recently, with the rapid increase in the number of web services, how to discover services to meet personalized requirements of users in large-scale scenarios has become a popular topic in both industry and academia. The quality of service (QoS) prediction-based web service recommendation system has been widely studied as an effective method for solving this problem. However, due to the sparsity and imbalance of the observed QoS data, existing QoS prediction approaches suffer from limited prediction accuracy and poor scalability. Moreover, existing QoS prediction approaches do not consider the probability distribution of the observed QoS data, which have remarkable impacts on the prediction performance. In this paper, we propose a novel probability distribution detection-based hybrid ensemble QoS prediction model that can dynamically integrate a set of basic prediction models to improve the prediction accuracy instead of designing complex and time-consuming models. Specifically, we first propose an enhanced CF (collaborative filtering)-based approach as the basis of the prediction model. Second, given the results of a set of other basic prediction models, in addition, we propose a distribution detection algorithm to calculate the PCWs (probability confidence weights) of those results. Finally, we combine them dynamically to obtain final results based on PCWs. Experiments based on real datasets show that our approach has higher prediction accuracy and better scalability than existing mainstream QoS prediction approaches.

Neural Net Time Series Forecasting Framework for Time-Aware Web Services Recommendation

Abstract The convergence of Social Mobility Analytics and Cloud (SMAC) technologies resulted in an unexpected upsurge of web services on the internet. The flexibility and rental approach of the cloud makes it an attractive option for the deployment of web services-based applications. Once a number of web services are available to gratify the similar functionalities, then the choice of the web service based on personalized quality of service (QoS) parameters plays an important role in deciding the selection of the web service. The role of time is rarely being discussed in deciding the QoS of web services. The delivery of QoS is not made as declared due to the correlated behavior of the non-functional performance of web services with the invocation time. This happens because service status usually changes over time. These limitations have affected the performance of neighborhood-based collaborative filtering. Hence, the design of the time aware web service recommendation system based on the personalized QoS parameters is very crucial and turns out to be a challenging research issue. In the current work, various neural network models like Levenberg Marquardt (LM), Bayesian-Regularization (BR) and Scaled-Conjugate-Gradient (SCG) are used for experimentation with the input time series to find the best fit model for the prediction of personalized QoS based web services recommendation. The Pearson’s Correlation Coefficient is used as an evaluation metric and their value for the prediction of Response time is found to be 0.84985 and for throughput (TP) is found to be 0.99082 with the Levenberg Marquardt algorithm. Thus, the experimental results show that the with the Levenberg Marquardt model of Time Series Forecasting for Web Services Recommendation Framework is performing better in case of Response time as well as throughput.

An Econometric Time Series Forecasting Framework for Web Services Recommendation

The convergence of SMAC technologies resulted in an unexpected upsurge of web services on the internet. The flexibility and rental approach of the cloud makes it an attractive option for the deployment of web services-based applications. Once a number of web services are available to gratify the similar functionalities, then the choice of the web service based on personalized quality of service (QoS) parameters plays an important role in deciding the selection of the web service. The role of time is rarely being discussed in deciding the QoS of web services. The delivery of QoS is not made as declared due to the correlated behavior of non-functional performance of web services with the invocation time. This happens because service status usually changes over time. These limitations have affected the performance of neighborhood-based collaborative filtering. Hence, the design of the time aware web service recommendation system based on the personalized QoS parameters is very crucial and turn out to be a challenging research issue. In the current work, various econometric models are used for experimentation with the input time series to find the best fit model for the prediction of personalized QoS based web services recommendation. The Akaike Information Criteria (AIC) and Bayesian Information Criteria (BIC) value is used as an evaluation metric and their value for the prediction of Response time is found to be 1.7392e+04 and 1.7416e+04 respectively with the ARMA model. The AIC and BIC value for throughput (TP) is found to be 1.5249e+04 and 1.5334e+04 respectively with the ARIMA. The value of variance is 13.2437 and 6.8131 for RT and TP respectively which is also the lowest among other models with t-statistic greater than the p-value. Thus, the experimental results show that the ARMA and ARIMA model of Time Series Forecasting for Web Services Recommendation Framework is performing better in case of Response time and throughput respectively.

QoS-based Web Service Recommendation using Popular-dependent Collaborative Filtering

Since, most of the organizations present their services electronically, the number of functionally-equivalent web services is increasing as well as the number of users that employ those web services. Consequently, plenty of information is generated by the users and the web services that lead to the users be in trouble in finding their appropriate web services. Therefore, it is required to provide a recommendation method for predicting the quality of web services (QoS) and recommending web services. Most of the existing collaborative filtering approaches don’t operate efficiently in recommending web services due to ignoring some effective factors such as dependency among users/web services, the popularity of users/web services, and the location of web services/users. In this paper, a web service recommendation method called Popular-Dependent Collaborative Filtering (PDCF) is proposed. The proposed method handles QoS differences experienced by the users as well as the dependency among users on a specific web service using the user/web service dependency factor. Additionally, the user/web service popularity factor is considered in the PDCF that significantly enhances its effectiveness. We also proposed a location-aware method called LPDCF which considers the location of web services into the recommendation process of the PDCF. A set of experiments is conducted to evaluate the performance of the PDCF and investigating the impression of the matrix factorization model on the efficiency of the PDCF with two real-world datasets. The results indicate that the PDCF outperforms other competing methods in most cases.

IoT Service Recommendation Scheme Based on Matter Diffusion

With the development of Internet of Things(IoT), more and more smart devices and services appeared in people's life. These services make life more convenient, while it is difficult for people, especially the elderly, to find them in time, because they are widely distributed in great numbers with small sizes. In order to solve this problem, the service recommendation scheme, which is becoming increasingly important, needs to be used in IoT. However, the traditional web service recommendation schemes are not suitable for the IoT, because they rely more on the historical information rather than the energy state or the user's habit attributes, which are important for IoT. We research the service recommendation scheme, finding that the service recommendation process in IoT is a process of matter flows, which follows the conservation of matter. Therefore, we propose the service recommendation scheme based on tripartite graph with matter diffusion and use the habit feature as a dynamic tag. Based on the balance of matter, we use the positive and negative matter diffusion results on the tripartite as the recommendation results. The results of our evaluation show that the performance of the service recommendation scheme is improved in the precision and recall.

DLTSR: A Deep Learning Framework for Recommendations of Long-Tail Web Services

With the growing popularity of web services, more and more developers are composing multiple services into mashups. Developers show an increasing interest in non-popular services (i.e., long-tail ones), however, there are very scarce studies trying to address the long-tail web service recommendation problem. The major challenges for recommending long-tail services accurately include severe sparsity of historical usage data and unsatisfactory quality of description content. In this paper, we propose to build a deep learning framework to address these challenges and perform accurate long-tail recommendations. To tackle the problem of unsatisfactory quality of description content, we use stacked denoising autoencoders (SDAE) to perform feature extraction. Additionally, we impose the usage records in hot services as a regularization of the encoding output of SDAE, to provide feedback to content extraction. To address the sparsity of historical usage data, we learn the patterns of developers’ preference instead of modeling individual services. Our experimental results on a real-world dataset demonstrate that, with such joint autoencoder based feature representation and content-usage learning framework, the proposed algorithm outperforms the state-of-the-art baselines significantly.

Web service recommendation based on time‐aware users clustering and multi‐valued QoS prediction

SummaryWith the growing number of functionally similar services over the Internet, recommendation techniques become a natural choice to cope with the challenging task of optimal service selection, and to help consumers satisfy their needs and preferences. However, most existing models on service recommendation are static, while in the real world, the perception and popularity of Web services may continually change. Time is becoming an increasingly important factor in recommender systems since time effects influence users' preferences to a large extent. In order to help users with this problem, we propose a time‐aware Web service recommendation system. First, we use K‐means clustering method in order to exclude the less similar users, which share few common Web services with the active user at different times. Slope One algorithm is also adopted in order to deal with data sparsity problem by predicting the missing ratings over time. Then, a recommendation algorithm is presented in order to recommend the top‐rated Web services. Experiments proved the accuracy of our approach compared to five existing solutions.

Effective User Preference Clustering in Web Service Applications

Abstract The research on personalized recommendation of Web services plays an important role in the field of Web services technology applications. Fortunately, not all users have completely different service preferences. Due to the same application scenarios and personal interests, some users have the same preferences for certain types of Web services. This paper explores the problem of user clustering in the service environment, grouping users according to their service preferences. It helps service providers to identify and characterize the preferences of similar users and provide them with customized services. We propose two combination-based clustering algorithms which make full use of the advantages of the K-means algorithm and the affinity propagation algorithm. In addition, a three-stage clustering process is elaborated to improve the accuracy of user clustering. To reduce the time complexity of the algorithms, we create a parallel execution model of the algorithms implemented by a higher-order MapReduce sequence linking technology. Extensive experiments on simulated datasets and real datasets are performed on the comparisons between the proposed algorithms and the other combination-based clustering algorithms. The experimental results substantiate that the proposed algorithms can effectively distinguish user group with different preferences.