Contextual recommender problems

Proceedings of the 1st International Workshop on Utility-Based Data Mining, UBDM '05

Volumn , Issue , 2005, Pages 86-89

  Madani, Omid ^a   DeCoste, Dennis ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

data mining; exploration exploitation; multi armed bandit; personalization; recommenders; regression; reinforcement learning; utility

Indexed keywords

CLICK RATES; CONTEXT INFORMATION; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; PERSONALIZATION; PERSONALIZATIONS; WEB PAGE;

DATA MINING; REINFORCEMENT LEARNING;

REINFORCEMENT;

EID: 33751025354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1089827.1089838     Document Type: Conference Paper

References (9)

1. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 2002.
2. D. A. Berry and B. Fristedt. Bandit Problems. Chapman and Hall, 1985.
3. J. Gittins. Multi-Armed Bandit Allocation Indices. John Wiley and Sons, 1989.
4. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. ACM, 2002.
5. J. Kleingberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998.
6. O. Madani, D. J. Lizotte, and R. Greiner. The budgeted multi-armed bandit problem. In COLT, 2004.
7. M. Perkowitz and O. Etzioni. Towards adaptable web sites: Conceptual framework and case study. Artificial Intelligence, 2001.
8. P. Resnick and H. R. Varian. Recommender systems. Communications of the ACM, 40(3), 1997.
9. R. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT press, 1998.