文档介绍：计 算 机 工 程 2009 年 3 月
第 35 卷 第 6 期 rules that have query item to build the rules base, and gets the K words that have the most similarity with the query
words to form a new query and query again to get a new result. At the second stage it uses cluster algorithm on the new result and compute every
document’s final similarity to get a document re-ranking. Experimental result shows this query expansion algorithm outperforms both the association
rules and the cluster algorithm.
【Key words】information retrieval; query expansion; association rules; cluster algorithm
1 概述 关联规则和聚类算法的查询扩展算法(Query Expansion
查询扩展(query expansion)是解决当前信息检索中词不 Algorithm based on Association rules and Cluster Algorithm,
ACQE) CIRB030
匹配问题的有效手段，它通过对用户的初始查询进行扩展和 ，并 在 中文信息测试集上进行实验，实验结
AQE CQE
重构，较好地解决了用户查询用词与文档用词不匹配以及用 果表明，该算法比 算法和 算法都具有更优的检索