scholarly journals Qos Web Service Design Based on Collaborative Filtering

CONVERTER ◽  
2021 ◽  
pp. 107-115
Author(s):  
Yu-ping LI, Ke LI, Zhan-jie Guo
Keyword(s):  
Collaborative Filtering ◽  
Web Service ◽  
Prediction Accuracy ◽  
Recommendation System ◽  
Service Recommendation ◽  
Recommendation Algorithm ◽  
Similar Weight ◽  
Definition Of ◽  
Collaborative Prediction

In the process of web service recommendation, the prediction accuracy of Web Service missing Quality of Service (QoS) value will have an important impact on the rationality of service recommendation. Therefore, combined with spatiotemporal similarity perception, this paper proposes a new web service QoS collaborative filtering recommendation algorithm. This paper designs the framework of web service recommendation system from the perspective of QoS collaborative prediction, and gives the definition of related parameter set. Aiming at the problem that some services in the traditional Top-k algorithm are not similar to the target services, the spatial-temporal similarity perception combined with similar weight is used to predict the missing data to improve the prediction accuracy. In this paper, the calculation process of the algorithm is given through a simple example. The effectiveness of the algorithm is verified by the experimental results.

Location-Based Collaborative Filtering for Web Service Recommendation

2019 ◽  
Vol 12 (1) ◽  
pp. 34-40
Author(s):  
Mareeswari Venkatachalaappaswamy ◽  
Vijayan Ramaraj ◽  
Saranya Ravichandran
Keyword(s):  
Collaborative Filtering ◽  
Web Service ◽  
Information Filtering ◽  
Service Selection ◽  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Service Recommendation ◽  
Location Aware

Background: In many modern applications, information filtering is now used that exposes users to a collection of data. In such systems, the users are provided with recommended items’ list they might prefer or predict the rate that they might prefer for the items. So that, the users might be select the items that are preferred in that list. Objective: In web service recommendation based on Quality of Service (QoS), predicting QoS value will greatly help people to select the appropriate web service and discover new services. Methods: The effective method or technique for this would be Collaborative Filtering (CF). CF will greatly help in service selection and web service recommendation. It is the more general way of information filtering among the large data sets. In the narrower sense, it is the method of making predictions about a user’s interest by collecting taste information from many users. Results: It is easy to build and also much more effective for recommendations by predicting missing QoS values for the users. It also addresses the scalability problem since the recommendations are based on like-minded users using PCC or in clusters using KNN rather than in large data sources. Conclusion: In this paper, location-aware collaborative filtering is used to recommend the services. The proposed system compares the prediction outcomes and execution time with existing algorithms.

A Collaborative Filtering Recommendation Algorithm Combined with User and Item

2014 ◽  
Vol 513-517 ◽  
pp. 1878-1881
Author(s):  
Feng Ming Liu ◽  
Hai Xia Li ◽  
Peng Dong
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
User Evaluation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm

The collaborative filtering recommendation algorithm based on user is becoming the more personalized recommendation algorithm. But when the user evaluation for goods is very small and the user didnt evaluate the item, the commodity recommendation based on the item evaluation of user may not be accurate, and this is the sparseness in the collaborative filtering algorithm based on user. In order to solve this problem, this paper presents a collaborative filtering recommendation algorithm based on user and item. The experimental results show that this method has smaller MAE and greatly improve the quality of the recommendation in the recommendation system.

scholarly journals Collaborative prediction of web service quality based on user preferences and services

PLoS ONE ◽  
2020 ◽  
Vol 15 (12) ◽  
pp. e0242089
Author(s):  
Yang Song
Keyword(s):  
Quality Of Service ◽  
Service Quality ◽  
Collaborative Filtering ◽  
Web Service ◽  
Prediction Method ◽  
User Preferences ◽  
User Preference ◽  
Different Types ◽  
Collaborative Prediction

The prediction of web service quality plays an important role in improving user services; it has been one of the most popular topics in the field of Internet services. In traditional collaborative filtering methods, differences in the personalization and preferences of different users have been ignored. In this paper, we propose a prediction method for web service quality based on different types of quality of service (QoS) attributes. Different extraction rules are applied to extract the user preference matrices from the original web data, and the negative value filtering-based top-K method is used to merge the optimization results into the collaborative prediction method. Thus, the individualized differences are fully exploited, and the problem of inconsistent QoS values is resolved. The experimental results demonstrate the validity of the proposed method. Compared with other methods, the proposed method performs better, and the results are closer to the real values.

