Abstract. In this paper, we present an approach, called PSP, for mining sequential patterns embedded in a database. Close to the problem of discovering association rules, mining sequential patterns requires handling time constraints. Originally introduced in 3], the issue is addressed by the GSP approach 10]. Our proposal resumes the general principles of GSP but it makes use of a di erent intermediary data structure which is proved to be more e cient than in GSP.
Accordingly, in earlier work REF , we proposed a new approach called PSP, Prefix-Tree for Sequential Patterns, which fully resumes the fundamental principles of GSP.
The PSP Approach for Mining Sequential Patterns
PKDD
Computer Science