SSM : A Frequent Sequential Data Stream Patterns Miner
Document Type
Conference Paper
Publication Date
3-2007
Publication Title
2007 IEEE Symposium on Computational Intelligence and Data Mining
First Page
120
Last Page
126
Abstract
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering current and near accurate results on demand without full access to all historical stored data. Frequent sequential mining is the process of discovering frequent sequential patterns in data sequences as found in applications like Web log access sequences. Mining frequent sequential patterns on data stream applications contend with many challenges such as limited memory for unlimited data, inability of algorithms to scan infinitely flowing original dataset more than once and to deliver current and accurate result on demand. Existing work on mining frequent patterns on data streams are mostly for non-sequential patterns. This paper proposes SSM-algorithm (sequential stream mining-algorithm), that uses three types of data structures (D-List, PLWAP tree and FSP-tree) to handle the complexities of mining frequent sequential patterns in data streams. It summarizes frequency counts of items with the D-list, continuously builds PLWAP tree and mines frequent sequential patterns of batches of stream records, maintains mined frequent sequential patterns incrementally with FSP tree. The proposed algorithm can be deployed to analyze e-commerce data where the primary source of data is click stream data.
DOI
10.1109/CIDM.2007.368862
Recommended Citation
Ezeife, C. I. and Monwar, M.. (2007). SSM : A Frequent Sequential Data Stream Patterns Miner. 2007 IEEE Symposium on Computational Intelligence and Data Mining, 120-126.
https://scholar.uwindsor.ca/computersciencepub/29