Improving Web Service Recommendation using Clustering with K-NN and SVD Algorithms

• Amith M. Weerasinghe,
• Rupasingha A. H. M. Rupasingha,

Vol. 15, No. 5, May 31, 2021
10.3837/tiis.2021.05.007, Download Paper (Free):

• clustering
• Collaborative Filtering
• k-nearest neighbor
• Recommendation
• Singular Value Decomposition
• web services

Abstract

In the advent of the twenty-first century, human beings began to closely interact with technology. Today, technology is developing, and as a result, the world wide web (www) has a very important place on the Internet and the significant task is fulfilled by Web services. A lot of Web services are available on the Internet and, therefore, it is difficult to find matching Web services among the available Web services. The recommendation systems can help in fixing this problem. In this paper, our observation was based on the recommended method such as the collaborative filtering (CF) technique which faces some failure from the data sparsity and the cold-start problems. To overcome these problems, we first applied an ontology-based clustering and then the k-nearest neighbor (KNN) algorithm for each separate cluster group that effectively increased the data density using the past user interests. Then, user ratings were predicted based on the model-based approach, such as singular value decomposition (SVD) and the predictions used for the recommendation. The evaluation results showed that our proposed approach has a less prediction error rate with high accuracy after analyzing the existing recommendation methods.

Statistics

Cite this article