{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:40:01Z","timestamp":1737351601009,"version":"3.33.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T00:00:00Z","timestamp":1186531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10115-007-0100-8","type":"journal-article","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T14:42:20Z","timestamp":1186497740000},"page":"155-171","source":"Crossref","is-referenced-by-count":4,"title":["Measuring ranked list robustness for query performance prediction"],"prefix":"10.1007","volume":"16","author":[{"given":"Yun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Bruce","family":"Croft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,8]]},"reference":[{"key":"100_CR1","doi-asserted-by":"crossref","unstructured":"Amati G, Carpineto C, Romano G (2004) Query difficulty, robustness and selective application of query expansion. In: The proceedings of 26th European Conference on Information Retrieval (ECIR), pp 127\u2013137","DOI":"10.1007\/978-3-540-24752-4_10"},{"key":"100_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein Y, Billerbeck B, Garcia S et\u00a0al (2005) RMIT University at TREC 2005: Terabyte and Robust Track. In: The online proceedings of 2005 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-266.terabyte-rmit.scholer"},{"issue":"5","key":"100_CR3","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1002\/asi.4630250505","volume":"25","author":"A Bookstein","year":"1974","unstructured":"Bookstein A and Swanson D (1974). Probabilistic models for automatic indexing. J Am Soc Inf Sci 25(5): 312\u2013319","journal-title":"J Am Soc Inf Sci"},{"key":"100_CR4","doi-asserted-by":"crossref","unstructured":"Cronen-Townsend S, Zhou Y, oft WB (2002) Predicting query performance. In: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pp 299\u2013306","DOI":"10.1145\/564376.564429"},{"key":"100_CR5","doi-asserted-by":"crossref","unstructured":"Carmel D, Yom-Tov E, Darlow A et\u00a0al (2006) What makes a query difficult? In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, pp 390\u2013397","DOI":"10.1145\/1148170.1148238"},{"key":"100_CR6","doi-asserted-by":"crossref","unstructured":"Diaz F, Jones R (2004) Using temporal profiles of queries for precision prediction. In: Proceedings of the 27th annual international ACM SIGIR conference on research and development in information retrieval, pp 18\u201324","DOI":"10.1145\/1008992.1008998"},{"key":"100_CR7","doi-asserted-by":"crossref","unstructured":"Jensen EC, Beitzel SM, Chowdhury A et\u00a0al. (2005) Predicting Query Difficulty on the Web by Learning Visual Clues. In: Proceedings of the 2005 ACM conference on research and development in information retrieval, pp 615\u2013616","DOI":"10.1145\/1076034.1076155"},{"key":"100_CR8","doi-asserted-by":"crossref","unstructured":"Harter SP (1975) A probabilistic approach to automatic keyword indexing. J Am Soc Inf Sci 26(4\/5) Part I: 197\u2013206; Part II:280\u2013289","DOI":"10.1002\/asi.4630260504"},{"key":"100_CR9","doi-asserted-by":"crossref","unstructured":"Hastie T, Tibshirani R, Friedman JH (2001) The elements of statistical learning, Chap. 6. Kernel method-Springer press, Heidelberg","DOI":"10.1007\/978-0-387-21606-5"},{"key":"100_CR10","doi-asserted-by":"crossref","unstructured":"He B, Ounis I (2004) Inferring query performance using pre-retrieval predictors. In: proceedings of the SPIRE 2004, pp 43\u201354","DOI":"10.1007\/978-3-540-30213-1_5"},{"key":"100_CR11","unstructured":"Lopresti D, Zhou J (2006) Retrieval strategy for noisy text. In: Symposium on document analysis and information retrieval, pp 1\u201316"},{"key":"100_CR12","volume-title":"Nonparametric statistical inference","author":"JD Gibbons","year":"1992","unstructured":"Gibbons JD and Chakraborty S (1992). Nonparametric statistical inference. Marcel Dekker, New York"},{"key":"100_CR13","volume-title":"Monte carlo methods","author":"MH Kalos","year":"1996","unstructured":"Kalos MH and Whitlock PA (1996). Monte carlo methods. Wiley, New York"},{"key":"100_CR14","volume-title":"Advanced engineering mathematics, Chap. 23.10","author":"E Kreyszig","year":"1997","unstructured":"Kreyszig E (1997). Advanced engineering mathematics, Chap. 23.10. Wiley, New York"},{"key":"100_CR15","doi-asserted-by":"crossref","unstructured":"Kwok KL, Grunfeld L, Sun HL et\u00a0al (2004) TREC 2004 Robust Track Experiments Using PIRCS. In: The Online Proceedings of 2004 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-261.robust-queens.college.kwok"},{"key":"100_CR16","doi-asserted-by":"crossref","unstructured":"Kwok KL, Grunfeld L, Dinstl et\u00a0al (2005) TREC 2005 Robust Track Experiments Using PIRCS. In: The Online proceedings of 2005 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-266.robust-queenscollege.kwok"},{"key":"100_CR17","unstructured":"Mittendorf E (1998) Data corruption and information retrieval. PhD Thesis, Department of Computer Science, the Katholieke Universiteit Leuven"},{"key":"100_CR18","doi-asserted-by":"crossref","unstructured":"Metzler D, Strohman T, Zhou Y et\u00a0al (2005) Indri at TREC 2005: terabyte Track. In: The Online proceedings of 2005 TREC","DOI":"10.6028\/NIST.SP.500-266.terabyte-umass.allan"},{"key":"100_CR19","doi-asserted-by":"crossref","unstructured":"Ogilvie P, Callan J (2003) Combining document representations for known-item search. In: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval, pp 143\u2013150","DOI":"10.1145\/860435.860463"},{"key":"100_CR20","doi-asserted-by":"crossref","unstructured":"Plachouras V, He B, Ounis I (2004) University of Glasgow at TREC2004: experiments in Web, robust, and terabyte tracks with terrier. In: The online proceedings of 2004 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-261.terabyte-u.glasgow"},{"key":"100_CR21","unstructured":"Predicting Query Difficulty. SIGIR workshop 2005 http:\/\/www.haifa.ibm.com\/sigir05-qp\/index.html"},{"key":"100_CR22","unstructured":"Robust Track http:\/\/trec.nist.gov\/tracks.html"},{"key":"100_CR23","unstructured":"Singhal A, Salton G, Buckley C (1996) Length normalization in degraded text collections. In: Symposium on document analysis and information retrieval, pp 149\u2013162"},{"key":"100_CR24","doi-asserted-by":"crossref","unstructured":"Song F, oft WB (1999) A general language model for information retrieval. In: Proceedings of the 22nd annual international ACM SIGIR conference on research and development in information retrieval, pp 270\u2013280","DOI":"10.1145\/319950.320022"},{"key":"100_CR25","doi-asserted-by":"crossref","unstructured":"Tomlinson S (2004) Robust, Web and terabyte retrieval with hummingbird searchServer at TREC 2004. In: The online proceedings of 2004 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-261.terabyte-hummingbird"},{"key":"100_CR26","unstructured":"Vinay V, Cox IJ, Mill-Frayling N et\u00a0al (2006) On ranking the effectiveness of searcher. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, pp 398\u2013404"},{"key":"100_CR27","doi-asserted-by":"crossref","unstructured":"Voorhees EM (2004) Overview of the TREC 2004 Robust Track. In: The online proceedings of 2004 text REtrieval conference","DOI":"10.6028\/NIST.SP.500-261.robust-overview"},{"key":"100_CR28","unstructured":"Yom-Tov E, Fine S, Carmel D et\u00a0al (2005) Learning to estimate query difficulty with applications to missing content detection and distributed information retrieval. In: The proceedings of 28th annual international ACM SIGIR conference on research and development in information retrieval, pp 512\u2013219"},{"key":"100_CR29","unstructured":"Zhou Y, Croft WB (2005) Document quality models for web ad hoc retrieval, a poster presentation. In: The proceedings of the ACM 14th conference on information and knowledge management (CIKM 2005), pp 331\u2013334"},{"key":"100_CR30","doi-asserted-by":"crossref","unstructured":"Zhou Y, Croft WB (2006) Ranking robustness: a novel framework to predict query performance. In: The proceedings of the ACM 15th conference on information and knowledge management (CIKM 2006), pp 567\u2013574","DOI":"10.1145\/1183614.1183696"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0100-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0100-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0100-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:25:30Z","timestamp":1737350730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0100-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,8]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["100"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0100-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2007,8,8]]}}}