Identifying Attack Models for Securing Cluster-Based Recommendation System

2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Relevant Information ◽  
System Function ◽  
Recommendation Algorithm ◽  
Underlying Network ◽  
Entire Dataset ◽  
Attack Models ◽  
Wide Usage

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.

Optimized Collaborative Filtering Recommendation Based on User’s Social Relationships

2014 ◽  
Vol 1044-1045 ◽  
pp. 1484-1488
Author(s):  
Yue Kun Fan ◽  
Xin Ye Li ◽  
Meng Meng Cao
Keyword(s):  
Collaborative Filtering ◽  
Social Relationships ◽  
Digital Libraries ◽  
Social Relationship ◽  
Nearest Neighbor ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
Personalized Recommendation ◽  
Recommendation Algorithm

Currently collaborative filtering is widely used in e-commerce, digital libraries and other areas of personalized recommendation service system. Nearest-neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, but the data sparsity and cold-start problems seriously affect the recommendation quality. To solve these problems, A collaborative filtering recommendation algorithm based on users' social relationships is proposed. 0n the basis of traditional filtering recommendation technology, it combines with the interested objects of user's social relationship and takes the advantage of the tags to projects marked by users and their interested objects to improve the methods of recommendation. The experimental results of MAE ((Mean Absolute Error)) verify that this method can get better quality of recommendation.

scholarly journals Personalized Music Recommendation Simulation Based on Improved Collaborative Filtering Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Hui Ning ◽  
Qian Li
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Contextual Information ◽  
Rapid Development ◽  
Theoretical Research ◽  
Context Information ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Points Of Interest ◽  
Popularity Prediction

Collaborative filtering technology is currently the most successful and widely used technology in the recommendation system. It has achieved rapid development in theoretical research and practice. It selects information and similarity relationships based on the user’s history and collects others that are the same as the user’s hobbies. User’s evaluation information is to generate recommendations. The main research is the inadequate combination of context information and the mining of new points of interest in the context-aware recommendation process. On the basis of traditional recommendation technology, in view of the characteristics of the context information in music recommendation, a personalized and personalized music based on popularity prediction is proposed. Recommended algorithm is MRAPP (Media Recommendation Algorithm based on Popularity Prediction). The algorithm first analyzes the user’s contextual information under music recommendation and classifies and models the contextual information. The traditional content-based recommendation technology CB calculates the recommendation results and then, for the problem that content-based recommendation technology cannot recommend new points of interest for users, introduces the concept of popularity. First, we use the memory and forget function to reduce the score and then consider user attributes and product attributes to calculate similarity; secondly, we use logistic regression to train feature weights; finally, appropriate weights are used to combine user-based and item-based collaborative filtering recommendation results. Based on the above improvements, the improved collaborative filtering recommendation algorithm in this paper has greatly improved the prediction accuracy. Through theoretical proof and simulation experiments, the effectiveness of the MRAPP algorithm is demonstrated.

Robust Analysis on a Privacy Preserving Recommendation Algorithm under the KNN Attack

2014 ◽  
Vol 610 ◽  
pp. 717-721 ◽  
Author(s):  
Yan Gao ◽  
Jing Bo Xia ◽  
Jing Jing Ji ◽  
Ling Ma
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Privacy Preserving ◽  
Perturbation Techniques ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Robust Analysis ◽  
History Of

— Among algorithms in recommendation system, Collaborative Filtering (CF) is a popular one. However, the CF methods can’t guarantee the safety of the user rating data which cause private preserving issue. In general, there are four kinds of methods to solve private preserving: Perturbation, randomization, swapping and encryption. In this paper, we mimic algorithms which attack the privacy-preserving methods with randomized perturbation techniques. After leaking part of rating history of a customer, we can infer this customer’s other rating history. At the end, we propose an algorithm to enhance the system so as to avoid being attacked.

Sign in / Sign up

Export Citation Format

Share Document