A Bit Level Representation for Time Series Data Mining with Shape Based Similarity

Anthony J. Bagnall, Chotirat Ratanamahatan, Eamonn Keogh, Stefano Lonardi, Gareth J. Janacek

Research output: Contribution to journalArticlepeer-review

59 Citations (Scopus)

Abstract

Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clipping is a useful and flexible transformation for the exploratory analysis of large time dependent data sets. We demonstrate how time series stored as bits can be very efficiently compressed and manipulated and that, under some assumptions, the discriminatory power with clipped series is asymptotically equivalent to that achieved with the raw data. Unlike other transformations, clipped series can be compared directly to the raw data series. We show that this means we can form a tight lower bounding metric for Euclidean and Dynamic Time Warping distance and hence efficiently query by content. Clipped data can be used in conjunction with a host of algorithms and statistical tests that naturally follow from the binary nature of the data. A series of experiments illustrate how clipped series can be used in increasingly complex ways to achieve better results than other popular representations. The usefulness of the proposed representation is demonstrated by the fact that the results with clipped data are consistently better than those achieved with a Wavelet or Discrete Fourier Transformation at the same compression ratio for both clustering and query by content. The flexibility of the representation is shown by the fact that we can take advantage of a variable Run Length Encoding of clipped series to define an approximation of the Kolmogorov complexity and hence perform Kolmogorov based clustering.
Original languageEnglish
Pages (from-to)11-40
Number of pages30
JournalData Mining and Knowledge Discovery
Volume13
Issue number1
DOIs
Publication statusPublished - 2006

Cite this