Collaborative Filtering Bandits
Authors:
Open Access
- 7 July 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 539-548
Abstract
Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation and computational advertisement, where the set of items and users is very fluid. In this work, we investigate an adaptive clustering technique for content recommendation based on exploration-exploitation strategies in contextual multi-armed bandit settings. Our algorithm takes into account the collaborative effects that arise due to the interaction of the users with the items, by dynamically grouping users based on the items under consideration and, at the same time, grouping items based on the similarity of the clusterings induced over the users. The resulting algorithm thus takes advantage of preference patterns in the data in a way akin to collaborative filtering methods. We provide an empirical analysis on medium-size real-world datasets, showing scalability and increased prediction performance (as measured by click-through rate) over state-of-the-art methods for clustering bandits. We also provide a regret analysis within a standard linear stochastic noise setting.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Personalized Recommendation via Parameter-Free Contextual Bandits2015
- An Efficient Approach to Generating Location-Sensitive Recommendations in Ad-hoc Social Network EnvironmentsIEEE Transactions on Services Computing, 2015
- Dynamic Clustering of Contextual Multi-Armed Bandits2014
- Ensemble contextual bandits for personalized recommendation2014
- Unifying nearest neighbors collaborative filtering2014
- Medicine Rating Prediction and Recommendation in Mobile Social Networks2013
- Multiclass classification with bandit feedback using adaptive regularizationMachine Learning, 2012
- Exploration–exploitation tradeoff using variance estimates in multi-armed banditsTheoretical Computer Science, 2009
- Tracking the best hyperplane with a simple budget PerceptronMachine Learning, 2007
- Information-theoretic co-clustering2003