Improving automatic query expansion (1998)
Cached
Download Links
- [www.inf.ed.ac.uk]
- [www.ai.mit.edu]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 195 - 3 self |
BibTeX
@INPROCEEDINGS{Singhal98improvingautomatic,
author = {Ar Mitra Amit Singhal},
title = {Improving automatic query expansion},
booktitle = {},
year = {1998},
pages = {206--214}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Most casual users of IR systems type short queries. Recent research has shown that adding new words to these queries via odhoc feedback improves the re-trieval effectiveness of such queries. We investigate ways to improve this query expansion process by refining the set of documents used in feedback. We start by using manually formulated Boolean filters along with proxim-ity constraints. Our approach is similar to the one pro-posed by Hearst[l2]. Next, we investigate a completely automatic method that makes use of term cooccurrence information to estimate word correlation. Experimental results show that refining the set of documents used in query expansion often prevents the query drift caused by blind expansion and yields substantial improvements in retrieval effectiveness, both in terms of average preci-sion and precision in the top twenty documents. More importantly, the fully automatic approach developed in this study performs competitively with the best manual approach and requires little computational overhead. 1
