FApriori: A modified Apriori algorithm based on checkpoint

Many Algorithms have been proposed to mine association rule that uses support and confidence as constraint. We are proposing a method that can be combined with Apriori algorithm and reduces storage required to store candidate and the execution time by reducing CPU time. CPU time is saved by reducing candidate sets size and time required to calculate the support of each candidate. We are introducing the concept of checkpoint based on support value to reduce the execution time and overall storage space required to store candidate generated during scanning of dataset.

[1]  Feng Wang,et al.  An Improved Apriori Algorithm Based on the Matrix , 2008, 2008 International Seminar on Future BioMedical Information Engineering.

[2]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[3]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[4]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[5]  úhg,et al.  An Algorithm for Mining Association Rules Using Perfect Hashing and Database Pruning , 2001 .

[6]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[7]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[8]  Zhiyi Liu,et al.  An improved apriori algorithm , 2009, Proceedings of 2011 International Conference on Electronics and Optoelectronics.