{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:05Z","timestamp":1761621125500,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"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,2,4]]},"DOI":"10.1145\/2433396.2433414","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"133-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Playing by the rules"],"prefix":"10.1145","author":[{"given":"Youngho","family":"Kim","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Hassan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryen W.","family":"White","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Min","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009965"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_2_3_1","volume-title":"Fast algorithms for mining association rules in large databases. VLDB, 487--499","author":"Agrawal R.","year":"1994","unstructured":"Agrawal , R. and Srikant , R . ( 1994 ). Fast algorithms for mining association rules in large databases. VLDB, 487--499 . Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules in large databases. VLDB, 487--499."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277902"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273501"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753333"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772703"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148238"},{"key":"e_1_3_2_2_9_1","volume-title":"Evaluating search engines by modeling the relationship between relevance and clicks. 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. NIPS, 217--224 . Carterette, B. and Jones, R. (2007). Evaluating search engines by modeling the relationship between relevance and clicks. NIPS, 217--224."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564429"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005257.93780.3b"},{"key":"e_1_3_2_2_12_1","volume-title":"Models of searching and browsing: languages, studies, and applications. IJCAI, 2740--2747","author":"Downey D.","year":"2007","unstructured":"Downey , D. , Dumais , S.T. , and Horvitz , E . ( 2007 ). Models of searching and browsing: languages, studies, and applications. IJCAI, 2740--2747 . Downey, D., Dumais, S.T., and Horvitz, E. (2007). Models of searching and browsing: languages, studies, and applications. IJCAI, 2740--2747."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835458"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7287.001.0001","volume-title":"WordNet: An Electronic Lexical Data-base","author":"Fellbaum C.","year":"1998","unstructured":"Fellbaum , C. ( 1998 ). WordNet: An Electronic Lexical Data-base . Bradford Books . Fellbaum, C. (1998). WordNet: An Electronic Lexical Data-base. Bradford Books."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219885"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059981.1059982"},{"key":"e_1_3_2_2_17_1","volume-title":"Predicting query performance using query, re-sult, and user interaction features. RIAO, 198--201","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. RIAO, 198--201 . 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. RIAO, 198--201."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009964"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348323"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718515"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063599"},{"key":"e_1_3_2_2_24_1","volume-title":"Inferring query performance using pre-retrieval predictors. SPIRE, 43--54","author":"He B.","year":"2004","unstructured":"He , B. and Ounis , I . ( 2004 ). Inferring query performance using pre-retrieval predictors. SPIRE, 43--54 . He, B. and Ounis, I. (2004). Inferring query performance using pre-retrieval predictors. SPIRE, 43--54."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.11.003"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277839"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458176"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242636"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"e_1_3_2_2_31_1","volume-title":"An overview of Microsoft web n-gram corpus and applica-tions. NAACL HLT Demo Session, 45--48","author":"Wang K.","year":"2010","unstructured":"Wang , K. , Thrasher , C. , Viegas , E. , Li , X. and Hsu , P . ( 2010 ). An overview of Microsoft web n-gram corpus and applica-tions. NAACL HLT Demo Session, 45--48 . Wang, K., Thrasher, C., Viegas, E., Li, X. and Hsu, P. (2010). An overview of Microsoft web n-gram corpus and applica-tions. NAACL HLT Demo Session, 45--48."},{"key":"e_1_3_2_2_32_1","volume-title":"Spectral hash-ing. NIPS, 1753--1760","author":"Weiss Y.","year":"2008","unstructured":"Weiss , Y. , Torralba , A. , and Fergus , R . ( 2008 ). Spectral hash-ing. NIPS, 1753--1760 . Weiss, Y., Torralba, A., and Fergus, R. (2008). Spectral hash-ing. NIPS, 1753--1760."},{"key":"e_1_3_2_2_33_1","volume-title":"Effective pre-retrieval query performance prediction using similarity and variability evidence. ECIR, 52--64","author":"Zhao Y.","year":"2008","unstructured":"Zhao , Y. , Scholer , F. , and Tsegay , Y . ( 2008 ). Effective pre-retrieval query performance prediction using similarity and variability evidence. ECIR, 52--64 . Zhao, Y., Scholer, F., and Tsegay, Y. (2008). Effective pre-retrieval query performance prediction using similarity and variability evidence. ECIR, 52--64."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183696"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277835"}],"event":{"name":"WSDM 2013: Sixth 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":"Rome Italy","acronym":"WSDM 2013"},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:11Z","timestamp":1750277651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433414"}},"subtitle":["mining query associations to predict search performance"],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":34,"alternative-id":["10.1145\/2433396.2433414","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433414","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}