The Community for Technology Leaders
2008 Eighth IEEE International Conference on Data Mining (2008)
Dec. 15, 2008 to Dec. 19, 2008
ISSN: 1550-4786
ISBN: 978-0-7695-3502-9
pp: 941-946
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.
INDEX TERMS
sequential pattern mining, data stream mining
CITATION

L. F. Mendes, B. Ding and J. Han, "Stream Sequential Pattern Mining with Precise Error Bounds," 2008 Eighth IEEE International Conference on Data Mining(ICDM), vol. 00, no. , pp. 941-946, 2008.
doi:10.1109/ICDM.2008.154
97 ms
(Ver 3.3 (11022016))