{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:30Z","timestamp":1750307730122,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557050","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"229-238","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Regret-based online ranking for a growing digital library"],"prefix":"10.1145","author":[{"given":"Erick","family":"Delage","sequence":"first","affiliation":[{"name":"HEC Montr\u00e9al, Montr\u00e9al, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_2_3_1","first-page":"641","article-title":"Pranking with ranking","volume":"14","author":"Crammer K.","year":"2001","unstructured":"K. Crammer and Y. Singer . \" Pranking with ranking \" .In Adv. in Neural Information Processing Systems , volume 14 , pages 641 -- 647 , 2001 . K. Crammer and Y. Singer. \"Pranking with ranking\".In Adv. in Neural Information Processing Systems, volume 14, pages 641--647, 2001.","journal-title":".In Adv. in Neural Information Processing Systems"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_4"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592055"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_2_10_1","first-page":"897","volume-title":"Adv. in Neural Information Processing Systems","author":"Li P.","year":"2008","unstructured":"P. Li , C. Burges , and Q. Wu . \" McRank: Learning to rank using multiple classification and gradient boosting \". In Adv. in Neural Information Processing Systems , pages 897 -- 904 . 2008 . P. Li, C. Burges, and Q. Wu. \"McRank: Learning to rank using multiple classification and gradient boosting\". In Adv. in Neural Information Processing Systems, pages 897--904. 2008."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_2_12_1","volume-title":"Stanford InfoLab","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . \" The PageRank citation ranking: Bringing order to the web\". Technical report , Stanford InfoLab , 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. \"The PageRank citation ranking: Bringing order to the web\". Technical report, Stanford InfoLab, 1999."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281254"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_2_15_1","first-page":"928","volume-title":"Proc. of 20th Intl. Conf. on Machine Learning","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . \"Online convex programming and generalized infinitesimal gradient ascent \". In Proc. of 20th Intl. Conf. on Machine Learning , pages 928 -- 936 , 2003 . M. Zinkevich. \"Online convex programming and generalized infinitesimal gradient ascent\". In Proc. of 20th Intl. Conf. on Machine Learning, pages 928--936, 2003."}],"event":{"name":"KDD09: The 15th 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","ACM Association for Computing Machinery"],"location":"Paris France","acronym":"KDD09"},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:40Z","timestamp":1750253920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":15,"alternative-id":["10.1145\/1557019.1557050","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557050","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}