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

Improved Prefixspan Algorithm and Its Application in Sequential Pattern Mining

Zhang Wei, Liu Feng, Teng Shao-hua   

  1. School of Computers, Guangdong University of Technology, Guangzhou 510006, China
  • Received:2013-10-08 Online:2013-12-30 Published:2013-12-30

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(Prefixprojected Sequential Pattern Mining);  SPAM(Sequence Pattern Mining); bitmap; data mining

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!