时间序列数据的优化辅助双步聚类

IF 0.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Tallapelli Rajesh, M. Seetha
{"title":"时间序列数据的优化辅助双步聚类","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":"{\"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}","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

摘要

本文旨在提出一种新的时间序列数据聚类方法,包括以下步骤:(1)数据约简和(2)聚类。时间序列数据聚类的主要目标是通过为每组中的相同时间序列数据定义的原型来最小化数据集大小,从而显著降低复杂性。首先,对数据约简步骤中的时间序列数据集进行预处理。此外,在所提出的基于概率的距离测度评估中,时间序列数据被分组到子聚类中。在聚类步骤中,执行所提出的基于形状的相似性度量。此外,聚类过程是通过优化的k-均值聚类来执行的,其中通过新的定制鲸鱼优化算法(CWOA)对中心点进行优化调整。最后,分别计算了所采用的模型在灵敏度、准确度、FPR、Conentry、精密度、FNR、特异性、MCC、熵、F-测度和Rand指数等各种度量方面与其他传统模型的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization-Assisting Dual-Step Clustering of Time Series Data
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Distributed Systems and Technologies
International Journal of Distributed Systems and Technologies COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
1.60
自引率
9.10%
发文量
64
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信