{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:25Z","timestamp":1750307605612,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T00:00:00Z","timestamp":1297209600000},"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":[[2011,2,9]]},"DOI":"10.1145\/1935826.1935924","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"735-744","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning to re-rank web search results with multiple pairwise features"],"prefix":"10.1145","author":[{"given":"Changsung","family":"Kang","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Xuanhui","family":"Wang","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Jiang","family":"Chen","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Ciya","family":"Liao","sequence":"additional","affiliation":[{"name":"Microsoft Bing, Mountain View, CA, USA"}]},{"given":"Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Belle","family":"Tseng","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Zhaohui","family":"Zheng","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148175"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623905"},{"key":"e_1_3_2_1_3_1","first-page":"3","volume-title":"Algorithms for Approximation","author":"Burges C.","year":"2006","unstructured":"C. Burges . Ranking as function approximation . Algorithms for Approximation , pages 3 -- 18 , 2006 . C. Burges. Ranking as function approximation. Algorithms for Approximation, pages 3--18, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646035"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273518"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099722"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718510"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645527.756505"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390380"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.08.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(71)90051-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571950"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_21_1","first-page":"1281","volume-title":"NIPS","author":"Qin T.","year":"2008","unstructured":"T. Qin , T.-Y. Liu , X.-D. Zhang , D.-S. Wang , and H. Li . Global ranking using continuous conditional random fields . In NIPS , pages 1281 -- 1288 , 2008 . T. Qin, T.-Y. Liu, X.-D. Zhang, D.-S. Wang, and H. Li. Global ranking using continuous conditional random fields. In NIPS, pages 1281--1288, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367553"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277792"},{"key":"e_1_3_2_1_27_1","first-page":"1697","volume-title":"Advances in Neural Information Processing Systems 20","author":"Zheng Z.","year":"2008","unstructured":"Z. Zheng , H. Zha , T. Zhang , O. Chapelle , K. Chen , and G. Sun . A general boosting method and its application to learning ranking functions for web search . In Advances in Neural Information Processing Systems 20 , pages 1697 -- 1704 . MIT Press , 2008 . Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In Advances in Neural Information Processing Systems 20, pages 1697--1704. MIT Press, 2008."}],"event":{"name":"WSDM'11: Fourth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hong Kong China","acronym":"WSDM'11"},"container-title":["Proceedings of the fourth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:34Z","timestamp":1750250734000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":27,"alternative-id":["10.1145\/1935826.1935924","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935924","relation":{},"subject":[],"published":{"date-parts":[[2011,2,9]]},"assertion":[{"value":"2011-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}