Parallelizing the Improved Algorithm for Frequent Patterns Mining Problem

Mining frequent pattern has been studied for a long time. There were many algorithms introduced and proved their efficiency. But most of them have to rebuild the frequent patterns every time when there are some changes (insert, update or delete) in dataset. Accumulated Frequent Pattern has been introduced recently. It updates existing frequent patterns when there are any changes. But the time complexity is so high. This paper introduces two ways to parallelize the Accumulated Frequent Pattern algorithm and reduce the time complexity.