La prédiction efficace de la difficulté des requêtes : une tâche impossible?

Abstract : ABSTRACT. Search engines found answers whatever the user query is, but some queries are more difficult than others for the system. For difficult queries, adhoc treatments must be applied. Predicting query difficulty is crucial and different predictors have been proposed. In this paper, we revisit these predictors. First we check the non statistical redundancy of predictors. Then, we show that the correlation between the values of predictors and system performance gives little hope on the ability of these predictors to be effective. Finally, we study the ability of predictors to predict the classes of difficulty by relying on a variety of exploratory and learning methods. We show that despite the (low) correlation with performance measures, current predictors are not robust enough to be used in practical IR applications. MOTS-CLÉS : Recherche d'information, requête difficile, prédiction, analyse de données.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Léa Laporte <>
Submitted on : Friday, March 20, 2015 - 12:30:42 PM
Last modification on : Friday, June 14, 2019 - 6:31:07 PM
Long-term archiving on : Monday, June 22, 2015 - 7:17:30 AM


Files produced by the author(s)


  • HAL Id : hal-01133774, version 1


Adrian-Gabriel Chifu, Léa Laporte, Josiane Mothe. La prédiction efficace de la difficulté des requêtes : une tâche impossible?. Conférence en Recherche d’Information et Applications (CORIA 2015), Mar 2015, Paris, France. pp.189-204. ⟨hal-01133774⟩



Record views


Files downloads