Evaluating the Scalability of Matrix Factorization and Neighborhood Based Recommender Systems

Recommendation Systems are everywhere, from offline shopping malls to major e-commerce websites, all use recommendation systems to enhance customer experience and grow profit. With a growing customer base, the requirement to store their interest, behavior and respond accordingly requires plenty of scalability. Thus, it is very important for companies to select a scalable recommender system, which can provide the recommendations not just accurately but with low latency as well. This paper focuses on the comparison between the four methods KMeans, KNN, SVD, and SVD++ to find out the better algorithm in terms of scalability. We have analyzed the methods on different parameters i.e., Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Precision, Recall and Running Time (Scalability). Results are elaborated such that selection becomes quite easy depending upon the user requirements.