A modified Kohonen map algorithm for clustering time series data

Jayanth Krishnan, K. and Mitra, Kishalay (2022) A modified Kohonen map algorithm for clustering time series data. Expert Systems with Applications, 201. pp. 1-17. ISSN 0957-4174

[img] Text
Expert_Systems_With_Applications.pdf - Published Version
Restricted to Repository staff only

Download (15MB) | Request a copy


Time Series clustering is a domain with several applications spanning various fields. The concept of vector quantization, popularly used in signal processing to approximate a large number of signals, can be used to cluster signals and thereby time series data. Though a popular clustering algorithm such as K-Means is capable of performing vector quantization, the averaging technique to compute centroids in the algorithm is not well suited to handle time series data. The ability of Self Organizing Map algorithm, has, therefore, been explored in this work to perform clustering of time series data by adopting several modifications in the original steps of the algorithm. By initializing the prototype vectors using a farthest neighbors’ approach instead of random initialization and using the dynamic time warping distance measure to calculate similarity between signals, a novel procedure has been proposed to apply the Self Organizing Map algorithm to cluster time series data. The proposed algorithm is first tested on 119 data sets and its performance is compared to that of Agglomerative Clustering and k medoids clustering using 3 validation measures. Next, their scalability is compared by looking at their time of computation on the data sets. Performance of the proposed algorithm in terms of the fluctuations involved due to initialization and the parameters of the algorithm are studied next using 3 more validation measures. The results showcase that the modified Self Organizing Map is not only a better algorithm than Agglomerative Clustering in terms of clustering performance, but also more scalable in terms of taking less time to compute clusters as it performs them in lesser time that k medoids while having similar cluster quality. © 2022 Elsevier Ltd

[error in script]
IITH Creators:
IITH CreatorsORCiD
Mitra, Kishalayhttp://orcid.org/0000-0001-5660-6878
Item Type: Article
Additional Information: Authors acknowledge the support provided by the National Super- computing Mission, Department of Science and Technology, Government of India [DST/NSM/R&D_HPC_Applications/2021/23] and Ministry of Human Resources Development (MHRD), Government of India [SPARC/2018-2019/P1084/SL] for this work.
Uncontrolled Keywords: Agglomerative clustering, Dynamic time warping, K medoids clustering, Self organizing map, Time series clustering, Vector quantization
Subjects: Chemical Engineering
Divisions: Department of Chemical Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 20 Jun 2022 04:46
Last Modified: 22 Jun 2022 08:38
URI: http://raiith.iith.ac.in/id/eprint/9312
Publisher URL: https://doi.org/10.1016/j.eswa.2022.117249
OA policy: https://v2.sherpa.ac.uk/id/publication/4628
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 9312 Statistics for this ePrint Item