Concurrent frequent itemsets mining in a shared prefix tree using the Apriori algorithm

Marek Puścian

Abstract

This paper presents a sequential frequent itemsets mining algorithm Apriori that is adapted to concurrent processing. It applies Master Slave scheme to candidate generation and support counting operations performed by threads on a single machine. Two approaches to traversing shared prefix tree and counting support of itemsets are presented and compared. Several optimization methods have been proposed for the multithreaded environment. Proposed enhancements have been successfully implemented using JAVA. This paper discusses results of the performance of concurrent Apriori algorithm against different datasets. Presented approach has been illustrated with many experiments and measurements performed using multiprocessor and multithreaded computer.
Author Marek Puścian (FEIT / IN)
Marek Puścian ,,
- The Institute of Computer Science
Pages108082W-1-108082W-9
Publication size in sheets0.5
Book Romaniuk Ryszard, Linczuk Maciej Grzegorz (eds.): Proceedings of SPIE: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2018, vol. 10808, 2018, SPIE - the International Society for Optics and Photonics, ISBN 9781510622036, 2086 p.
Keywords in Englishalgorithm parallelization, shared memory, Apriori, frequent items mining, a measure of speed up.
DOIDOI:10.1117/12.2501692
URL https://www.spiedigitallibrary.org/conference-proceedings-of-spie/10808/108082W/Concurrent-frequent-itemsets-mining-in-a-shared-prefix-tree-using/10.1117/12.2501692.full
Languageen angielski
File
108082W_puscian.pdf 533.88 KB
Score (nominal)15
ScoreMinisterial score = 15.0, 16-10-2018, BookChapterMatConf
Ministerial score (2013-2016) = 15.0, 16-10-2018, BookChapterMatConf
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back