{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T12:59:33Z","timestamp":1765544373093,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"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.1935922","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"715-724","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["On composition of a federated web search result page"],"prefix":"10.1145","author":[{"given":"Ashok Kumar","family":"Ponnuswami","sequence":"first","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kumaresh","family":"Pattabiraman","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Wu","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Gilad-Bachrach","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tapas","family":"Kanungo","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/1571941.1571997"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835564"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498825"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571998"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572021"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871650"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571951"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. 21st Proc. of Advances in Neural Information Processing Systems","author":"Li P.","year":"2007","unstructured":"P. Li , C. J. C. Burges , and Q. Wu . Mcrank: Learning to rank using multiple classification and gradient boosting . In Proc. 21st Proc. of Advances in Neural Information Processing Systems , 2007 . P. Li, C. J. C. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. In Proc. 21st Proc. of Advances in Neural Information Processing Systems, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480506.1480520"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of AAAI","author":"Radlinski F.","year":"2005","unstructured":"F. Radlinski and T. Joachims . Minimally invasive randomization for collecting unbiased preferences from clickthrough logs . In Proc. of AAAI , 2005 . F. Radlinski and T. Joachims. Minimally invasive randomization for collecting unbiased preferences from clickthrough logs. In Proc. of AAAI, 2005."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188561"},{"key":"e_1_3_2_1_19_1","volume-title":"Foundations and Trends in Information Retrieval.","author":"Shokouhi M.","year":"2010","unstructured":"M. Shokouhi and L. Si . Federated information retrieval . In D. W. Oard and Editors F. Sebastiani, editors, Foundations and Trends in Information Retrieval. 2010 . M. Shokouhi and L. Si. Federated information retrieval. In D. W. Oard and Editors F. Sebastiani, editors, Foundations and Trends in Information Retrieval. 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.04.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076051"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277792"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. 21st Proc. of Advances in Neural Information Processing Systems","author":"Zheng Z.","year":"2007","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 Proc. 21st Proc. of Advances in Neural Information Processing Systems , 2007 . 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 Proc. 21st Proc. of Advances in Neural Information Processing Systems, 2007."}],"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.1935922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935922","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.1935922"}},"subtitle":["using online users to provide pairwise preference for heterogeneous verticals"],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":23,"alternative-id":["10.1145\/1935826.1935922","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935922","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"}}]}}