Sébastien Déjean
Forward and backward feature selection for query performance prediction
Déjean, Sébastien; Ionescu, Radu Tudor; Mothe, Josiane; Ullah, Md Zia
Abstract
The goal of query performance prediction (QPP) is to automatically estimate the effectiveness of a search result for any given query, without relevance judgements. Post-retrieval features have been shown to be more effective for this task while being more expensive to compute than pre-retrieval features. Combining multiple post-retrieval features is even more effective, but state-of-the-art QPP methods are impossible to interpret because of the black-box nature of the employed machine learning models. However, interpretation is useful for understanding the predictive model and providing more answers about its behavior. Moreover, combining many post-retrieval features is not applicable to real-world cases, since the query running time is of utter importance. In this paper, we investigate a new framework for feature selection in which the trained model explains well the prediction. We introduce a step-wise (forward and backward) model selection approach where different subsets of query features are used to fit different models from which the system selects the best one. We evaluate our approach on four TREC collections using standard QPP features. We also develop two QPP features to address the issue of query-drift in the query feedback setting. We found that: (1) our model based on a limited number of selected features is as good as more complex models for QPP and better than non-selective models; (2) our model is more efficient than complex models during inference time since it requires fewer features; (3) the predictive model is readable and understandable; and (4) one of our new QPP features is consistently selected across different collections, proving its usefulness.
Citation
Déjean, S., Ionescu, R. T., Mothe, J., & Ullah, M. Z. (2020). Forward and backward feature selection for query performance prediction. In SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied Computing (690-697). https://doi.org/10.1145/3341105.3373904
Conference Name | 35th Annual ACM Symposium on Applied Computing |
---|---|
Conference Location | Brno, Czech Republic |
Start Date | Mar 30, 2020 |
End Date | Apr 3, 2020 |
Online Publication Date | Mar 30, 2020 |
Publication Date | 2020-03 |
Deposit Date | Mar 13, 2023 |
Publisher | Association for Computing Machinery (ACM) |
Pages | 690-697 |
Book Title | SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied Computing |
ISBN | 9781450368667 |
DOI | https://doi.org/10.1145/3341105.3373904 |
You might also like
Combining Word Embedding Interactions and LETOR Feature Evidences for Supervised QPP
(2023)
Conference Proceeding
Selective Query Processing: A Risk-Sensitive Selection of Search Configurations
(2023)
Journal Article
InnEO'Space PhD: Preparing Young Researchers for a successful career on Earth Observation applications
(2022)
Conference Proceeding
Instruments and Tools to Identify Radical Textual Content
(2022)
Journal Article
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search