{"title":"Optimization-Assisting Dual-Step Clustering of Time Series Data","authors":"Tallapelli Rajesh, M. Seetha","doi":"10.4018/ijdst.313632","DOIUrl":null,"url":null,"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.","PeriodicalId":43267,"journal":{"name":"International Journal of Distributed Systems and Technologies","volume":" ","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Distributed Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijdst.313632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
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.