Customizing FP-growth algorithm to parallel mining with Charm++ library

Customizing FP-growth algorithm to parallel mining with Charm++ library

I describe FP-growth algorithm that is customized to handle growing data repositories. The presented solution utilizes Master-Slave scheme to distribute data mining tasks among available computation nodes. Several improvements have been proposed and successfully implemented using Charm++ library.

Author: Marek PuĊ›cian
Conference: Title