Abridged Symbolic Representation of Time Series for Clustering
In recent years a couple of methods aimed at time series symbolic representation have been introduced or developed. This activity is mainly justified by practical considerations such memory savings or fast data base searching. However, some results suggest that in the subject of time series clusteri...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Lodz University Press
2019-07-01
|
| Series: | Acta Universitatis Lodziensis. Folia Oeconomica |
| Subjects: | |
| Online Access: | https://czasopisma.uni.lodz.pl/foe/article/view/2587 |
| Summary: | In recent years a couple of methods aimed at time series symbolic representation have been introduced or developed. This activity is mainly justified by practical considerations such memory savings or fast data base searching. However, some results suggest that in the subject of time series clustering symbolic representation can even upgrade the results of clustering. The article contains a proposal of a new algorithm directed at the task of time series abridged symbolic representation with the emphasis on efficient time series clustering. The idea of the proposal is based on the PAA (piecewise aggregate approximation) technique followed by segmentwise correlation analysis. The primary goal of the article is to upgrade the quality of the PAA technique with respect to possible time series clustering (its speed and quality). We also tried to answer the following questions. Is the task of time series clustering in their original form reasonable? How much memory can we save using the new algorithm? The efficiency of the new algorithm was investigated on empirical time series data sets. The results prove that the new proposal is quite effective with a very limited amount of parametric user interference needed. |
|---|---|
| ISSN: | 0208-6018 |