{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:40:11Z","timestamp":1750203611335,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"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":[[2019,9,10]]},"DOI":"10.1145\/3298689.3346993","type":"proceedings-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:21:31Z","timestamp":1568208091000},"page":"12-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Online ranking combination"],"prefix":"10.1145","author":[{"given":"Erzs\u00e9bet","family":"Frig\u00f3","sequence":"first","affiliation":[{"name":"Institute for Computer Science and Control (MTA SZTAKI), Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Levente","family":"Kocsis","sequence":"additional","affiliation":[{"name":"Institute for Computer Science and Control (MTA SZTAKI), Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Online collaborative filtering","author":"Abernethy Jacob","year":"2007","unstructured":"Jacob Abernethy , Kevin Canini , John Langford , and Alex Simma . 2007. Online collaborative filtering . University of California at Berkeley , Tech. Rep ( 2007 ). Jacob Abernethy, Kevin Canini, John Langford, and Alex Simma. 2007. Online collaborative filtering. University of California at Berkeley, Tech. Rep (2007)."},{"key":"e_1_3_2_1_2_1","unstructured":"Alekh Agarwal Ofer Dekel and Lin Xiao. 2010. Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.. In COLT. Citeseer 28--40.  Alekh Agarwal Ofer Dekel and Lin Xiao. 2010. Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.. In COLT . Citeseer 28--40."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240363"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of KDD cup and workshop","volume":"2007","author":"Bennett James","year":"2007","unstructured":"James Bennett , Stan Lanning , 2007 . The netflix prize . In Proceedings of KDD cup and workshop , Vol. 2007 . New York, NY, USA., 35. James Bennett, Stan Lanning, et al. 2007. The netflix prize. In Proceedings of KDD cup and workshop, Vol. 2007. New York, NY, USA., 35."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864753"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Learning to Rank Challenge. 37--48","author":"Busa-Fekete R\u00f3bert","year":"2011","unstructured":"R\u00f3bert Busa-Fekete , Bal\u00e1zs K\u00e9gl , Tam\u00e1s \u00c9ltet\u0151 , and Gy\u00f6rgy Szarvas . 2011 . Ranking by calibrated AdaBoost . In Proceedings of the Learning to Rank Challenge. 37--48 . R\u00f3bert Busa-Fekete, Bal\u00e1zs K\u00e9gl, Tam\u00e1s \u00c9ltet\u0151, and Gy\u00f6rgy Szarvas. 2011. Ranking by calibrated AdaBoost. In Proceedings of the Learning to Rank Challenge. 37--48."},{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_1_7_1","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi . 2006. Prediction, learning, and games . Cambridge university press . Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28645-5_29"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557060"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Second International ICSC Symposium on Neural Computation (NC","author":"Igel Christian","year":"2000","unstructured":"Christian Igel and Michael H\u00fcsken . 2000 . Improving the Rprop Learning Algorithm . In Proceedings of the Second International ICSC Symposium on Neural Computation (NC 2000), H. Bothe and R. Rojas (Eds.). ICSC Academic Press, 115--121. citeseer.ist.psu.edu\/igel00improving.html Christian Igel and Michael H\u00fcsken. 2000. Improving the Rprop Learning Algorithm. In Proceedings of the Second International ICSC Symposium on Neural Computation (NC 2000), H. Bothe and R. Rojas (Eds.). ICSC Academic Press, 115--121. citeseer.ist.psu.edu\/igel00improving.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240384"},{"key":"e_1_3_2_1_14_1","unstructured":"Robert D Kleinberg. 2005. Nearly tight bounds for the continuum-armed bandit problem. In Advances in Neural Information Processing Systems. 697--704.   Robert D Kleinberg. 2005. Nearly tight bounds for the continuum-armed bandit problem. In Advances in Neural Information Processing Systems . 697--704."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6888-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572133"},{"key":"e_1_3_2_1_19_1","volume-title":"Online learning in adversarial lipschitz environments. Machine Learning and Knowledge Discovery in Databases","author":"Maillard Odalric-Ambrym","year":"2010","unstructured":"Odalric-Ambrym Maillard and R\u00e9mi Munos . 2010. Online learning in adversarial lipschitz environments. Machine Learning and Knowledge Discovery in Databases ( 2010 ), 305--320. Odalric-Ambrym Maillard and R\u00e9mi Munos. 2010. Online learning in adversarial lipschitz environments. Machine Learning and Knowledge Discovery in Databases (2010), 305--320."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0244-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645723"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.16"},{"key":"e_1_3_2_1_24_1","volume-title":"LSRS Workshop at ACM RecSys.","author":"Pil\u00e1szy I","year":"2015","unstructured":"I Pil\u00e1szy , A Ser\u00e9ny , G D\u00f3zsa , B Hidasi , A S\u00e1ri , and J Gub . 2015 . Neighbor methods vs. matrix factorizationcase studies of real-life recommendations . In LSRS Workshop at ACM RecSys. I Pil\u00e1szy, A Ser\u00e9ny, G D\u00f3zsa, B Hidasi, A S\u00e1ri, and J Gub. 2015. Neighbor methods vs. matrix factorizationcase studies of real-life recommendations. In LSRS Workshop at ACM RecSys."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.119632"},{"key":"e_1_3_2_1_28_1","volume-title":"The bigchaos solution to the netflix grand prize. Netflix prize documentation","author":"T\u00f6scher Andreas","year":"2009","unstructured":"Andreas T\u00f6scher , Michael Jahrer , and Robert M Bell . 2009. The bigchaos solution to the netflix grand prize. Netflix prize documentation ( 2009 ), 1--52. Andreas T\u00f6scher, Michael Jahrer, and Robert M Bell. 2009. The bigchaos solution to the netflix grand prize. Netflix prize documentation (2009), 1--52."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645780"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_1_31_1","unstructured":"Daniel Zoller Stephan Doerfel Christian P\u00f6litz and Andreas Hotho. 2017. Leveraging User-Interactions for Time-Aware Tag Recommendations.. In RecTemp@RecSys. 9--15.  Daniel Zoller Stephan Doerfel Christian P\u00f6litz and Andreas Hotho. 2017. Leveraging User-Interactions for Time-Aware Tag Recommendations.. In RecTemp@RecSys . 9--15."}],"event":{"name":"RecSys '19: Thirteenth ACM Conference on Recommender Systems","acronym":"RecSys '19","location":"Copenhagen Denmark"},"container-title":["Proceedings of the 13th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3346993","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3298689.3346993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:55Z","timestamp":1750201975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3346993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":31,"alternative-id":["10.1145\/3298689.3346993","10.1145\/3298689"],"URL":"https:\/\/doi.org\/10.1145\/3298689.3346993","relation":{},"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2019-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}