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...

Full description

Bibliographic Details
Main Author: Jerzy Korzeniewski
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
id doaj-7c525cf57b894617b6348defd8f84753
record_format Article
spelling doaj-7c525cf57b894617b6348defd8f847532020-11-25T00:45:56ZengLodz University PressActa Universitatis Lodziensis. Folia Oeconomica0208-60182019-07-012341435010.18778/0208-6018.341.032587Abridged Symbolic Representation of Time Series for ClusteringJerzy Korzeniewski0Uniwersytet ŁódzkiIn 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.https://czasopisma.uni.lodz.pl/foe/article/view/2587clusteringtime seriessymbolic representationdata mining
collection DOAJ
language English
format Article
sources DOAJ
author Jerzy Korzeniewski
spellingShingle Jerzy Korzeniewski
Abridged Symbolic Representation of Time Series for Clustering
Acta Universitatis Lodziensis. Folia Oeconomica
clustering
time series
symbolic representation
data mining
author_facet Jerzy Korzeniewski
author_sort Jerzy Korzeniewski
title Abridged Symbolic Representation of Time Series for Clustering
title_short Abridged Symbolic Representation of Time Series for Clustering
title_full Abridged Symbolic Representation of Time Series for Clustering
title_fullStr Abridged Symbolic Representation of Time Series for Clustering
title_full_unstemmed Abridged Symbolic Representation of Time Series for Clustering
title_sort abridged symbolic representation of time series for clustering
publisher Lodz University Press
series Acta Universitatis Lodziensis. Folia Oeconomica
issn 0208-6018
publishDate 2019-07-01
description 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.
topic clustering
time series
symbolic representation
data mining
url https://czasopisma.uni.lodz.pl/foe/article/view/2587
work_keys_str_mv AT jerzykorzeniewski abridgedsymbolicrepresentationoftimeseriesforclustering
_version_ 1725267960900091904