Download PDFOpen PDF in browser

A Novel Neighborhood Calculation Method by Assessing Users' Varying Preferences in Collaborative Filtering

11 pagesPublished: March 13, 2019

Abstract

To recommend an item to a target user, Collaborative Filtering (CF) considers the preferences of other similar users or neighbors. The accuracy of the recommendation depends on the effectiveness of assessing the neighbors. But over the time, the mutual likings of two individuals change; hence, the neighbors of the target user also should change. However, this shifting of preferences is not considered by traditional methods of calculating neighborhood in CF. As a result, the calculated set of neighbors does not always reflect the optimal neighborhood at any given point of time. In this paper, we argue for considering the continuous change in likings of the previous similar users and calculating the neighbor- hood of a target user based on different time periods. We propose a method that assesses the similarity between users in the different time period by using K-means clustering. This approach significantly improves the accuracy in the personalized recommendation. The performance of the proposed algorithm is tested on the MovieLens datasets (ml-100k and ml-1m) using different performance metrics viz. MAE, RMSE, Precision, Recall, F-score, and accuracy.

Keyphrases: collaborative, filtering, k means clustering, personalized recommendation, recommendation systems, time variance, top n neighbor, user similarity

In: Gordon Lee and Ying Jin (editors). Proceedings of 34th International Conference on Computers and Their Applications, vol 58, pages 345-355.

BibTeX entry
@inproceedings{CATA2019:Novel_Neighborhood_Calculation_Method,
  author    = {Pradeep Kumar Singh and Pijush Kanti Dutta Pramanik and Narayan C. Debnath and Prasenjit Choudhury},
  title     = {A Novel Neighborhood Calculation Method by Assessing Users' Varying Preferences in Collaborative Filtering},
  booktitle = {Proceedings of 34th International Conference on Computers and Their Applications},
  editor    = {Gordon Lee and Ying Jin},
  series    = {EPiC Series in Computing},
  volume    = {58},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/glDL},
  doi       = {10.29007/3xfj},
  pages     = {345-355},
  year      = {2019}}
Download PDFOpen PDF in browser