Granular Sketch Based Uncertain Data Streams Pattern Mining

Abstract

AbstractUncertainty is inherent in data streams, and presents new challenges to data streams mining. For continuous arriving and large size of data streams, representations of uncertain time series data streams require significantly more space. Therefore, it is important to construct compressed representation for storing uncertain time series data. A granular sketch is designed to create hash-compressed storage and store granules. As the granular sketch may be saturated with the increasing of data streams, this paper presents an optimization strategy to delete the absolute sparse patterns. Based on the granular sketch, a sequential pattern mining algorithm is proposed for mining uncertain data streams. The experimental results illustrate the effectiveness of the pattern mining algorithm.Keywordsgranulationsketchpattern mininguncertain time series datadata streams