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

算法减少连接次数以及扫描数据库的次数从而缩短数据库扫描时间,利用项集有序性改进判断是否进行连接的策略,并利用标志位变化逐步消除无用事务,从而实现了事务压缩和项目压缩, 同时减少了判断时间。实验结果表明,经过优化了的Apriori算法在运行效率上有一定的提高。

An improved Apriori algorithm for mining association rules

For the bottlenecks of the Apriori algorithm,which restrict the efficiency of the Apriori algorithm,an optimized method was presented,which can take advantage of a two-dimensional array marker bit to achieve transaction reduction in association with taking advantage of order item to achieve item reduction.Reducing the times of joining as well as the number of scannings of the database will shorten the scan time.This algorithm takes advantage of order itemsets to improve the strategy,which is used to de-termine whether to join or not.And it removes useless transactions step by the step based on the transformation of a marker bit to reduce the number of transactions and items,while reducing the time of judgment.The results of an experiment show that the im-proved algorithm is more efficient.