Journal of Guangdong University of Technology ›› 2013, Vol. 30 ›› Issue (4): 49-54.doi: 10.3969/j.issn.1007-7162.2013.04.008
• Comprehensive Studies • Previous Articles Next Articles
Zhang Wei, Liu Feng, Teng Shao-hua
Received:
Online:
Published:
Abstract: Because sequential pattern mining needs a lot of computing time and storage space, how to reduce the amount of calculation and storage space becomes the key of the sequential pattern mining algorithm. Combining the PrefixSpan algorithm with Bitmap data structure, this text proposes an improved sequential pattern mining algorithm BM-PrefixSpan. The PFPBM (Prefix of First Position on BitMap) table was designed and implemented. When a new item appeared in a sequence, it was recorded in the PFPBM table. The experimental results show that the BM-prefixspan algorithm mines sequential patterns faster and better than others.
Key words: sequence pattern; PrefixSpan(Prefixprojected Sequential Pattern Mining); SPAM(Sequence Pattern Mining); bitmap; data mining
ZHANG Wei, LIU Feng, TENG Shao-Hua. Improved Prefixspan Algorithm and Its Application in Sequential Pattern Mining[J].Journal of Guangdong University of Technology, 2013, 30(4): 49-54.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://xbzrb.gdut.edu.cn/EN/10.3969/j.issn.1007-7162.2013.04.008
https://xbzrb.gdut.edu.cn/EN/Y2013/V30/I4/49
Cited