A Reconfigurable Platform for Frequent Pattern Mining

Authors:
Song Sun;Michael Steffen;Joseph Zambreno
Affiliations:
-;-;-
Venue:
RECONFIG '08 Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs
Year:
2008

Citing 0
Cited 3

A highly parallel algorithm for frequent itemset mining

MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
HC-CART: A parallel system implementation of data mining classification and regression tree (CART) algorithm on a multi-FPGA system

ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
An FPGA-Based Accelerator for Frequent Itemset Mining

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new hardware architecture for frequent pattern mining based on a systolic tree structure is proposed. The goal of this architecture is to mimic the internal memory layout of the original FP-growth algorithm while achieving a much higher throughput. We also describe an embedded platform implementation of this architecture along with detailed analysis of area requirements and performance results for different configurations. Our results show that with an appropriate selection of tree size, the reconfigurable platform can be several orders of magnitude faster than the FP-growth algorithm.