{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:15Z","timestamp":1750307115558,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020445","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"204-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Learning to trade off between exploration and exploitation in multiclass bandit prediction"],"prefix":"10.1145","author":[{"given":"Hamed","family":"Valizadegan","sequence":"first","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijun","family":"Wang","sequence":"additional","affiliation":[{"name":"National Institute of Health, Bethesda, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_2_1","volume-title":"An optimal high probability algorithm for the contextual bandit problem. Computational Research Repository, abs\/1002.4058","author":"Beygelzimer Alina","year":"2010","unstructured":"Alina Beygelzimer , John Langford , Lihong Li , Lev Reyzin , and Robert E. Schapire . An optimal high probability algorithm for the contextual bandit problem. Computational Research Repository, abs\/1002.4058 , 2010 . Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, and Robert E. Schapire. An optimal high probability algorithm for the contextual bandit problem. Computational Research Repository, abs\/1002.4058, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/648301.755490"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248586"},{"key":"e_1_3_2_1_7_1","volume-title":"UCI machine learning repository","author":"Frank A.","year":"2010","unstructured":"A. Frank and A. Asuncion . UCI machine learning repository , 2010 . A. Frank and A. Asuncion. UCI machine learning repository, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390212"},{"key":"e_1_3_2_1_9_1","volume-title":"NIPS 2007: Proceeding of the 20th Annual Conference on Neural Information Processing System","author":"Langford John","year":"2007","unstructured":"John Langford and Zhang Tong . The epoch-greedy algorithm for contextual multi-armed bandits . In NIPS 2007: Proceeding of the 20th Annual Conference on Neural Information Processing System , 2007 . John Langford and Zhang Tong. The epoch-greedy algorithm for contextual multi-armed bandits. In NIPS 2007: Proceeding of the 20th Annual Conference on Neural Information Processing System, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835811"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005355"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/65669.104386"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_42"},{"key":"e_1_3_2_1_18_1","volume-title":"ISTATS 2010: Artificial Intelligence and Statistics","author":"Wang Shijun","year":"2010","unstructured":"Shijun Wang , Rong Jin , and Hamed Valizadegan . A potential-based framework for online multi-class learning with partial feedback . In ISTATS 2010: Artificial Intelligence and Statistics , 2010 . Shijun Wang, Rong Jin, and Hamed Valizadegan. A potential-based framework for online multi-class learning with partial feedback. In ISTATS 2010: Artificial Intelligence and Statistics, 2010."}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Diego California USA","acronym":"KDD '11"},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:15Z","timestamp":1750240095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":18,"alternative-id":["10.1145\/2020408.2020445","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020445","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}