An improved apriori algorithm
暂无分享,去创建一个
In this study, it proposes a new optimization algorithm called APRIORI-IMPROVE based on the insufficient of Apriori. APRIORI-IMPROVE algorithm presents optimizations on 2-items generation, transactions compression and so on. APRIORI-IMPROVE uses hash structure to generate L2, uses an efficient horizontal data representation and optimized strategy of storage to save time and space. The performance study shows that APRIORI-IMPROVE is much faster than Apriori.
[1] Hui Xiong,et al. Discovery of maximum length frequent itemsets , 2008, Inf. Sci..
[2] Das Amrita,et al. Mining Association Rules between Sets of Items in Large Databases , 2013 .
[3] Chengqi Zhang,et al. EDUA: An efficient algorithm for dynamic database mining , 2007, Inf. Sci..