Parallelization of Eclat algorithm using Charm++ library

In this paper we describe Eclat algorithm that is adapted to deal with growing data repositories. Presented solution utilizes Master-Slave pattern to distribute data mining tasks among available computation nodes. Several improvements have been proposed and successfully implemented using Charm++ library. This paper introduces optimization techniques to reduce communication cost and synchronization overhead. It also discusses results on the performance of parallel Eclat algorithm on different databases and compares it against parallel Apriori algorithm.