{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:35:52Z","timestamp":1771515352541,"version":"3.50.1"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union\u2019s Horizon Europe research and innovation programme","award":["833115"],"award-info":[{"award-number":["833115"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>In information retrieval systems, search parameters are optimized to ensure high effectiveness based on a set of past searches, and these optimized parameters are then used as the search configuration for all subsequent queries. A better approach, however, would be to adapt the parameters to fit the query at hand. Selective query expansion is one such an approach, in which the system decides automatically whether or not to expand the query, resulting in two possible search configurations. This approach was extended recently to include many other parameters, leading to many possible search configurations where the system automatically selects the best configuration on a per-query basis. One problem with this approach is the system training, which requires evaluation of each training query with every possible configuration. In real-world systems, so many parameters and possible values must be evaluated that this approach is impractical, especially when the system must be updated frequently, as is the case for commercial search engines. In general, the more configurations, the greater the effectiveness when configuration selection is appropriate but also the greater the risk of decreasing effectiveness in the case of an inappropriate configuration selection. To determine the ideal configurations to be used for each query in real-world systems, we have developed a method in which a limited number of possible configurations are pre-selected, then used in a meta-search engine that decides the best search configuration for each query. We define a risk-sensitive approach for configuration pre-selection that considers the risk-reward tradeoff between the number of configurations kept and system effectiveness. We define two alternative risk functions to apply to different goals. For final configuration selection, the decision is based on query feature similarities. We compare two alternative risk functions on two query types (ad hoc and diversity) and compare these to more sophisticated machine learning based methods. We find that a relatively small number of configurations (20) selected by our risk-sensitive model is sufficient to obtain results close to the best achievable results for each query. Effectiveness is increased by about 15% according to the P@10 and nDCG@10 evaluation metrics when compared to traditional grid search using a single configuration and by about 20% when compared to learning to rank documents. Our risk-sensitive approach works for both diversity- and ad hoc oriented searches. Moreover, the similarity-based selection method outperforms the more sophisticated approaches. Thus, we demonstrate the feasibility of developing per-query information retrieval systems, which will guide future research in this direction.<\/jats:p>","DOI":"10.1145\/3608474","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T12:07:28Z","timestamp":1689250048000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Selective Query Processing: A Risk-Sensitive Selection of Search Configurations"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9273-2193","authenticated-orcid":false,"given":"Josiane","family":"Mothe","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Toulouse, UT2J, INSPE, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4022-7344","authenticated-orcid":false,"given":"Md. Zia","family":"Ullah","sequence":"additional","affiliation":[{"name":"Centre National de la Recherche Scientifique (CNRS) France, and Edinburgh Napier University, UK"}]}],"member":"320","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484033"},{"key":"e_1_3_2_3_2","volume-title":"Probability Models for Information Retrieval Based on Divergence from Randomness","author":"Amati Giambattista","year":"2003","unstructured":"Giambattista Amati. 2003. Probability Models for Information Retrieval Based on Divergence from Randomness. Ph.D. dissertation. University of Glasgow."},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-24752-4_10","volume-title":"Advances in Information Retrieval","author":"Amati Giambattista","year":"2004","unstructured":"Giambattista Amati, Claudio Carpineto, and Giovanni Romano. 2004. Query difficulty, robustness, and selective application of query expansion. In Advances in Information Retrieval, Sharon McDonald and John Tait (Eds.). Springer, Berlin, Germany, 127\u2013137."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-018-9347-9"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571971"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914671"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835615"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372124.3372125"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3166072.3166084"},{"key":"e_1_3_2_11_2","first-page":"81","volume-title":"Proceedings of the Asia Information Retrieval Symposium","author":"Benham Rodger","year":"2019","unstructured":"Rodger Benham, Alistair Moffat, and J. Shane Culpepper. 2019. On the pluses and minuses of risk. In Proceedings of the Asia Information Retrieval Symposium. 81\u201393."},{"key":"e_1_3_2_12_2","first-page":"281","article-title":"Random search for hyper-parameter optimization","author":"Bergstra James","year":"2012","unstructured":"James Bergstra and Yoshua Bengio. 2012. Random search for hyper-parameter optimization. Journal of Machine Learning Research 13 (Feb. 2012), 281\u2013305.","journal-title":"Journal of Machine Learning Research"},{"issue":"13","key":"e_1_3_2_13_2","first-page":"1726","article-title":"Learning to choose the best system configuration in information retrieval: The case of repeated queries","volume":"21","author":"Bigot Anthony","year":"2015","unstructured":"Anthony Bigot, S\u00e9bastien D\u00e9jean, and Josiane Mothe. 2015. Learning to choose the best system configuration in information retrieval: The case of repeated queries. Journal of Universal Computer Science 21, 13 (2015), 1726\u20131745. https:\/\/lib.jucs.org\/article\/23825\/","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_14_2","first-page":"23","volume-title":"Proceedings of the 4th International Conference on Advances in Human-Oriented and Personalized Mechanisms, Technologies, and Services (CENTRIC\u201911)","author":"Candillier Laurent","year":"2011","unstructured":"Laurent Candillier, Max Chevalier, Damien Dudognon, and Josiane Mothe. 2011. Diversity in recommender systems. In Proceedings of the 4th International Conference on Advances in Human-Oriented and Personalized Mechanisms, Technologies, and Services (CENTRIC\u201911). 23\u201329."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390377"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19231-9_3"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646033"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210121"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390446"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646059"},{"key":"e_1_3_2_22_2","volume-title":"TREC 2013 Web Track Overview","author":"Collins-Thompson Kevyn","year":"2014","unstructured":"Kevyn Collins-Thompson, Paul Bennett, Charles L. A. Clarke, Fernando Diaz, and Ellen M. Voorhees. 2014. TREC 2013 Web Track Overview. Technical Report. Michigan University at Ann Arbor."},{"key":"e_1_3_2_23_2","unstructured":"Jonathan Compaor\u00e9 S\u00e9bastien D\u00e9jean Adji Ma\u0155ram Gueye Josiane Mothe and Joelson Randriamparany. 2011. Mining information retrieval results: Significant IR parameters. In Proceedings of the 1st International Conference on Advances in Information Mining and Management Vol. 74."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031220"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983894"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3231937"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609625"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911511"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911530"},{"key":"e_1_3_2_30_2","first-page":"319","volume-title":"Proceedings of the 1st Text Retrieval Conference (TREC-1)","author":"Fox Edward A.","year":"1993","unstructured":"Edward A. Fox, M. Prabhakar Koushik, Joseph Shaw, Russell Modlin, and Durgesh Rao. 1993. Combining evidence from multiple searches. In Proceedings of the 1st Text Retrieval Conference (TREC-1). 319\u2013328."},{"key":"e_1_3_2_31_2","unstructured":"Edward A. Fox and Joseph A. Shaw. 1994. Combination of multiple searches. In Proceedings of the 3rd Text REtrieval Conference (TREC\u201994) . 105\u2013108."},{"key":"e_1_3_2_32_2","first-page":"198","volume-title":"Adaptivity, Personalization and Fusion of Heterogeneous Information","author":"Guo Qi","year":"2010","unstructured":"Qi Guo, Ryen W. White, Susan T. Dumais, Jue Wang, and Blake Anderson. 2010. Predicting query performance using query, result, and user interaction features. In Adaptivity, Personalization and Fusion of Heterogeneous Information. CID, Paris, France, 198\u2013201."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531832"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9101-4"},{"key":"e_1_3_2_35_2","first-page":"706","volume-title":"Proceedings of Recherche d\u2019Information et ses Applications (RIAO\u201904)","author":"He Ben","year":"2004","unstructured":"Ben He and Iadh Ounis. 2004. A query-based pre-retrieval model selection approach to information retrieval. In Proceedings of Recherche d\u2019Information et ses Applications (RIAO\u201904). 706\u2013719."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.11.002"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-005-6994-4"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","unstructured":"Kalervo J\u00e4rvelin and Jaana Kek\u00e4l\u00e4inen. 2017. IR evaluation methods for retrieving highly relevant documents. ACM SIGIR Forum 51 (2017) 243\u2013250.","DOI":"10.1145\/3130348.3130374"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210186"},{"key":"e_1_3_2_40_2","article-title":"Merge double thompson sampling for large scale online ranker evaluation","author":"Li Chang","year":"2018","unstructured":"Chang Li, Ilya Markov, Maarten de Rijke, and Masrour Zoghi. 2018. Merge double thompson sampling for large scale online ranker evaluation. arXiv preprint arXiv:1812.04412 (2018).","journal-title":"arXiv preprint arXiv:1812.04412"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159665"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E94.D.1854"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0730-4"},{"key":"e_1_3_2_44_2","volume-title":"Linear and Nonlinear Programming","author":"Luenberger David G.","year":"1984","unstructured":"David G. Luenberger and Yinyu Ye. 1984. Linear and Nonlinear Programming. Vol. 2. Springer."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010070"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809463"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2493175.2493176"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITCC.2001.918869"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9019-z"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277824"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210005"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482422"},{"key":"e_1_3_2_54_2","first-page":"7","volume-title":"Proceedings of the ACM Conference on Research and Development in Information Retrieval Workshop","author":"Mothe Josiane","year":"2005","unstructured":"Josiane Mothe and Ludovic Tanguy. 2005. Linguistic features to predict query difficulty. In Proceedings of the ACM Conference on Research and Development in Information Retrieval Workshop. ACM, New York, NY, 7\u201310."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.116"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.03.023"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.07.020"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2180868.2180873"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3300196"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983792"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183698"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-005-6991-7"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2682862.2682863"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571963"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348385"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2740926"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23476"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571954"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348354"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3608474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3608474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:45Z","timestamp":1750285785000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3608474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3608474"],"URL":"https:\/\/doi.org\/10.1145\/3608474","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,21]]},"assertion":[{"value":"2021-09-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-05","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}