Incremental Mining of Sequential Patterns over a Stream Sliding Window

Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns from data streams is almost focused on mining of patterns from stream of item-sequences, not stream of itemset-sequences. In this paper, we propose an efficient single-pass algorithm, called IncSPAM, to maintain the set of sequential patterns from itemset-sequence streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed IncSPAM algorithm is efficient for mining sequential patterns over data streams.

• Type: Conference
• Year: 2006
• Where: ICDM
• Authors: Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Lee
• Keywords: Data Mining, Data Streams, ICDM 2006, Mining Sequential Patterns, Sequential Patterns