Neal Lathia
ABSTRACT
Recommender systems, based on collaborative filtering, draw their strength from techniques that manipulate a set of user-rating profiles in order to compute predicted ratings of unrated items. There are a wide range of techniques that can be applied to this problem; however, the k-nearest neighbour (kNN) algorithm has become the dominant method used in this context. Much research to date has focused on improving the performance of this algorithm, without considering the properties that emerge from manipulating the user data in this way. In order to understand the effect of kNN on a user-rating dataset, the algorithm can be viewed as a process that generates a graph, where nodes are users and edges connect similar users: the algorithm generates an implicit social network amongst the system subscribers. Temporal updates of the recommender system will impose changes on the graph. In this work we analyse user-user kNN graphs from a temporal perspective, retrieving characteristics such as dataset growth, the evolution of similarity between pairs of users, the volatility of user neighbourhoods over time, and emergent properties of the entire graph as the algorithm parameters change. These insights explain why certain kNN parameters and similarity measures outperform others, and show that there is a surprising degree of structural similarity between these graphs and explicit user social networks.
- J. B. Schafer, J. Konstan, and J. Riedl. Recommender systems in e-commerce. In Proceedings of the ACM Conference on Electronic Commerce 1999. Google Scholar
Digital Library
- M. J. Pazzani and D. Billsus. Content-based recommendation systems. The Adaptive Web, pages 325--341, 2007. Google ScholarDigital Library
- N. Lathia, S. Hailes, and L. Capra. The Effect of Correlation Coefficients on Communities of Recommenders. In Proceedings of the 23rd ACM SAC TRECK Track, Fortaleza, Brazil, March 2008. Google ScholarDigital Library
- J. Herlocker, J. Konstan, L. Terveen, and J. Riedl. Evaluating collaborative filtering recommender systems. In ACM Transactions on Information Systems, volume 22, pages 5--53. ACM Press, 2004. Google ScholarDigital Library
- A. Barabasi and R. Albert. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, 2002.Google ScholarCross Ref
- M. Maia, J. Almeida, and V. Almeida. Identifying user profiles in online social networks. In Proceedings of the 1st International Workshop on Social Network Systems (EuroSys 2008)}. ACM Press, 2008. Google ScholarDigital Library
- J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An Algorithmic Framework for Performing Collaborative Filtering. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 230--237, 1999. Google ScholarDigital Library
- R. Bell and Y. Koren. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In IEEE International Conference on Data Mining (ICDM'07). IEEE, 2007. Google ScholarDigital Library
- R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In International Conference on Knowledge Discovery and Data Mining. ACM, 2006. Google ScholarDigital Library
- J. Wang, A. P. de Vries, and M. J. T. Reinders. Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In Proceedings of the 29th ACM SIGIR Conference, pages 501--508. ACM Press, 2006. Google ScholarDigital Library
- A. M. Rashid, G. Karypis, and J. Riedl. Influence in ratings-based recommender systems: An algorithm-independent approach. In Proceedings of SIAM 2005 Data Mining Conference, 2005.Google ScholarCross Ref
- G. Adomavicius, R. Sankaranarayanan, and S. Sen. Incorporating contextual information in recommender systems using a multidimensional approach. In ACM Transactions on Information Systems (TOIS), 2008. Google ScholarDigital Library
Index Terms
- kNN CF: a temporal social network
Recommendations
AR-CF: Augmenting Virtual Users and Items in Collaborative Filtering for Addressing Cold-Start Problems
SIGIR '20: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information RetrievalCold-start problems are arguably the biggest challenges faced by collaborative filtering (CF) used in recommender systems. When few ratings are available, CF models typically fail to provide satisfactory recommendations for cold-start users or to ...
Nuke 'Em Till They Go: Investigating Power User Attacks to Disparage Items in Collaborative Recommenders
RecSys '15: Proceedings of the 9th ACM Conference on Recommender SystemsRecommender Systems (RSs) can be vulnerable to manipulation by malicious users who successfully bias recommendations for their own benefit or pleasure. These are known as attacks on RSs and are typically used to either promote ("push") or disparage ("...
Boosting collaborative filtering based on statistical prediction errors
RecSys '08: Proceedings of the 2008 ACM conference on Recommender systemsUser-based collaborative filtering methods typically predict a user's item ratings as a weighted average of the ratings given by similar users, where the weight is proportional to the user similarity. Therefore, the accuracy of user similarity is the ...
Comments