Effective FPGA-based enhancement of quantitative frequent itemset mining

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Gu, X., Zhu, Y., Qiu, M., Zhou, S., & Wang, C. (2016). Effective FPGA-based enhancement of quantitative frequent itemset mining. In Lecture Notes in Electrical Engineering (Vol. 367, pp. 1225–1231). Springer Verlag. https://doi.org/10.1007/978-3-662-48768-6_137

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free