Efficient algorithm for mining generalized sequential patterns.

An efficient algorithm for mining generalized sequence patterns is presented. The algorithm employs two ways for improving the efficiency. One is to find in advance the sequential patterns supported by each data sequence, thereby the time constraints are eliminated and a fast matching algorithm can be applied. The other is to compute the intersection of sequential patterns. Finally, a mining algorithm is given based on partitioning the database.