{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T12:51:19Z","timestamp":1770036679792,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"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,11,2]]},"DOI":"10.1145\/1645953.1646057","type":"proceedings-article","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T18:36:45Z","timestamp":1257878205000},"page":"817-826","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A general magnitude-preserving boosting algorithm for search ranking"],"prefix":"10.1145","author":[{"given":"Chenguang","family":"Zhu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhu","family":"Chen","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyuan Allen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_3_1","volume-title":"SIGIR 2008 Workshop on Learning to Rank for Information Retrieval (LR4IR","author":"Carvalho V. R.","year":"2008","unstructured":"Carvalho , V. R. , Elsas , J. L. , Cohen , W. W. , and Carbonell , J. G . ( 2008 ). A Meta-Learning Approach for Robust Rank Learning . SIGIR 2008 Workshop on Learning to Rank for Information Retrieval (LR4IR 2008), 15--23. Carvalho, V. R., Elsas, J. L., Cohen, W. W., and Carbonell, J. G. (2008). A Meta-Learning Approach for Robust Rank Learning. SIGIR 2008 Workshop on Learning to Rank for Information Retrieval (LR4IR 2008), 15--23."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273518"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007607513941"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341542"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of ICML","author":"Freund Y.","year":"1998","unstructured":"Freund , Y. , Iyer , R. , Schapire , R.E. , and Singer Y . (1998). An Efficient Boosting Algorithm for Combining Preferences . Proceedings of ICML 1998 . Freund, Y., Iyer, R., Schapire, R.E., and Singer Y.(1998). An Efficient Boosting Algorithm for Combining Preferences. Proceedings of ICML 1998."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646943.712093"},{"key":"e_1_3_2_1_10_1","article-title":"Additive Logistic Regression: a Statistical View of Boosting","volume":"2000","author":"Friedman J.","year":"2000","unstructured":"Friedman , J. , Hastie , T. and Tibshirani , R. ( 2000 ) Additive Logistic Regression: a Statistical View of Boosting . Annals of Statistics 2000 , Vol. 28. Friedman, J., Hastie, T. and Tibshirani, R.(2000) Additive Logistic Regression: a Statistical View of Boosting. Annals of Statistics 2000, Vol. 28.","journal-title":"Annals of Statistics"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39857-8_15"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of Fourth Conference on Email and Anti-Spam CEAS","author":"He J.","year":"2007","unstructured":"He J. and Bo T . ( 2007 ). Asymmetric gradient boosting with application to spam filtering . Proceedings of Fourth Conference on Email and Anti-Spam CEAS , 2007. He J. and Bo T. (2007). Asymmetric gradient boosting with application to spam filtering. Proceedings of Fourth Conference on Email and Anti-Spam CEAS, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1049\/cp:19991091"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188557"},{"key":"e_1_3_2_1_15_1","unstructured":"Internet Mathematics Contest 2009 training data (Learning to Rank) http:\/\/download.yandex.ru\/imat2009\/imat2009.tar.bz2 Accessed 20 May 2009  Internet Mathematics Contest 2009 training data (Learning to Rank) http:\/\/download.yandex.ru\/imat2009\/imat2009.tar.bz2 Accessed 20 May 2009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of SIGIR","author":"Liu T. Y.","year":"2007","unstructured":"Liu , T. Y. , Qin , T. , Xu , J. , Xiong , W. Y. , and Li , H . ( 2007 ). Letor: Benchmark dataset for research on learning to rank for information retrieval . Proceedings of SIGIR 2007. Liu, T. Y., Qin, T., Xu, J., Xiong, W. Y., and Li, H. (2007). Letor: Benchmark dataset for research on learning to rank for information retrieval. Proceedings of SIGIR 2007."},{"key":"e_1_3_2_1_19_1","volume-title":"Learning to Rank (LETOR) http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/index.html. Accessed","author":"Liu T. Y.","year":"2008","unstructured":"Liu , T. Y. , Zhang , R. C. ( 2008 ) Learning to Rank (LETOR) http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/index.html. Accessed 17 April 2009. Liu, T. Y., Zhang, R. C. (2008) Learning to Rank (LETOR) http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/index.html. Accessed 17 April 2009."},{"key":"e_1_3_2_1_20_1","first-page":"512","article-title":"Boosting algorithms as Gradient Descent","volume":"12","author":"Mason L.","year":"2000","unstructured":"Mason , L. , Baxter , J. , Bartlett , P. and Frean , M. ( 2000 ). Boosting algorithms as Gradient Descent . Proceedings of NIPS 12 , 512 -- 518 . Mason, L., Baxter, J., Bartlett, P. and Frean, M. (2000). Boosting algorithms as Gradient Descent. Proceedings of NIPS 12, 512--518.","journal-title":"Proceedings of NIPS"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277791"},{"issue":"5","key":"e_1_3_2_1_22_1","first-page":"1651","article-title":"Boosting the margin: A new explanation for the effectiveness of voting methods","volume":"26","author":"Schapire R. E.","year":"1998","unstructured":"Schapire , R. E. , Freund Y. , Bartlett , P. L. , and Lee , W. S. ( 1998 ) Boosting the margin: A new explanation for the effectiveness of voting methods , The Annals of Statistics, J. Machine Learning Research , vol. 26 ( 5 ), 1651 -- 1686 . Schapire, R. E., Freund Y., Bartlett, P. L., and Lee, W. S. (1998) Boosting the margin: A new explanation for the effectiveness of voting methods, The Annals of Statistics, J. Machine Learning Research, vol. 26(5), 1651--1686.","journal-title":"The Annals of Statistics, J. Machine Learning Research"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1949767.1949832"}],"event":{"name":"CIKM '09: Conference on Information and Knowledge Management","location":"Hong Kong China","acronym":"CIKM '09","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 18th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1646057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1645953.1646057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:28Z","timestamp":1750250488000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1646057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":24,"alternative-id":["10.1145\/1645953.1646057","10.1145\/1645953"],"URL":"https:\/\/doi.org\/10.1145\/1645953.1646057","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}