论文信息 - Locality sensitive hashing based scalable collaborative filtering

Locality sensitive hashing based scalable collaborative filtering

Neighborhood-based collaborative filtering methods are widely used in recommender systems because of their easy-to-implement and effective nature. One important drawback of these methods is that they do not scale well with increasing amounts of data. In this work we applied the locality sensitive hashing technique for solving the scalability problem of neighborhood-based collaborative filtering. We evaluate the effects of the parameters of locality sensitive hashing technique on the scalability and the accuracy of the developed recommender system.

Tevfik Aytekin | Ahmet Maruf Aytekin | A. Aytekin | Tevfik Aytekin

[1] John Riedl,et al. An algorithmic framework for performing collaborative filtering , 1999, SIGIR '99.

[2] Inderjit S. Dhillon,et al. Scalable Coordinate Descent Approaches to Parallel Matrix Factorization for Recommender Systems , 2012, 2012 IEEE 12th International Conference on Data Mining.

[3] George Karypis,et al. A Comprehensive Survey of Neighborhood-based Recommendation Methods , 2011, Recommender Systems Handbook.

[4] Din J. Wasem,et al. Mining of Massive Datasets , 2014 .

[5] Bracha Shapira,et al. Recommender Systems Handbook , 2015, Springer US.

[6] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.

[7] Jonathan L. Herlocker,et al. Evaluating collaborative filtering recommender systems , 2004, TOIS.

[8] George Karypis,et al. Item-based top-N recommendation algorithms , 2004, TOIS.

[9] Abhinandan Das,et al. Google news personalization: scalable online collaborative filtering , 2007, WWW '07.

[10] John Riedl,et al. An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms , 2002, Information Retrieval.