nips nips2008 nips2008-169 nips2008-169-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Deepak Agarwal, Bee-chung Chen, Pradheep Elango, Nitin Motgi, Seung-taek Park, Raghu Ramakrishnan, Scott Roy, Joe Zachariah
Abstract: We describe a new content publishing system that selects articles to serve to a user, choosing from an editorially programmed pool that is frequently refreshed. It is now deployed on a major Yahoo! portal, and selects articles to serve to hundreds of millions of user visits per day, significantly increasing the number of user clicks over the original manual approach, in which editors periodically selected articles to display. Some of the challenges we face include a dynamic content pool, short article lifetimes, non-stationary click-through rates, and extremely high traffic volumes. The fundamental problem we must solve is to quickly identify which items are popular (perhaps within different user segments), and to exploit them while they remain current. We must also explore the underlying pool constantly to identify promising alternatives, quickly discarding poor performers. Our approach is based on tracking per article performance in near real time through online models. We describe the characteristics and constraints of our application setting, discuss our design choices, and show the importance and effectiveness of coupling online models with a randomization procedure. We discuss the challenges encountered in a production online content-publishing environment and highlight issues that deserve careful attention. Our analysis of this application also suggests a number of future research avenues. 1
[1] D. Agarwal, B-C.Chen, P. Elango, and et al. Online models for content optimization, Yahoo! Technical Report TR-2008-004. 2008.
[2] D. Agarwal, A. Broder, D. Chakrabarti, D. Diklic, V. Josifovski, and M. Sayyadian. Estimating rates of rare events at multiple resolutions. In KDD, pages 16–25, New York, NY, USA, 2007. ACM.
[3] B. D. Anderson and J.B.Moore. Optimal Filtering. Dover, 1974.
[4] F.Wu and B.A.Huberman. Novelty and collective attention. 104:17599–17601, 2007.
[5] J.C.Gittins. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, Series B, 41:148–177, 1979.
[6] P. McCullagh and J. A. Nelder. Generalized Linear Models. Chapman & Hall/CRC, 1989.
[7] M.West and J.Harrison. Bayesian Forecasting and Dynamic Models. Springer-Verlag, 1997.
[8] P.Auer, N.Cesa-Bianchi, and P.Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235–256, 2002.
[9] F. Radlinski and T. Joachims. Active exploration for learning rankings from clickthrough data. In ACM SIGKDD International Conference On Knowledge Discovery and Data Mining (KDD), 2007.
[10] R.DerSimonian and N.M.Laird. Meta-analysis in clinical trials. Controlled Clinical Trials, 7, 1986.
[11] M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In WWW, pages 521–530, 2007.
[12] P. Sandeep, D. Agarwal, D. Chakrabarti, and V. Josifovski. Bandits for taxonomies: A model-based approach. In In Proc. of the SIAM intl. conf. on Data Mining, 2007.
[13] S.Das, D.Data, and A.Garg. Google news personalization:scalable online collaborative filtering. In WWW, Banff, Alberta, Canada, 2007.
[14] T.Lai and H.Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4–22, 1985.