{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:13:57Z","timestamp":1760955237121,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,19]],"date-time":"2010-07-19T00:00:00Z","timestamp":1279497600000},"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":[[2010,7,19]]},"DOI":"10.1145\/1835449.1835545","type":"proceedings-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T15:39:10Z","timestamp":1279640350000},"page":"571-578","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Exploring reductions for long web queries"],"prefix":"10.1145","author":[{"given":"Niranjan","family":"Balasubramanian","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]},{"given":"Giridhar","family":"Kumaran","sequence":"additional","affiliation":[{"name":"One Microsoft Way, Redmond, MA, USA"}]},{"given":"Vitor R.","family":"Carvalho","sequence":"additional","affiliation":[{"name":"One Microsoft Way, Redmond, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Searches getting longer: A weblog by alan long hitwise intelligence. http:\/\/weblogs.hitwise.com\/alan-long\/2009\/11\/searches_getting_longer.html.  Searches getting longer: A weblog by alan long hitwise intelligence. http:\/\/weblogs.hitwise.com\/alan-long\/2009\/11\/searches_getting_longer.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835615"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390419"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507511"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718492"},{"key":"e_1_3_2_1_6_1","first-page":"193","article-title":"Learning to rank with nonsmooth cost functions","volume":"19","author":"Burges C.","year":"2007","unstructured":"C. Burges , R. Ragno , and Q. Le . Learning to rank with nonsmooth cost functions . NIPS , 19 : 193 , 2007 . C. Burges, R. Ragno, and Q. Le. Learning to rank with nonsmooth cost functions. NIPS, 19:193, 2007.","journal-title":"NIPS"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2009.42"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458142"},{"key":"e_1_3_2_1_9_1","first-page":"43","volume-title":"SPIRE","author":"He B.","year":"2004","unstructured":"B. He and I. Ounis . Inferring query performance using pre-retrieval predictors . In SPIRE , pages 43 -- 54 , 2004 . B. He and I. Ounis. Inferring query performance using pre-retrieval predictors. In SPIRE, pages 43--54, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_12_1","first-page":"220","volume-title":"HLT\/NAACL","author":"Kumaran G.","year":"2007","unstructured":"G. Kumaran and J. Allan . A case for shorter queries, and helping users create them . In HLT\/NAACL , pages 220 -- 227 , 2007 . G. Kumaran and J. Allan. A case for shorter queries, and helping users create them. In HLT\/NAACL, pages 220--227, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572038"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572023"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00958-7_11"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04769-5_15"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646114"},{"issue":"3","key":"e_1_3_2_1_18_1","first-page":"18","article-title":"Classification and regression by randomforest","volume":"2","author":"Liaw A.","year":"2002","unstructured":"A. Liaw and M. Wiener . Classification and regression by randomforest . R News , 2 ( 3 ): 18 -- 22 , 2002 . A. Liaw and M. Wiener. Classification and regression by randomforest. R News, 2(3):18--22, 2002.","journal-title":"R News"}],"event":{"name":"SIGIR '10: The 33rd International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Geneva Switzerland","acronym":"SIGIR '10"},"container-title":["Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835449.1835545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835449.1835545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:31Z","timestamp":1750246771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835449.1835545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,19]]},"references-count":18,"alternative-id":["10.1145\/1835449.1835545","10.1145\/1835449"],"URL":"https:\/\/doi.org\/10.1145\/1835449.1835545","relation":{},"subject":[],"published":{"date-parts":[[2010,7,19]]},"assertion":[{"value":"2010-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}