Improved Algorithm for Sequential Pattern Mining Based on PrefixSpan
Jun Fan · Jisuanji gongcheng · 2009
Aiming at the PrefixSpan algorithm produce huge amount of project databases in mining sequence patterns, this paper proposes an Improved PrefixSpan algorithm for Mining Sequential Patterns(IPMSP) alaorithm.By avoid produce duplicated project databases with the same prefix pattern through checking the prefix with regard to prefix of the sequence database and abnegating the non-frequent items and project databases which sequential number is lower than minimum support in the recursive mining process, the performance of PrefixSpan is well improved.Experiment results shows that the time and space performance of IPMSP algorithm are better than that of PrefixSpan.