A Improved PrefixSpan algorithm for sequential pattern mining

Aiming at the problem of constructing huge amounts of projected databases in PrefixSpan algorithm, this paper proposes an Improved PrefixSpan algorithm for Mining Sequential Patterns, called BLSPM algorithm (based on bi-level Sequential Patterns Mining). The algorithm use duplicated projection and certain specific sequential patterns pruning, reduce the scale of projected databases and the runtime of scanning projected databases, thus, the efficiency of algorithm could be raised up greatly, and all needed sequential patterns are obtained. Experiment results shows that BLSPM algorithm is more efficient than PrefixSpan algorithm in large databases.