Paper
11 September 2015 Parallelization of Apriori algorithm using Charm++ library
Marek Puścian, Waldemar Grabski
Author Affiliations +
Proceedings Volume 9662, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015; 96623S (2015) https://doi.org/10.1117/12.2205908
Event: XXXVI Symposium on Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments (Wilga 2015), 2015, Wilga, Poland
Abstract
This paper deals with the problem of adapting sequential frequent item sets mining algorithm to parallel processing. The original Bodon's Apriori algorithm has been partitioned into loosely coupled tasks and prepared to be executed on several computation nodes using Charm++ library. Variety of optimization methods have been proposed and successfully implemented in parallel environment. The work provides enhancements to achieve good efficiency during parallelization of existing solutions, e.g.: how to organize communication between tasks. The presented approach has been illustrated with many experiments and measurements performed on parallelized algorithm.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marek Puścian and Waldemar Grabski "Parallelization of Apriori algorithm using Charm++ library", Proc. SPIE 9662, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015, 96623S (11 September 2015); https://doi.org/10.1117/12.2205908
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Mining

Optimization (mathematics)

Parallel processing

Computing systems

Data communications

Data mining

Data storage

Back to Top