对关联规则挖掘中Apriori算法的一种改进

An Improved Apriori Algorithm in Mining Association Rules

针对Apriori算法寻找频繁项集需要反复扫描数据库的问题,提出了一种将事务数据布尔化,并在其基础上通过优化连接和剪枝,快速查找频繁项集的思想。即通过优化连接和剪枝,减少候选项集,并根据判断相应布尔向量"与"运算的结果,快速地归纳出频繁项集。研究和实验表明,该算法不仅只需扫描一次数据库,而且还具有查找速度快,节省内存空间和处理项目集维数多等优点。

As Apriori algorithm for finding frequent itemset requires to scan databases repeatedly,an enhanced Apriori algorithm which used the row vectors of Boolean matrix for transaction databases,optimized the connection and pruning,can find the frequent itemset quickly.It uses the optimization to reduce the itemset with candidate,combines the inner of Boolean-vector to product the frequent itemset.Studies and experiments shows that the algorithm not only scans the database only once,but also search the result qui...