Novel Query Expansion Technique using Apriori Algorithm
暂无分享,去创建一个
One problem in query reformulation process is to nd an optimal set of terms to add to the old query. In our TREC experiments this year, we propose to use the association rule discovery (especially apriori algorithm) to nd good candidate terms to enhance the query. These candidate terms are automatically derived from collection, added to the original query to build a new one. Experiments conducted on a subset of TREC collections gives quite promising results. We achieve a 19% improvement with old TREC7 adhoc queries.
[1] Peter G. Anick,et al. A direct manipulation interface for boolean information retrieval via natural language query , 1989, SIGIR '90.
[2] Arnon Rungsawang. DSIR: the First TREC-7 Attempt , 1998, TREC.
[3] Ellen M. Voorhees,et al. On Expanding Query Vectors with Lexically Related Words , 1993, TREC.
[4] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[5] James Allan,et al. Automatic Query Expansion Using SMART: TREC 3 , 1994, TREC.