一种挖掘带否定关联规则的算法

A Mining Algorithm for Association Rules with Negation

关联规则挖掘算法的研究主要集中在提高Apriori算法的效率上,而对带否定项关联规则的研究比较少。本文分析了目前带否定关联规则的两种基本算法,并在这两种基本算法的基础上进行改进,提出了一种新的挖掘算法。这种算法减少了在数据库中进行扫描计数的候选集个数,对于提高挖掘带否定关联规则的效率有一定的意义。

The research on the mining algorithms of association rules is to improve the efficiency of Apriori algorithms . The association rules with negative items are studied only by a few researchers. This article analyzes the two basic algorithms for association rules with negative items and puts forward a new algorithm based on improving the existing algorithms. The new algorithm reduces the number of the candidates which need to scan the database, and the algorithm is significant to mining the association rules with negative items.