A Parallel Algorithm Based on Prefix Tree for Sequence Pattern Mining

Algorithm PTPSPM (a parallel algorithm based on prefix tree for sequence pattern mining) is proposed in order to deal with the speed limited and effectiveness problem of the sequence pattern mining in massive data. In this paper, a new prefix-tree structure and an improved prefix-span algorithm are introduced to mine the local sequence, the global sequence are obtained by merging all the local sequences. A new prefix tree pruning technique is presented to delete the global k-sequence which can not be attended. PTPSPM algorithm applies project database identifier index table of dynamic scheduling to avoid the processor idle waiting. Additionally, it cites selective sampling techniques to balance the loads between processors. The experiment results demonstrate that PTPSPM algorithm has better execution performance and speedup.