一种正负关联规则的快速查询扩展算法

his paper introduces negative association rules to the field of query expansion, and proposes new models of query expansion; meanwhile, we design an algorithm of query expansion based on positive and negative association rules. By converting the text database to Boolean Vector Matrix, and allotting equitable data storage structure, this algorithm can produce frequent and infrequent feature terms according to the inner vector product, and get positive and negative association rules between terms. Experimental results show that this algorithm can expand original query terms efficiently and effectively, and scan the database only once. Meanwhile, it has advantages such as pruning dynamically, without saving mid items, and saving lots of memories, which is important to the research of query expansion in information retrieval.