Time series classification has become one of the most prevalent time series mining tasks. There has also been extensively demonstrated in a variety of domains that other non-time series data can also be transformed into time series data. However, time series data are often large and occasionally contain noise and outliers. Therefore, there have been numerous efforts to resolve the problem by reducing the dimensionality of the data or coming up with new data representations. In this work, we propose a very simple approach to reduce the dimensionality of the data and to significantly speed up time series classification without sacrificing classification accuracy. Our experiment results show that our new additive representation could achieve better classification accuracy in most datasets when compared to the popular SAX symbolic representation and also has better accuracy in more than half of the datasets when compared with the full dataset classification. Our proposed representation also has higher average compression ratio that of SAX, giving our representation a competitive choice when dimensionality reduction is needed.
[1]
Christos Faloutsos,et al.
Fast Time Sequence Indexing for Arbitrary Lp Norms
,
2000,
VLDB.
[2]
James D. Hamilton.
Time Series Analysis
,
1994
.
[3]
Eamonn J. Keogh,et al.
A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
,
2005,
PAKDD.
[4]
Aminata Kane.
Trend and Value Based Time Series Representation for Similarity Search
,
2017,
2017 IEEE Third International Conference on Multimedia Big Data (BigMM).
[5]
Yuan Li,et al.
Rotation-invariant similarity in time series using bag-of-patterns representation
,
2012,
Journal of Intelligent Information Systems.
[6]
Li Wei,et al.
Experiencing SAX: a novel symbolic representation of time series
,
2007,
Data Mining and Knowledge Discovery.
[7]
Eamonn J. Keogh,et al.
Locally adaptive dimensionality reduction for indexing large time series databases
,
2001,
SIGMOD '01.