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

针对Apriori算法多次扫描事务数据库且产生庞大的候选集性能瓶颈,本文提出了Apriori算法的优化算法。该算法利用频繁项集产生时需要自身连接的特征,在连接前对频繁项集依据支持度由小到大进行排序,从而优化连接策略,并将其运用到描述事务数据库的布尔矩阵中。经实验证明,该算法随着事务数据库规模的扩大,较Apriori算法有明显的优越性。

Improved Aprior algorithm based on mining association rule

Aimed at the performance bottlenecks of multiply scanning the database and generating a large quantity of candidate itemsets in Apriori algorithm,this paper proposes an optimization algorithm of Apriori.It make use of the feature that frequent items are based on their own join.The frequent items are sorted from small to large according to supportability,to optimize the join strategy before generating frequent itemsets.The join optimization strategy is used in boolean matrix that is the representation of dat...