Affiliation:
1. The University of Manchester, Manchester, Greater Manchester, United Kingdom
Abstract
Symbolic representations are a useful tool for the dimension reduction of temporal data, allowing for the efficient storage of and information retrieval from time series. They can also enhance the training of machine learning algorithms on time series data through noise reduction and reduced sensitivity to hyperparameters. The adaptive Brownian bridge-based aggregation (ABBA) method is one such effective and robust symbolic representation, demonstrated to accurately capture important trends and shapes in time series. However, in its current form, the method struggles to process very large time series. Here, we present a new variant of the ABBA method, called fABBA. This variant utilizes a new aggregation approach tailored to the piecewise representation of time series. By replacing the k-means clustering used in ABBA with a sorting-based aggregation technique, and thereby avoiding repeated sum-of-squares error computations, the computational complexity is significantly reduced. In contrast to the original method, the new approach does not require the number of time series symbols to be specified in advance. Through extensive tests, we demonstrate that the new method significantly outperforms ABBA with a considerable reduction in runtime while also outperforming the popular SAX and 1d-SAX representations in terms of reconstruction accuracy. We further demonstrate that fABBA can compress other data types such as images.
Funder
The Alan Turing Institute under the EPSRC
Publisher
Association for Computing Machinery (ACM)
Reference56 articles.
1. Automatic subspace clustering of high dimensional data for data mining applications;Agrawal Rakesh;Proceedings of the ACM SIGMOD International Conference on Management of Data,1998
2. Unsupervised real-time anomaly detection for streaming data
3. David Arthur and Sergei Vassilvitskii. 2007. K-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1027–1035.
4. Anticipatory DTW for efficient similarity search in time series databases;Assent Ira;Proceedings of the VLDB Endowment,2009
5. Vineetha Bettaiah and Heggere S. Ranganath. 2014. An analysis of time series representation methods: Data mining applications perspective. In Proceedings of the 2014 ACM Southeast Regional Conference. ACM, 1–6.