An Efficient Algorithm for Sequential Pattern Mining with Time Constraints
In this paper, a new algorithm named TCSP is proposed to mine sequential patterns with different time constraints. It scans the database into memory and constructs time-index sets for efficient processing. It mines the desired sequential patterns without generating any candidates. We have evaluated the new algorithm with the well-known GSP algorithm and the DELISP algorithm for various datasets and constraints. The comprehensive experiments show that the TCSP algorithm works better and it has good scalability.
Z. P. Tao "An Efficient Algorithm for Sequential Pattern Mining with Time Constraints", Advanced Materials Research, Vols. 341-342, pp. 530-534, 2012