arXiv (Cornell University) · 2014 · 97 citations · 33 references
ComputingComputer ScienceData ScienceAlgorithmsMachine LearningRecommender SystemsContent-based RecommendationExploration-exploitation TradeoffOnline RecommendationRecommendation EvaluationReinforcement LearningStochastic OptimizationBandit AlgorithmsBandit Algorithms For RecommendationBenchmark DatasetsClusteringExploration - Exploitation Trade-offExploration-exploitation Trade-offOnline ClusteringScalability
We introduce a novel algorithmic approach to content recommendation based on adaptive clustering of exploration-exploitation ("bandit") strategies. We provide a sharp regret analysis of this algorithm in a standard stochastic noise setting, demonstrate its scalability properties, and prove its effectiveness on a number of artificial and real-world datasets. Our experiments show a significant increase in prediction performance over state-of-the-art methods for bandit problems.
33
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
A contextual-bandit approach to personalized news article recommendation
Lihong Li, Wei Chu, John Langford et al. · 2010 · 2.5K citations · Full text
Asymptotically efficient adaptive allocation rules
Tze-Leung Lai, Herbert Robbins · Advances in Applied Mathematics · 1985 · 2.5K citations
Recommender systems in e-commerce
J. Ben Schafer, Joseph A. Konstan, John Riedl · 1999 · 1.7K citations · Full text