A Review On Collaborative Filtering Using Knn Algorithm

Aniket Sharma, Jerald Nirmal Kumar S, Diksha Rana, Sonia Setia · 2023

Now-a-days online users are gradually increasing, which leads to the increase in the database. Collaborative filtering of the complex data is done using algorithms of time complexity. In this paper we are reviewing KNN algorithm of collaborative filtering. Collaborative filtering technique is being used for the dataset with the vast amount of data. Collaborative technique has given the most precise result in the recommendation of the data being used by the customers with same mentality and different mentalities as well. KNN algorithm helps in finding the nearest neighbor of the customer by finding the shortest distance possible between the similar users. An easy but powerful gadget getting to know technique is the k-Nearest Neighbor (kNN) set of rules. both classification and regression can be performed effectively using it. but type prediction is in which it’s miles maximum frequently utilized. The kNN identifies newly input statistics based totally on its similarity to formerly educated statistics and organizes the statistics into coherent clusters or subsets. The elegance to which the input belongs is determined by means of its closest neighbors. kNN is efficient, but it has quite a few flaws. This painting emphasizes the kNN method and its changed versions located in earlier research. those versions provide a more powerful technique at the same time as casting off the drawbacks of kNN.

Read the paper · More papers on PaperTik