{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:17:43Z","timestamp":1784179063989,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642201608","type":"print"},{"value":"9783642201615","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20161-5_25","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T03:41:23Z","timestamp":1302579683000},"page":"251-263","source":"Crossref","is-referenced-by-count":28,"title":["Balancing Exploration and Exploitation in Learning to Rank Online"],"prefix":"10.1007","author":[{"given":"Katja","family":"Hofmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shimon","family":"Whiteson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"201","volume":"40","author":"A.G. Barto","year":"1981","unstructured":"Barto, A.G., Sutton, R.S., Brouwer, P.S.: Associative search network: A reinforcement learning associative memory. IEEE Trans. Syst., Man, and Cybern.\u00a040, 201\u2013211 (1981)","journal-title":"IEEE Trans. Syst., Man, and Cybern."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/792550.792552","volume":"36","author":"A. Broder","year":"2002","unstructured":"Broder, A.: A taxonomy of web search. SIGIR Forum\u00a036(2), 3\u201310 (2002)","journal-title":"SIGIR Forum"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Craswell, N., Zoeter, O., Taylor, M., Ramsey, B.: An experimental comparison of click position-bias models. In: WSDM 2008, pp. 87\u201394 (2008)","DOI":"10.1145\/1341531.1341545"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-00958-7_10","volume-title":"Advances in Information Retrieval","author":"P. Donmez","year":"2009","unstructured":"Donmez, P., Carbonell, J.G.: Active sampling for rank learning via optimizing the area under the ROC curve. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol.\u00a05478, pp. 78\u201389. Springer, Heidelberg (2009)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Dupret, G.E., Piwowarski, B.: A user browsing model to predict search engine click data from past observations. In: SIGIR 2008, pp. 331\u2013338 (2008)","DOI":"10.1145\/1390334.1390392"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Guo, F., Li, L., Faloutsos, C.: Tailoring click models to user goals. In: WSCD 2009, pp. 88\u201392 (2009)","DOI":"10.1145\/1507509.1507523"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Guo, F., Liu, C., Wang, Y.M.: Efficient multiple-click models in web search. In: WSDM 2009, pp. 124\u2013131 (2009)","DOI":"10.1145\/1498759.1498818"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"He, J., Zhai, C., Li, X.: Evaluation of methods for relative comparison of retrieval systems based on clickthroughs. In: CIKM 2009, pp. 2029\u20132032 (2009)","DOI":"10.1145\/1645953.1646293"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: KDD 2002, pp. 133\u2013142 (2002)","DOI":"10.1145\/775066.775067"},{"key":"25_CR10","first-page":"154","volume-title":"SIGIR 2005","author":"T. Joachims","year":"2005","unstructured":"Joachims, T., Granka, L., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. In: SIGIR 2005, pp. 154\u2013161. ACM Press, New York (2005)"},{"key":"25_CR11","unstructured":"Langford, J., Zhang, T.: The epoch-greedy algorithm for multi-armed bandits with side information. In: NIPS 2008, pp. 817\u2013824 (2008)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Langford, J., Strehl, A., Wortman, J.: Exploration scavenging. In: ICML 2008, pp. 528\u2013535 (2008)","DOI":"10.1145\/1390156.1390223"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"T.Y. Liu","year":"2009","unstructured":"Liu, T.Y.: Learning to rank for information retrieval. Foundations and Trends in Information Retrieval\u00a03(3), 225\u2013331 (2009)","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"25_CR14","unstructured":"Liu, T.-Y., Xu, J., Qin, T., Xiong, W., Li, H.: Letor: Benchmark dataset for research on learning to rank for information retrieval. In: LR4IR 2007 (2007)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Craswell, N.: Comparing the sensitivity of information retrieval metrics. In: SIGIR 2010, pp. 667\u2013674 (2010)","DOI":"10.1145\/1835449.1835560"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Joachims, T.: Active exploration for learning rankings from clickthrough data. In: KDD 2007, pp. 570\u2013579 (2007)","DOI":"10.1145\/1281192.1281254"},{"key":"25_CR17","first-page":"784","volume-title":"ICML 2008","author":"F. Radlinski","year":"2008","unstructured":"Radlinski, F., Kleinberg, R., Joachims, T.: Learning diverse rankings with multi-armed bandits. In: ICML 2008, pp. 784\u2013791. ACM, New York (2008)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Kurup, M., Joachims, T.: How does clickthrough data reflect retrieval quality? In: CIKM 2008, pp. 43\u201352 (2008)","DOI":"10.1145\/1458082.1458092"},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1561\/1500000009","volume":"4","author":"M. Sanderson","year":"2010","unstructured":"Sanderson, M.: Test collection based evaluation of information retrieval systems. Foundations and Trends in Information Retrieval\u00a04(4), 247\u2013375 (2010)","journal-title":"Foundations and Trends in Information Retrieval"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/331403.331405","volume":"33","author":"C. Silverstein","year":"1999","unstructured":"Silverstein, C., Marais, H., Henzinger, M., Moricz, M.: Analysis of a very large web search engine query log. SIGIR Forum\u00a033(1), 6\u201312 (1999)","journal-title":"SIGIR Forum"},{"key":"25_CR21","volume-title":"Introduction to Reinforcement Learning","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning. MIT Press, Cambridge (1998)"},{"key":"25_CR22","unstructured":"Watkins, C.: Learning from Delayed Rewards. PhD thesis, Cambridge University (1989)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-71496-5_24","volume-title":"Advances in Information Retrieval","author":"Z. Xu","year":"2007","unstructured":"Xu, Z., Akella, R., Zhang, Y.: Incorporating diversity and density in active learning for relevance feedback. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol.\u00a04425, pp. 246\u2013257. Springer, Heidelberg (2007)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Xu, Z., Kersting, K., Joachims, T.: Fast active exploration for link-based preference learning using gaussian processes. In: ECML PKDD 2010, pp. 499\u2013514 (2010)","DOI":"10.1007\/978-3-642-15939-8_32"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: ICML 2009, pp. 1201\u20131208 (2009)","DOI":"10.1145\/1553374.1553527"},{"key":"25_CR26","unstructured":"Yue, Y., Broder, J., Kleinberg, R., Joachims, T.: The k-armed dueling bandits problem. In: COLT 2009 (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20161-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:46:43Z","timestamp":1558558003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20161-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201608","9783642201615"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20161-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}