A Parallel Algorithm Based on Prefix Tree for Sequence Pattern Mining

Authors :: Hai-tao He
Yuan Dong
Jiadong Ren
Source :: 2010 First ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems.
Publication Year :: 2010
Publisher :: IEEE, 2010.
Abstract: 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.

Subjects :: GSP Algorithm
Sequence
Speedup
Computer science
Trie
Parallel algorithm
Algorithm design
Dynamic priority scheduling
Data mining
computer.software_genre
computer
Algorithm
FSA-Red Algorithm

Database :: OpenAIRE
Journal :: 2010 First ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems
Accession number :: edsair.doi...........4b8abf07ed491c2a8fa23f5261999b89
Full Text :: https://doi.org/10.1109/cdee.2010.10