Two-stage time-series clustering approach under reducing time cost requirement

N. Manakova, V. Tkachenko
{"title":"Two-stage time-series clustering approach under reducing time cost requirement","authors":"N. Manakova, V. Tkachenko","doi":"10.1109/TCSET49122.2020.235513","DOIUrl":null,"url":null,"abstract":"Clustering is an essential task of unsupervised learning, which is valuable as a specific data mining tool and as an auxiliary stage of numerous highly demanded tasks, including recognizing structures, tuning of forecast parameters, detecting anomalies, and others. Significantly data-driven, especially of specific data such as time-series considered here, as well as with an impressive growth of the volume data, the computational cost becomes a vital critical issue. In the research presented, the authors developed a two-step approach to clustering based on the split of a massive dataset into two unequal parts under the control of the clusterability metric through the instance-based and feature-based combination of time-series clustering. The conducted experimental study on the well-known test data set confirmed the competitiveness of the proposed method under the conditions of the requirement to reduce time costs.","PeriodicalId":389689,"journal":{"name":"2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TCSET49122.2020.235513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Clustering is an essential task of unsupervised learning, which is valuable as a specific data mining tool and as an auxiliary stage of numerous highly demanded tasks, including recognizing structures, tuning of forecast parameters, detecting anomalies, and others. Significantly data-driven, especially of specific data such as time-series considered here, as well as with an impressive growth of the volume data, the computational cost becomes a vital critical issue. In the research presented, the authors developed a two-step approach to clustering based on the split of a massive dataset into two unequal parts under the control of the clusterability metric through the instance-based and feature-based combination of time-series clustering. The conducted experimental study on the well-known test data set confirmed the competitiveness of the proposed method under the conditions of the requirement to reduce time costs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
降低时间成本要求的两阶段时间序列聚类方法
聚类是无监督学习的一项基本任务,它是一种有价值的特定数据挖掘工具,也是许多高要求任务的辅助阶段,包括识别结构、调整预测参数、检测异常等。在数据驱动的情况下,特别是对于特定的数据,如本文所考虑的时间序列,以及随着数据量的惊人增长,计算成本成为一个至关重要的关键问题。在本文的研究中,作者通过基于实例和基于特征的时间序列聚类相结合,在可聚性度量的控制下,将大量数据集分成两个不相等的部分,提出了一种两步聚类方法。通过对已知测试数据集的实验研究,验证了所提方法在降低时间成本的要求下的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experience of Full-Wave Electromagnetic Modeling of RF Transducers for Acousto-Optic Modulator Six-port Reflectometer with Kalman Filter Processing of Sensor Signals Efficiency Evaluation of Single and Modular Cascade Machines Operation in Electric Vehicle The Method of Adaptive Radio Coverage Formation of Wireless Network Based on the Wi-Fi controller Face image barcodes by distributed cumulative histogram and clustering
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1