基于集合运算的频繁集挖掘优化算法

An improved algorithm based on sets operation for mining frequent itemsets

挖掘关联规则是数据挖掘中一个重要的课题,产生频繁项目集是其中的一个关键步骤。提出了一种基于集合运算的频繁项目集挖掘算法,并将该算法与经典算法Apriori进行比较。该算法只需要对数据库扫描一遍。实验表明该算法的效率较好。

Mining association rules is an important issue in data mining and one of its key steps is generating frequent itemsets. A frequent itemsets mining algorithm based on sets operation was presented and compared with the classical algorithms apriori. This algorithm needs only to scan the database once. Experiments indicate the new algorithm is very efficient.