Parallelization of frequent Itemset mining methods with FP-tree : an experiment with PrePost+ algorithm

Abstract EN

Parallel processing has turn to be a common programming practice because of its efficiency and thus becomes an interesting field for researchers.

With the introduction of multi- core processors as well as general purpose graphics processing units, parallel programming has become affordable.

This leads to the parallelization of many of the complex data processing algorithms including algorithms in data mining.

In this paper, a study on parallel PrePost+ is presented.

PrePost+ is an efficient frequent itemset mining algorithm.

The algorithm has been modified as a parallel algorithm and the obtained result is compared with the result of sequential PrePost+ algorithm.