Fair and balanced: Learning to present news stories

WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2012, Pages 333-342

  Ahmed, Amr ^a   Teo, Choon Hui ^a   Vishwanathan, S V N ^b   Smola, Alex ^a  

^a YAHOO RESEARCH   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Graphical models; Online learning; Personalization; Submodularity

Indexed keywords

CLASSICAL CONTEXT; DETAILED MODELS; EFFICIENT ALGORITHM; EXPLICIT FEEDBACK; FACTORIZATION MODEL; GRAPHICAL MODEL; ON-LINE ALGORITHMS; ONLINE LEARNING; PERSONALIZATIONS; RELEVANCE RANKING; RETRIEVAL SYSTEMS; SUBMODULAR FUNCTIONS; SUBMODULARITY; USER'S INTEREST;

ALGORITHMS; DATA MINING; INFORMATION RETRIEVAL; WEBSITES;

BEHAVIORAL RESEARCH;

EID: 84858037294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2124295.2124337     Document Type: Conference Paper

References (22)

1. R. Agrawal, S. Gollapudi, A. Halverson, and S. Ieong. Diversifying search results. In R.A. Baeza-Yates, P. Boldi, B.A. Ribeiro-Neto, and B.B. Cambazoglu, editors, WSDM, pages 5-14. ACM, 2009.
2. A. Ahmed, Q. Ho, C. H. Teo, J. Eisenstein, A. J. Smola and E. P. Xing. Online inference for the Infinite topic-cluster model: storylines from streaming text In AISTATS, 2011.
3. A. Bordes, L. Bottou, and P. Gallinari. SGD-QN: Careful quasi-Newton stochastic gradient descent. JMLR, 10:1737-1754, 2009.
4. O. Cappé and E. Moulines. Online expectation-maximization algorithm for latent data models. Journal of the Royal Statistics Society: Series B (Statistical Methodology), 71, 2009.
5. O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In J. Quemada, G. León, Y.S. Maarek, and W. Nejdl, editors, WWW, pages 1-10. ACM, 2009.
6. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM, pages 87-94, NY, USA, 2008. ACM. (Pubitemid 351588782)
7. G. Dupret and C. Liao. A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine. In B. D. Davison, T. Suel, N. Craswell, and B. Liu, editors, WSDM, pages 181-190. ACM, 2010.
8. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242-259, 2007.
9. K. El-Arini, G. Veda, D. Shahaf, and C. Guestrin. Turning down the noise in the blogosphere. In J. F. Elder IV, F. Fogelman-Soulié, P. A. Flach, and M. J. Zaki, editors, KDD, pages 289-298. ACM, 2009.
10. J. Kivinen and M. K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-64, 1997.
11. Y. Koren, R.M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30-37, 2009.
12. A. Krause and C. Guestrin. A note on the budgeted maximization of submodular functions. CMU-CALD 05-103, CMU, 2005.
13. D. Lagun and E. Agichtein. Viewser: Enabling large-scale remote user studies of web search examination and interaction. In ACM SIGIR, 2011.
14. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J.M. VanBriesen, and N.S. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429. ACM, 2007. (Pubitemid 350229228)
15. H. Lin and J. Bilmes. Multi-document summarization via budgeted maximization of submodular functions. In NAACL, pages 912-920. ACL, 2010.
16. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Math. Programming, 14:265-294, 1978.
17. M. Richardson, A. Prakash, and E. Brill. Beyond pagerank: machine learning for static ranking. In L. Carr, D. De Roure, A. Iyengar, C.A. Goble, and M. Dahlin, editors, WWW, pages 707-715. 2006. (Pubitemid 46946662)
18. G. Salton. Automatic Text Processing. Addison-Wesley, Massachusetts, 1989.
19. A. Schrijver. Combinatorial Optimization, volume 24 of Algorithms and Combinatorics. Springer, 2003.
20. K. Weinberger, A. Dasgupta, J. Attenberg, J. Langford, and A.J. Smola. Feature hashing for large scale multitask learning. In L. Bottou and M. Littman, editors, ICML, 2009.
21. Y. Zhou, L. Nie, O. Rouhani-Kalleh, F. Vasile, and S. Gaffney. Resolving surface forms to wikipedia topics. In COLING, pages 1335-1343, 2010.
22. M. Zinkevich. Online convex programming and generalised infinitesimal gradient ascent. In ICML, pages 928-936, 2003.