{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:15:53Z","timestamp":1775283353325,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,11,1]]},"DOI":"10.1109\/tkde.2017.2738639","type":"journal-article","created":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T18:28:29Z","timestamp":1502476109000},"page":"2442-2454","source":"Crossref","is-referenced-by-count":12,"title":["Learning Online Trends for Interactive Query Auto-Completion"],"prefix":"10.1109","volume":"29","author":[{"given":"Yingfei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbo","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1054","article-title":"Non-stochastic bandit slate problems","author":"kale","year":"2010","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_30"},{"key":"ref33","first-page":"679","article-title":"Contextual bandits with similarity information","author":"slivkins","year":"2011","journal-title":"Proc Conf Learn Theory"},{"key":"ref32","first-page":"54","article-title":"Nonparametric bandits with covariates","author":"rigollet","year":"2010","journal-title":"Proc Conf Learn Theory"},{"key":"ref31","first-page":"208","article-title":"Contextual bandits with linear payoff functions","author":"chu","year":"2011","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref37","first-page":"1655","article-title":"X-armed bandits","volume":"12","author":"bubeck","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.68"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"ref28","first-page":"39.1","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Proc 25th Annu Conf Learn Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010104"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963424"},{"key":"ref20","article-title":"Iterative expectation for multi period information retrieval","author":"sloan","year":"2013","journal-title":"Proc ACM Int Conf Web Search Data Mining Workshop Web Search Click Data"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526760"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559919"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","article-title":"Bandit processes and dynamic allocation indices","volume":"41","author":"gittins","year":"1979","journal-title":"J of the Roy Stat Soc Series B"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.2307\/1427934","article-title":"Sample mean based index policies with $O(log n)$ regret for the multi-armed bandit problem","volume":"27","author":"agrawal","year":"1995","journal-title":"Advances Appl Probability"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009048"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935862"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281254"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2382438.2382439"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348364"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609571"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484076"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.06.005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321560"},{"key":"ref49","doi-asserted-by":"crossref","DOI":"10.1201\/b16018","author":"gelman","year":"2013","journal-title":"Bayesian Data Analysis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148234"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124339"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526713"},{"key":"ref42","first-page":"399","article-title":"Ranked bandits in metric spaces: Learning diverse rankings over large document collections","volume":"14","author":"slivkins","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref41","first-page":"1577","article-title":"An online algorithm for maximizing submodular functions","author":"streeter","year":"2009","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref44","first-page":"2249","article-title":"An empirical evaluation of thompson sampling","author":"chapelle","year":"2011","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433419"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8059740\/08008836.pdf?arnumber=8008836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T05:45:20Z","timestamp":1719380720000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8008836\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,1]]},"references-count":49,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2738639","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,11,1]]}}}