ABBA: adaptive Brownian bridge-based symbolic aggregation of time series
From MaRDI portal
(Redirected from Publication:2194039)
Abstract: A new symbolic representation of time series, called ABBA, is introduced. It is based on an adaptive polygonal chain approximation of the time series into a sequence of tuples, followed by a mean-based clustering to obtain the symbolic representation. We show that the reconstruction error of this representation can be modelled as a random walk with pinned start and end points, a so-called Brownian bridge. This insight allows us to make ABBA essentially parameter-free, except for the approximation tolerance which must be chosen. Extensive comparisons with the SAX and 1d-SAX representations are included in the form of performance profiles, showing that ABBA is able to better preserve the essential shape information of time series compared to other approaches. Advantages and applications of ABBA are discussed, including its in-built differencing property and use for anomaly detection, and Python implementations provided.
Recommendations
Cites work
- A review on distance based time series classification
- A Space-Economical Suffix Tree Construction Algorithm
- Benchmarking optimization software with performance profiles.
- Detection of change in persistence of a linear time series
- scientific article; zbMATH DE number 5506203 (Why is no real title available?)
- Learning a symbolic representation for multivariate time series classification
- MODL: a Bayes optimal discretization method for continuous attributes
- Scikit-learn: machine learning in Python
Cited in
(2)
This page was built for publication: ABBA: adaptive Brownian bridge-based symbolic aggregation of time series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194039)