Effective FPGA-Based Enhancement of Quantitative Frequent Itemset Mining

Frequent itemset mining (FIM) algorithms are widely used to discover common patterns in large-scale data sets. In conventional CPU-based systems, mining algorithms, which are usually data and memory intensive, often lead to critical power and latency issues growing even worse with a larger scale of data sets. Having identified the pipelining workflow behind the logic of frequent itemset mining, we propose a quantitative mining algorithm named Q-Bit-AssoRule and further design a pipelined FPGA-based implementation of Q-Bit-AssoRule algorithm to accelerate frequent itemset mining processing, achieving better performance, throughput, scalability as well as less hardware cost. Our evaluation result shows that our implementation outperforms other hardware approaches in terms of clock frequency and throughput.

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

[2]  Ming-Syan Chen,et al.  Hardware-Enhanced Association Rule Mining with Hashing and Pipelining , 2008, IEEE Transactions on Knowledge and Data Engineering.

[3]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[4]  Tsau Young Lin,et al.  A fast association rule algorithm based on bitmap and granular computing , 2003, The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03..

[5]  Joseph Zambreno,et al.  Design and Analysis of a Reconfigurable Platform for Frequent Pattern Mining , 2011, IEEE Transactions on Parallel and Distributed Systems.

[6]  Alfred Strey,et al.  Novel strategies for hardware acceleration of frequent itemset mining with the apriori algorithm , 2009, 2009 International Conference on Field Programmable Logic and Applications.

[7]  Viktor K. Prasanna,et al.  Efficient hardware data mining with the Apriori algorithm on FPGAs , 2005, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05).