Finite-time Analysis of the Multiarmed Bandit Problem
Machine Learning
The Journal of Machine Learning Research
Using confidence bounds for exploitation-exploration trade-offs
The Journal of Machine Learning Research
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Multi-armed bandit problems with dependent arms
Proceedings of the 24th international conference on Machine learning
Active learning for logistic regression: an evaluation
Machine Learning
The evidence framework applied to classification networks
Neural Computation
Learning diverse rankings with multi-armed bandits
Proceedings of the 25th international conference on Machine learning
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Proceedings of the 25th international conference on Machine learning
Rated aspect summarization of short comments
Proceedings of the 18th international conference on World wide web
Regression-based latent factor models
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Automatically assessing review helpfulness
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Predicting response to political blog posts with topic models
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Explore/Exploit Schemes for Web Content Optimization
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
fLDA: matrix factorization through latent dirichlet allocation
Proceedings of the third ACM international conference on Web search and data mining
A contextual-bandit approach to personalized news article recommendation
Proceedings of the 19th international conference on World wide web
How useful are your comments?: analyzing and predicting youtube comments and comment ratings
Proceedings of the 19th international conference on World wide web
Information credibility on twitter
Proceedings of the 20th international conference on World wide web
Personalized recommendation of user comments via factor models
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
The highly dynamic nature of online commenting environments makes accurate ratings prediction for new comments challenging. In such a setting, in addition to exploiting comments with high predicted ratings, it is also critical to explore comments with high uncertainty in the predictions. In this paper, we propose a novel upper confidence bound (UCB) algorithm called LOGUCB that balances exploration with exploitation when the average rating of a comment is modeled using logistic regression on its features. At the core of our LOGUCB algorithm lies a novel variance approximation technique for the Bayesian logistic regression model that is used to compute the UCB value for each comment. In experiments with a real-life comments dataset from Yahoo! News, we show that LOGUCB with bag-of-words and topic features outperforms state-of-the-art explore-exploit algorithms.