广东工业大学学报Issue(4)：49-54,6.DOI:10.3969/j.issn.1007-7162.2013.04.008
改进的 PrefixSpan 算法及其在序列模式挖掘中的应用
Improved Prefixspan Algorithm and Its Application in Sequential Pattern Mining
摘要
Abstract
Because sequential pattern mining needs a lot of computing time and storage space , how to re-duce the amount of calculation and storage space becomes the key of the sequential pattern mining algo -rithm.Combining the PrefixSpan algorithm with Bitmap data structure , this text proposes an improved se-quential 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 ( Se-quence Pattern Mining )/bitmap/data mining分类
信息技术与安全科学引用本文复制引用
张巍,刘峰,滕少华..改进的 PrefixSpan 算法及其在序列模式挖掘中的应用[J].广东工业大学学报,2013,(4):49-54,6.基金项目
教育部重点实验室基金资助项目（110411）；广东省自然科学基金资助项目（10451009001004804，9151009001000007）；广东省科技计划项目（2012B091000173）；广州市科技计划项目（2012J5100054，2013J4500028）、韶关市科技计划项目 （）
