SPaMi-FTS: An efficient algorithm for mining frequent sequential patterns

Abstract

In this paper, we propose a novel algorithm for mining frequent sequences, called SPaMi-FTS (Sequential Pattern Mining based on Frequent Two-Sequences). SPaMi-FTS introduces a new data structure to store the frequent sequences, which together with a new pruning strategy to reduce the number of candidate sequences and a new heuristic to generate them, allows to increase the efficiency of the frequent sequence mining. The experimental results show that the SPaMi-FTS algorithm has better performance than the main algorithms reported to discover frequent sequences.