摘要: This paper proposed a new closed sequential pattern mining algorithm.The algorithm used a list of positional data to reserve the information of item ordering .By using these positional data, we developed two main pruning technique... 展开 This paper proposed a new closed sequential pattern mining algorithm.The algorithm used a list of positional data to reserve the information of item ordering .By using these positional data, we developed two main pruning techniques, backward super-pattern condition and same positional data condition. To ensure correct and compact resulted lattice, we also manipulated some special conditions. From the experimental results, our algorithm outperforms CloSpan in the cases of moderately large datasets and low support threshold. 收起