{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:56Z","timestamp":1750306976959,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,28]],"date-time":"2013-07-28T00:00:00Z","timestamp":1374969600000},"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":[[2013,7,28]]},"DOI":"10.1145\/2484028.2484043","type":"proceedings-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T13:40:50Z","timestamp":1375191650000},"page":"263-272","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Toward self-correcting search engines"],"prefix":"10.1145","author":[{"given":"Ahmed","family":"Hassan","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Ryen W.","family":"White","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Yi-Min","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009965"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148175"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. VLDB, 487--499","author":"Agrawal R.","year":"1994","unstructured":"Agrawal , R. , and Srikant , R . ( 1994 ). Fast algorithms for min-ing association rules . Proc. VLDB, 487--499 . Agrawal, R., and Srikant, R. (1994). Fast algorithms for min-ing association rules. Proc. VLDB, 487--499."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277902"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009938"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148238"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. NIPS, 217--224","author":"Carterette B.","year":"2007","unstructured":"Carterette , B. and Jones , R . ( 2007 ). Evaluating search engines by modeling the relationship between relevance and clicks . Proc. NIPS, 217--224 . Carterette, B. and Jones, R. (2007). Evaluating search engines by modeling the relationship between relevance and clicks. Proc. NIPS, 217--224."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564429"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2188091"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. IJCAI, 2740--2747","author":"Downey D.","year":"2007","unstructured":"Downey , D. , Dumais , S. , and Horvitz , E . ( 2007 ). Model of searching and browsing: Languages, studies and applications . Proc. IJCAI, 2740--2747 . Downey, D., Dumais, S., and Horvitz, E. (2007). Model of searching and browsing: Languages, studies and applications. Proc. IJCAI, 2740--2747."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835458"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059981.1059982"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. RIAO.","author":"Guo Q.","year":"2010","unstructured":"Guo , Q. , White , R.W. , Dumais , S.T. , Wang , J. , and Ander -son, B . ( 2010 ). Predicting query performance using query, re-sult, and user interaction features . Proc. RIAO. Guo, Q., White, R.W., Dumais, S.T., Wang, J., and Ander-son, B. (2010). Predicting query performance using query, re-sult, and user interaction features. Proc. RIAO."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009964"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_1_18_1","unstructured":"Han J. and Kamber M. (2006). Data Mining: Concepts and Techniques Second Edition. Morgan Kaufmann.   Han J. and Kamber M. (2006). Data Mining: Concepts and Techniques Second Edition. Morgan Kaufmann."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718515"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063599"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458142"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30213-1_5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063841"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277839"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. ECIR, 4--15","author":"J\u00e4rvelin S.L.","year":"2008","unstructured":"K. J\u00e4rvelin , S.L. Price , L.M.L. Delcambre , and M.L. Nielsen . ( 2008 ). Discounted cumulated gain based evaluation of multi-ple-query IR sessions . Proc. ECIR, 4--15 . K. J\u00e4rvelin, S.L. Price, L.M.L. Delcambre, and M.L. Nielsen. (2008). Discounted cumulated gain based evaluation of multi-ple-query IR sessions. Proc. ECIR, 4--15."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075150"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242636"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454027"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390364"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242576"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645967"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835548"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277835"}],"event":{"name":"SIGIR '13: The 36th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Dublin Ireland","acronym":"SIGIR '13"},"container-title":["Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484043","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484028.2484043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:32Z","timestamp":1750235972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484043"}},"subtitle":["using underperforming queries to improve search"],"short-title":[],"issued":{"date-parts":[[2013,7,28]]},"references-count":36,"alternative-id":["10.1145\/2484028.2484043","10.1145\/2484028"],"URL":"https:\/\/doi.org\/10.1145\/2484028.2484043","relation":{},"subject":[],"published":{"date-parts":[[2013,7,28]]},"assertion":[{"value":"2013-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}