SAX Discretization Does Not Guarantee Equiprobable Symbols
Authors:
- 18 December 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 27 (4) , 1162-1166
Abstract
In time series analysis research, there is a strong interest in discrete representations of real valued data streams. One approach still considered state-of-the-art is the Symbolic Aggregate Approximation (SAX) algorithm. The interest of this paper concerns the SAX assumption of data being highly Gaussian and the use of the standard normal curve to choose partitions to discretize the data. The SAX approach chooses partitions on the standard normal curve that would produce an equal probability for each symbol. This procedure is generally valid as a time series is normalized to have μ = 0 and σ = 1. However, there exists a caveat to this assumption of equi-probability due to the intermediate step of Piecewise Aggregate Approximation (PAA). We show in this paper that when PAA is applied, the distribution of the data is altered, resulting in a shrinking standard deviation that is proportional to the number of points used to create a segment of the PAA representation and the degree of auto-correlation within the series. Data that exhibits statistically significant auto-correlation is less affected by this shrinking distribution. As the standard deviation of the data contracts, the mean remains the same, however the distribution is no longer standard normal and therefore the partitions based on the standard normal curve are no longer valid for the assumption of equal probability.Keywords
This publication has 7 references indexed in Scilit:
- Pattern Recognition in Time Series2012
- Time Discretisation Applied to Anomaly Detection in a Marine Engine2007
- Experiencing SAX: a novel symbolic representation of time seriesData Mining and Knowledge Discovery, 2007
- Escalation: Complex Event Detection in Wireless Sensor NetworksLecture Notes in Computer Science, 2007
- Probabilistic discovery of time series motifs2003
- Discover Motifs in Multi-dimensional Time-Series Using the Principal Component Analysis and the MDL Principle2003
- Speeding up two string-matching algorithmsAlgorithmica, 1994