A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Query Difficulty, Robustness, and Selective Application of Query Expansion
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A selective application of QE would thus be a natural answer to obtain a more robust retrieval system. ...
There is increasing interest in improving the robustness of IR systems, i.e. their effectiveness on difficult queries. ...
Terrier is a modular Information Retrieval framework that provides indexing and retrieval functionalities. ...
doi:10.1007/978-3-540-24752-4_10
fatcat:u4frubscizctxizgh7yz7vtnra
Fondazione Ugo Bordoni at TREC 2003: Robust and Web Track
2003
Text Retrieval Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In particular, we study the problem of the selective application of the query expansion. ...
We define two information theory based functions, Info DFR and InfoQ, predicting respectively the AP (Average Precision) of queries and the AP increment of queries after the application of QE. ...
Acknowledgments The experiments were conducted using the first version of the Terrier's Information Retrieval platform 3 initially developed by Gianni Amati during his PhD at Glasgow University. ...
dblp:conf/trec/AmatiCR03
fatcat:moqgf5z34rd5jdehgcldhwi7ju
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
2004
Text Retrieval Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
These included modifying the search engine parameters, using selective query expansion, and switching between different topic parts. ...
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. ...
Summary Our experiments in the Robust Track of TREC centered on predicting query difficulty and using this prediction for improving information retrieval. ...
dblp:conf/trec/Yom-TovFCDA04
fatcat:y6ffzqmvbrdarpn4yiuybkm6jm
Predicting Query Difficulty in IR: Impact of Difficulty Definition
2019
2019 11th International Conference on Knowledge and Systems Engineering (KSE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
[4 ], [6], [17], selective query expansion [8], [20], or matching parameter selection [7]. ...
The usefulness of QPP is not demonstrated while there are concrete applications of query difficulty prediction. ...
We conclude that the best predictions are obtained with threshold-based strategies and a P@10 gap between difficulty classes and that the choice of the collection has the greatest impact on the predictions ...
doi:10.1109/kse.2019.8919433
dblp:conf/kse/MotheLC19
fatcat:gjr6svljqnd53bzalforgqrruq
Juru at TREC 2005: Query Prediction in the Terabyte and the Robust Tracks
2005
Text Retrieval Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our experiments focus this year on the ad-hock tasks of the Terabyte and the Robust tracks. In both tracks we experimented with the query prediction technology we developed recently. ...
In the Robust track we trained a predictor over one collection (TREC-8) for predicting query difficulty over another collection (AQUAINT). ...
Robust track results Table 3 shows the result of applying query expansion to the Robust topics of this year. The table shows that the Web expansion improves over simple retrieval. ...
dblp:conf/trec/Yom-TovCDPEF05
fatcat:2fupol7eazhxtmddoevezvagia
Predicting the Usefulness of Collection Enrichment for Enterprise Search
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose the use of query performance predictors to selectively apply CE on a per-query basis. ...
Query Expansion (QE) often improves the retrieval performance of an Information Retrieval (IR) system. ...
Conclusions We have proposed the use of query performance predictors to selectively apply CE on a per-query basis for document search within an enterprise. ...
doi:10.1007/978-3-642-04417-5_41
fatcat:zp55sx7rebeidkibi3z6ll7elq
Estimation and use of uncertainty in pseudo-relevance feedback
2007
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The result is a meta-feedback algorithm that is both more robust and more precise than the original strong baseline method. ...
We find that resampling documents helps increase individual feedback model precision by removing noise terms, while sampling from the query improves robustness (worst-case performance) by emphasizing terms ...
Any opinions, findings, and conclusions or recommendations expressed in this material are the authors. and do not necessarily reflect those of the sponsors. ...
doi:10.1145/1277741.1277795
dblp:conf/sigir/Collins-ThompsonC07
fatcat:3grvnr7a3ze7rnzwszwnvpz33i
Query performance prediction for IR
2012
Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Labs in Haifa
76
7612/07/2012
SIGIR 2012 Tutorial: Query Performance Prediction
76
SIGIR 2010, Geneva
Selective query expansion/ query selection
Others
IBM Labs in Haifa
77
7712/07/2012 ...
Robustness-based methods evaluate how robust the results are to perturbations in the query, the result list, and the retrieval method. ...
the training data, which over-represents the lower end of the performance values We discussed three frameworks for query-performance prediction
Concluding Remarks Research on query difficulty estimation ...
doi:10.1145/2348283.2348540
dblp:conf/sigir/CarmelK12
fatcat:ppzmf3ihkzbrje4ny33h6elave
Predicting Query Performance via Classification
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In an empirical study we compare the performance of class-based statistics to their language-model counterparts for two performance-related tasks: predicting query difficulty and expansion risk. ...
compact enough to precompute and store in the index. ...
Acknowledgments We thank Sue Dumais for valuable discussions and feedback on this work. ...
doi:10.1007/978-3-642-12275-0_15
fatcat:fmupa3v3bng6hf47xftbmuvraa
Latent entity space: a novel retrieval approach for entity-bearing queries
2015
Information retrieval (Boston)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since an entity is expected to capture the semantic content of documents and queries more accurately than a term, it would be interesting to study whether leveraging the information about entities can ...
In this paper, we propose a novel retrieval approach, i.e., Latent Entity Space (LES), which models the relevance by leveraging entity profiles to represent semantic content of documents and queries. ...
One of the dominant applications of LES is Web search, as a large portion of queries submitted to Web search engine bear entities [35] , and they would benefit from the effectiveness and robustness of ...
doi:10.1007/s10791-015-9267-x
fatcat:tl2bmqxsprb7td3xfit7ffhzya
Learning to estimate query difficulty
2005
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Experiments on TREC data demonstrate the robustness and the effectiveness of our learning algorithms. ...
We demonstrate the usefulness of quality estimation for several applications, among them improvement of retrieval, detecting queries for which no relevant content exists in the document collection, and ...
Selective automatic query expansion Automatic query expansion (AQE) is a method for improving retrieval by adding terms to the query, based on frequently appearing terms in the top documents retrieved ...
doi:10.1145/1076034.1076121
dblp:conf/sigir/Yom-TovFCD05
fatcat:mnmy6zufyndujok5kl7sdxdomu
Relevance-based entity selection for ad hoc retrieval
2019
Information Processing & Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In addition, We compare our proposed entity selection with a state-of-the-art entity selection technique within the context of ad hoc retrieval using a basic query expansion method and illustrate that ...
an unsupervised entity selection method based on the graphical model for query entity expansion and then for ad hoc retrieval. (3) We thoroughly evaluate our method and compare it with the state-of-the-art ...
Results The results of ad hoc retrieval based on the selected entities of the two method are compared on both ClueWeb12B and Robust'04 and reported in Figs. 7 and 8. ...
doi:10.1016/j.ipm.2019.05.005
fatcat:6ygzbdb4ojci7i3bgrmgmgnuoq
JHU/APL at TREC 2004: Robust and Terabyte Tracks
2004
Text Retrieval Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Robust Topic Difficulty Prediction Results We used an average span statistic of top documents as an estimate of topic difficulty. ...
For example, for a query such as "Hubble Telescope Achievements," both query expansion and term weighting seemed to reduce the importance of the concept of "Achievements." ...
dblp:conf/trec/PiatkoMMC04
fatcat:po4qtcevmzgvddsbdnxzbg6s2q
An information-theoretic approach to automatic query expansion
2001
ACM Transactions on Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also discuss the effect on retrieval effectiveness of the main parameters involved in automatic query expansion, such as data sparseness, query difficulty, number of selected documents, and number of ...
Such scores are used to select and weight expansion terms within Rocchio's framework for query reweighting. ...
ACKNOWLEDGMENTS This work has been carried out within the framework of an agreement between the Italian PT Administration and the Fondazione Ugo Bordoni. ...
doi:10.1145/366836.366860
fatcat:rfqu6k2ejjfhjloyxohh5whbq4
A Survey of Automatic Query Expansion in Information Retrieval
2012
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ranking, to feature selection, and finally to query reformulation. ...
The following questions are addressed: Why is query expansion so important to improve search effectiveness? What are the main steps involved in the design and implementation of an AQE component? ...
ACKNOWLEDGMENTS We are very grateful to three anonymous reviewers for their excellent comments and suggestions. ...
doi:10.1145/2071389.2071390
fatcat:zt4urayicrgb5hbogj5mo7p2hm
« Previous
Showing results 1 — 15 out of 20,141 results