Abstract | ||
---|---|---|
Hundreds of millions of users each day use web search engines to meet their information needs. Advances in web search effectiveness are therefore perhaps the most significant public outcomes of IR research. Query expansion is one such method for improving the effectiveness of ranked retrieval by adding additional terms to a query. In previous approaches to query expansion, the additional terms are selected from highly ranked documents returned from an initial retrieval run. We propose a new method of obtaining expansion terms, based on selecting terms from past user queries that are associated with documents in the collection. Our scheme is effective for query expansion for web retrieval: our results show relative improvements over unexpanded full text retrieval of 26%--29%, and 18%--20% over an optimised, conventional expansion approach. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1145/956863.956866 | CIKM |
Keywords | Field | DocType |
additional term,conventional expansion approach,past user query,unexpanded full text retrieval,web retrieval,initial retrieval run,day use web search,web search effectiveness,expansion term,query expansion,information need,web search engine | Query optimization,Data mining,Web search query,Query language,Information retrieval,Query expansion,Computer science,Sargable,Web query classification,Ranking (information retrieval),Concept search | Conference |
ISBN | Citations | PageRank |
1-58113-723-0 | 74 | 2.60 |
References | Authors | |
23 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bodo Billerbeck | 1 | 272 | 14.24 |
Falk Scholer | 2 | 1244 | 93.27 |
Hugh E. Williams | 3 | 1048 | 93.45 |
Justin Zobel | 4 | 6882 | 880.46 |