An Improved Apriori-based Algorithm for Association Rules Mining
- 1 January 2009
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery
- Vol. 2, 51-55
- https://doi.org/10.1109/fskd.2009.193
Abstract
Because of the rapid growth in worldwide information, efficiency of association rules mining (ARM) has been concerned for several years. In this paper, based on the original Apriori algorithm, an improved algorithm IAA is proposed. IAA adopts a new count-based method to prune candidate itemsets and uses generation record to reduce total data scan amount. Experiments demonstrate that our algorithm outperforms the original Apriori and some other existing ARM methods.Keywords
This publication has 5 references indexed in Scilit:
- A Heuristic Data Distribution Scheme for data mining applications on grid environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- An Algorithm to Improve the Effectiveness of AprioriPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- A New Improvement on Apriori AlgorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- T-trees, vertical partitioning and distributed association rule miningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993