{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:16:30Z","timestamp":1743102990355,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961323"},{"type":"electronic","value":"9783319961330"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96133-0_25","type":"book-chapter","created":{"date-parts":[[2018,7,7]],"date-time":"2018-07-07T11:54:57Z","timestamp":1530964497000},"page":"331-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning to Rank and Discover for E-Commerce Search"],"prefix":"10.1007","author":[{"given":"Anjan","family":"Goswami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengxiang","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasant","family":"Mohapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,8]]},"reference":[{"issue":"1\u20132","key":"25_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10998-010-3055-6","volume":"61","author":"P Auer","year":"2010","unstructured":"Auer, P., Ortner, R.: UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem. Period. Math. Hung. 61(1\u20132), 55\u201365 (2010)","journal-title":"Period. Math. Hung."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends Mach. Learn."},{"issue":"23\u2013581","key":"25_CR3","first-page":"81","volume":"11","author":"CJ Burges","year":"2010","unstructured":"Burges, C.J.: From ranknet to lambdarank to lambdamart: an overview. Learning 11(23\u2013581), 81 (2010)","journal-title":"Learning"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1007\/978-0-387-39940-9","volume-title":"Encyclopedia of Database Systems","author":"N Craswell","year":"2009","unstructured":"Craswell, N.: Mean reciprocal rank. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 1703\u20131703. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-39940-9"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Craswell, N., Zoeter, O., Taylor, M., Ramsey, B.: An experimental comparison of click position-bias models. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 87\u201394. WSDM 2008. ACM (2008)","DOI":"10.1145\/1341531.1341545"},{"key":"25_CR6","unstructured":"Gabillon, V., Kveton, B., Wen, Z., Eriksson, B., Muthukrishnan, S.: Adaptive submodular maximization in bandit setting. In: Advances in Neural Information Processing Systems, pp. 2697\u20132705 (2013)"},{"key":"25_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices. Wiley, Hoboken (2011)"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. (TOIS) 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Li, L., Chen, S., Kleban, J., Gupta, A.: Counterfactual estimation and optimization of click metrics in search engines: a case study. In: Proceedings of the 24th International Conference on World Wide Web, pp. 929\u2013934. ACM (2015)","DOI":"10.1145\/2740908.2742562"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 661\u2013670. ACM (2010)","DOI":"10.1145\/1772690.1772758"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y.: Learning to rank for information retrieval. Found. Trends Inf. Retr. 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends Inf. Retr."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming The State of the Art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Gr\u00f6tschel, M. (eds.) Mathematical Programming The State of the Art, pp. 235\u2013257. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-642-68874-4_10"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functionsi. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Park, S.T., Chu, W.: Pairwise preference regression for cold-start recommendation. In: Proceedings of the Third ACM Conference on Recommender Systems, pp. 21\u201328. ACM (2009)","DOI":"10.1145\/1639714.1639720"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Schein, A.I., Popescul, A., Ungar, L.H., Pennock, D.M.: Methods and metrics for cold-start recommendations. In: Proceedings of the 25th annual international ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 253\u2013260. ACM (2002)","DOI":"10.1145\/564376.564421"},{"key":"25_CR16","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, vol. 1. MIT press, Cambridge (1998)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Svore, K.M., Volkovs, M.N., Burges, C.J.: Learning to rank with multiple objective functions. In: Proceedings of the 20th iNternational Conference on World Wide Web, pp. 367\u2013376. ACM (2011)","DOI":"10.1145\/1963405.1963459"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/11564096_42","volume-title":"Machine Learning: ECML 2005","author":"J Vermorel","year":"2005","unstructured":"Vermorel, J., Mohri, M.: Multi-armed Bandit algorithms and empirical evaluation. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 437\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564096_42"},{"key":"25_CR19","volume-title":"Introduction to Robust Estimation and Hypothesis Testing","author":"RR Wilcox","year":"2011","unstructured":"Wilcox, R.R.: Introduction to Robust Estimation and Hypothesis Testing. Academic Press, Cambridge (2011)"},{"key":"25_CR20","unstructured":"Yue, Y., Guestrin, C.: Linear submodular bandits and their application to diversified retrieval. In: Advances in Neural Information Processing Systems, pp. 2483\u20132491 (2011)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96133-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:33Z","timestamp":1709810973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96133-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961323","9783319961330"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96133-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning and Data Mining in Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mldm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mldm.de\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}