Optimization-Assisting Dual-Step Clustering of Time Series Data

Optimization-Assisting Dual-Step Clustering of Time Series Data

Tallapelli Rajesh, M Seetha
Copyright: © 2022 |Pages: 18
DOI: 10.4018/IJDST.313632
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper aims to propose a new time series data clustering with the following steps: (1) data reduction and (2) clustering. The main objective of the time series data clustering is to minimize the dataset size via a prototype defined for same time series data in every group that significantly reduced the complexities. Initially, the time series dataset in the data reduction step is subjected to preprocessing process. Further, in the proposed probability based distance measure evaluation, the time series data is grouped into subclusters. In the clustering step, the proposed shape based similarity measure is performed. Moreover, the clustering process is carried out by optimized k-mean clustering in which the center point is optimally tuned by a new customized whale optimization algorithm (CWOA). At last, the performance of the adopted model is computed to other traditional models with respect to various measures such as sensitivity, accuracy, FPR, conentropy, precision, FNR, specificity, MCC, entropy, F-measure, and Rand index, respectively.
Article Preview
Top

1. Introduction

One of the most important problems in unsupervised learning is clustering. In the clustering process, the summary generation and the exploratory data are the advantages of time series data (Keshavarzi, et al., 2020). This clustering process is also considered to be the pre-processing step in the part of complex systems or in other time-series mining task (Majumdar & Laha, 2020). In static data, the problems that occurred in the process of clustering is studied (for the past 60 years), and some algorithms are considered as the classic to those problems (Ruiz, et al., 2020; Crnkić, et al., 2020; Johnpaul, et al., 2020). Moreover, the clustering method in time series sequences and the clustering of conventional data points are not equal. An unsupervised clustering process includes the two major aspects, such as the appropriate selection of distance measures and the right number of clusters. The initial step in the clustering process is formed by selecting the appropriate distance measures (Du, et al., 2020; Putri, et al., 2019). The distance-based clustering takes more time for clustering only when the sequences get increased. The performance of the clustering process is improved to a small extent based on the uses of different dimensionality reduction methods. Apart from the numerical values, the structure of clustering will highlight the development of time series sequences that assist in fast clustering and reduced dimensionality (Pinto, et al., 2019; Bhaskaran, et al., 2020).

Certain dimensionality reduction techniques such as wavelets, Principal Component Analysis (PCA), etc., were used in time series data clustering The clustering aids in understanding the presence of similar time series sequences (Kamalzadeh, et al., 2020; Li & Wei, 2020). The clustering process of time series data is used in numerous applications like intervention analysis, recognizing significant data points, pattern recognition with the time period, classification of new time series sequences, decision making, etc. (Delforge, et al., 2020; Sun, et al., 2020). The time-series data clustering is classified into three processes as feature-based, model-based and shape-based (China, 2016; Indhumathi & Mohana, 2013; Mohana, 2020). Furthermore, the probabilistic framework is provided by the Bayesian clustering (Devagnanam & Elango, 2020) process that calculates the fit among the model and a dataset with the benefits of prior information (Ribeiro & Rios, 2020; Mahmoudi, et al., 2020; Li, et al., 2020). In unlabeled data, clustering (Veeraiah & Krishna, 2018; Brajula & Praveena, 2018) is one of the descriptive data mining tasks in which the same structures are divided into clusters without any information regarding the definition of groups (Li, et al., 2019; Salgado, et al., 2017; Zhou, et al., 2018).

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 2 Issues (2023)
Volume 13: 8 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing