A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Tree partition based parallel frequent pattern mining on shared memory systems
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stage and mining stage. The main idea is to build only one FP-Tree in the memory, partition it into several independent parts and distribute them to different threads. A heuristic algorithm is devised to balance the workload. Our algorithm can not only alleviate the impact of locks during the tree-building stage, but alsodoi:10.1109/ipdps.2006.1639620 dblp:conf/ipps/ChenLHCZZ06 fatcat:tt5e2oy67jginpdjjlzmrde2a4