{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:20Z","timestamp":1750307060526,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2398546","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"1930-1934","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning from mistakes"],"prefix":"10.1145","author":[{"given":"Karthik","family":"Raman","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krysta M.","family":"Svore","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Gilad-Bachrach","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris J. C.","family":"Burges","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/273530"},{"key":"e_1_3_2_1_2_1","first-page":"1027","volume-title":"SODA","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . k-means++: The advantages of careful seeding . In SODA , pages 1027 -- 1035 , 2007 . D. Arthur and S. Vassilvitskii. k-means++: The advantages of careful seeding. In SODA, pages 1027--1035, 2007."},{"key":"e_1_3_2_1_3_1","first-page":"25","article-title":"Learning to Rank using an Ensemble of Lambda-Gradient Models","volume":"14","author":"Burges C.","year":"2011","unstructured":"C. Burges , K. Svore , P. Bennett , A. Pastusiak , and Q. Wu . Learning to Rank using an Ensemble of Lambda-Gradient Models . JMLR , 14 : 25 -- 35 , 2011 . C. Burges, K. Svore, P. Bennett, A. Pastusiak, and Q. Wu. Learning to Rank using an Ensemble of Lambda-Gradient Models. JMLR, 14:25--35, 2011.","journal-title":"JMLR"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553559"},{"key":"e_1_3_2_1_6_1","first-page":"1401","volume-title":"IJCAI","author":"Freund Y.","year":"1999","unstructured":"Y. Freund and R. Schapire . A Short Introduction to Boosting . In IJCAI , pages 1401 -- 1406 , 1999 . Y. Freund and R. Schapire. A Short Introduction to Boosting. In IJCAI, pages 1401--1406, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_8_1","first-page":"985","volume-title":"ICML","author":"Ladicky L.","year":"2011","unstructured":"L. Ladicky and P. Torr . Locally Linear Support Vector Machines . In ICML , pages 985 -- 992 , 2011 . L. Ladicky and P. Torr. Locally Linear Support Vector Machines. In ICML, pages 985--992, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","volume-title":"Nearest-Neighbor Methods in Learning and Vision: Theory and Practice","author":"Shakhnarovich G.","year":"2006","unstructured":"G. Shakhnarovich , T. Darrell , and P. Indyk . Nearest-Neighbor Methods in Learning and Vision: Theory and Practice . The MIT Press , 2006 . G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. The MIT Press, 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920"},{"key":"e_1_3_2_1_11_1","first-page":"827","volume":"10","author":"Zakai A.","year":"2009","unstructured":"A. Zakai and Y. Ritov . Consistency and Localizability. JMLR , 10 : 827 -- 856 , Apr. 2009 . A. Zakai and Y. Ritov. Consistency and Localizability. JMLR, 10:827--856, Apr. 2009.","journal-title":"Consistency and Localizability. JMLR"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398546","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2398546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:15Z","timestamp":1750238475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398546"}},"subtitle":["towards a correctable learning algorithm"],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":11,"alternative-id":["10.1145\/2396761.2398546","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2398546","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}