This paper describes and evaluates the vector-space and probabilistic IR models used to retrieve news articles from a corpus written in the French language. Based on three CLEF test-collections and 151 queries, we classify the poor retrieval results of difficult topics under 6 categories. The explanations we obtain from this analysis differ from those suggested a priori by our students. We use the Web to manually or automatically find related search terms to the original query. We evaluate these two query expansion strategies in order to improve mean average precision (MAP) and to reduce the number of topics for which no pertinent responses are listed among the top ten references returned.
Description
Why do successful search systems fail for some topics
%0 Conference Paper
%1 1244193
%A Savoy, Jacques
%B SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
%C New York, NY, USA
%D 2007
%I ACM
%K information_retrieval search
%P 872--877
%R http://doi.acm.org/10.1145/1244002.1244193
%T Why do successful search systems fail for some topics
%U http://portal.acm.org/citation.cfm?id=1244002.1244193&coll=portal&dl=ACM&CFID=52621965&CFTOKEN=84190707
%X This paper describes and evaluates the vector-space and probabilistic IR models used to retrieve news articles from a corpus written in the French language. Based on three CLEF test-collections and 151 queries, we classify the poor retrieval results of difficult topics under 6 categories. The explanations we obtain from this analysis differ from those suggested a priori by our students. We use the Web to manually or automatically find related search terms to the original query. We evaluate these two query expansion strategies in order to improve mean average precision (MAP) and to reduce the number of topics for which no pertinent responses are listed among the top ten references returned.
%@ 1-59593-480-4
@inproceedings{1244193,
abstract = {This paper describes and evaluates the vector-space and probabilistic IR models used to retrieve news articles from a corpus written in the French language. Based on three CLEF test-collections and 151 queries, we classify the poor retrieval results of difficult topics under 6 categories. The explanations we obtain from this analysis differ from those suggested a priori by our students. We use the Web to manually or automatically find related search terms to the original query. We evaluate these two query expansion strategies in order to improve mean average precision (MAP) and to reduce the number of topics for which no pertinent responses are listed among the top ten references returned.},
added-at = {2009-09-13T12:10:23.000+0200},
address = {New York, NY, USA},
author = {Savoy, Jacques},
biburl = {https://www.bibsonomy.org/bibtex/28deee1f28457b2e9d813f436a67490cf/ewomant},
booktitle = {SAC '07: Proceedings of the 2007 ACM symposium on Applied computing},
description = {Why do successful search systems fail for some topics},
doi = {http://doi.acm.org/10.1145/1244002.1244193},
interhash = {f0f47dfef58bff37a55ac2ce97f9e2d9},
intrahash = {8deee1f28457b2e9d813f436a67490cf},
isbn = {1-59593-480-4},
keywords = {information_retrieval search},
location = {Seoul, Korea},
pages = {872--877},
publisher = {ACM},
timestamp = {2009-09-13T12:10:23.000+0200},
title = {Why do successful search systems fail for some topics},
url = {http://portal.acm.org/citation.cfm?id=1244002.1244193&coll=portal&dl=ACM&CFID=52621965&CFTOKEN=84190707},
year = 2007
}