A hash-based algorithm for mining non-redundant asynchronous periodic patterns

Abstract

Periodic patterns occur in a wide variety of datasets like time series, temporal, spatiotemporal and biological datasets. Asynchronous periodic pattern mining discovers the patterns that appear significantly with strict periodicity in one or more subsequences called valid segments with tolerable disturbance between the valid segments. The state-of-the-art asynchronous periodic pattern mining algorithms proposed in the literature mine many redundant asynchronous periodic patterns. This paper proposes an algorithm to mine non-redundant asynchronous periodic patterns. It is a variation of a four-phase algorithm named SMCA. The proposed algorithm mines precise and concise set of non-redundant patterns whose number is in orders of magnitude smaller than that of previous methods. The proposed algorithm is explained using a hypothetical dataset and its performance is evaluated using three real data sets which are stock market data from Bombay Stock Exchange, Weather data from Cambridge University and Migratory Zebras' data from MoveBank.