An Efficient Algorithm for Sequential Pattern Mining with Time Constraints

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 341-342)

Edited by:

Liu Guiping

Pages:

530-534

DOI:

10.4028/www.scientific.net/AMR.341-342.530

Citation:

Z. P. Tao "An Efficient Algorithm for Sequential Pattern Mining with Time Constraints", Advanced Materials Research, Vols. 341-342, pp. 530-534, 2012

Online since:

September 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.