Mining Sequential Patterns

Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-speci ed minimum support, where the support of a pattern is the number of data-sequences that contain the pattern. An example of a sequential pattern is 5 of customers bought `Foundation' and `Ringworld' in one transaction, followed by `Second Foundation' in a later transaction". We generalize the problem as follows. First, we add time constraints that specify a minimum and or maximum time period between adjacent elements in a pattern. Second, we relax the restriction that the items in an element of a sequential pattern must come from the same transaction, instead allowing the items to be present in a set of transactions whose transaction-times are within a user-speci ed t...

• Type: Conference
• Year: 1995
• Where: ICDE
• Authors: Rakesh Agrawal, Ramakrishnan Srikant
• Keywords: Database, Generalized Sequential Patterns, ICDE 1995, Mining Sequential Patterns, Sequential Patterns