Name
Abstract | ||
|---|---|---|
Query expansion is a well-known method for improving average effectiveness in information retrieval. However, the most effective query expansion methods rely on costly retrieval and processing of feedback documents. We explore alternative methods for reducing query-evaluation costs, and propose a new method based on keeping a brief summary of each document in memory. This method allows query expansion to proceed three times faster than previously, while approximating the effectiveness of standard expansion. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30213-1_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
efficiency,query expansion,information retrieval | Query optimization,Database query,Relevance feedback,Information retrieval,Query expansion,Computer science,Document processing,Sargable,String (computer science) | Conference |
Volume | ISSN | Citations |
3246 | 0302-9743 | 15 |
PageRank | References | Authors |
1.03 | 31 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bodo Billerbeck | 1 | 272 | 14.24 |
| Justin Zobel | 2 | 6882 | 880.46 |