Abstract
Recommender systems employ the popular K-nearest neigh-bor collaborative filtering (K-CF) methodology and its vari-ations for recommending the products. In K-CF approach,recommendation for a given user is computed based on theratings of K-nearest neighbors. In K-CF approach, it can benoted that, the system identifiesKneighbors for each userirrespective of the number of products he/she has rated.As a result, the user who have rated few products may getthe less-similar neighbors and the user who have rated moreproducts may miss the genuine neighbors. In the literature,the notion of lower-bound similarity has been proposed toimprove the clustering performance in which the clusters areextracted by fixing the similarity threshold. In this paper,we have extended the notion of lower-bound similarity torecommender systems to improve the performance of K-CFapproach. In the proposed approach, instead of fixingKfor finding the neighborhood, the similarity threshold valueis fixed to extract the neighbors for each user. As a re-sult, each user gets appropriate number of neighbors basedon the number of products rated by him/her in a dynamicmanner. The experimental results, on MovieLens dataset,show that the proposed lower bound similarity CF approachimproves the performance of recommender systems over K-CF approach.