Share Email Print
cover

Proceedings Paper

Adapting Eclat algorithm to parallel environments with Charm++ library
Author(s): Marek Puścian; Waldemar Grabski
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper we describe Eclat algorithm that is adapted to deal with 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. This paper introduces optimization techniques to reduce communication cost and synchronization overhead. It also discusses results of the performance of parallel Eclat algorithm against different databases and compares it with parallel Apriori algorithm. The proposed approach has been illustrated with many experiments and measurements performed using multiprocessor and multithreaded computer platform.

Paper Details

Date Published: 28 September 2016
PDF: 8 pages
Proc. SPIE 10031, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016, 100315A (28 September 2016); doi: 10.1117/12.2249403
Show Author Affiliations
Marek Puścian, Warsaw Univ. of Technology (Poland)
Waldemar Grabski, Warsaw Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 10031:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top