Stream Sequential Pattern Mining with Precise Error Bounds

Luiz F. Mendes, Bolin Ding, and Jiawei Han

Abstract

Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recent years, emerging applications have introduced a new form of data called data stream. In a data stream, new elements are generated continuously. This poses additional constraints on the methods used for mining such data: memory usage is restricted, the infinitely flowing original dataset cannot be scanned multiple times, and current results should be available on demand.This paper introduces two effective methods for mining sequential patterns from data streams: the SS-BE method and the SS-MB method. The proposed methods break the stream into batches and only process each batch once. The two methods use different pruning strategies that restrict the memory usage but can still guarantee that all true sequential patterns are output at the end of any batch.

Details

Publication typeInproceedings
Published inProceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008)
Pages941-946
PublisherIEEE Computer Society
> Publications > Stream Sequential Pattern Mining with Precise Error Bounds