Improved Models for Time Series Cluster Representation Based Dynamic Time Warping

Mina Younan, E. H. Houssein, M. Elhoseny, A. Ali
{"title":"Improved Models for Time Series Cluster Representation Based Dynamic Time Warping","authors":"Mina Younan, E. H. Houssein, M. Elhoseny, A. Ali","doi":"10.1109/ICCES51560.2020.9334608","DOIUrl":null,"url":null,"abstract":"Revolution of Smart Things (SThs) connected to the Internet to build Internet of Things (IoT) applications, causes a flood of data streams every moment. Main root causes of massive SThs integration for increasing accuracy of sensed features and for enabling fault tolerance. In general, resulting deluge of real-time data streams has the property of five V of the big data (i.e., volume, velocity, variety, veracity, and value). Such properties make mining and analysis of massive and heterogeneous data be challenging tasks. In our previous work, we present three novel data reduction models based on Dynamic Time Warping (DTW) for enabling balanced indexing in the IoT. This paper presents two extensions to improve the Hybrid algorithm (ClRe 3.0) using DTW warped path. First extension (ClRe 3.1): targets improving accuracy of indexed clusters representatives by taking the average of individual warped items and keeping only 50% of the warped items for each warped slot. Second extension (ClRe 3.2): targets decreasing size of indexed clusters representatives as possible by compensating every warped slot by its corresponding item keeping only common items with minimum distances. The proposed extensions are explained using real samples and evaluated using Szeged-weather dataset as well. The evaluation results proves that ClRe 3.1 could enhance the accuracy of ClRe 3.0 by approximate 9% in average, keeping indexes sizes as possible as fitted (i.e., < the average length of all datasets). In case of indexing only highly common readings, ClRe 3.2 out-performs other extensions in decreasing indexes sizes.","PeriodicalId":247183,"journal":{"name":"2020 15th International Conference on Computer Engineering and Systems (ICCES)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 15th International Conference on Computer Engineering and Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES51560.2020.9334608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Revolution of Smart Things (SThs) connected to the Internet to build Internet of Things (IoT) applications, causes a flood of data streams every moment. Main root causes of massive SThs integration for increasing accuracy of sensed features and for enabling fault tolerance. In general, resulting deluge of real-time data streams has the property of five V of the big data (i.e., volume, velocity, variety, veracity, and value). Such properties make mining and analysis of massive and heterogeneous data be challenging tasks. In our previous work, we present three novel data reduction models based on Dynamic Time Warping (DTW) for enabling balanced indexing in the IoT. This paper presents two extensions to improve the Hybrid algorithm (ClRe 3.0) using DTW warped path. First extension (ClRe 3.1): targets improving accuracy of indexed clusters representatives by taking the average of individual warped items and keeping only 50% of the warped items for each warped slot. Second extension (ClRe 3.2): targets decreasing size of indexed clusters representatives as possible by compensating every warped slot by its corresponding item keeping only common items with minimum distances. The proposed extensions are explained using real samples and evaluated using Szeged-weather dataset as well. The evaluation results proves that ClRe 3.1 could enhance the accuracy of ClRe 3.0 by approximate 9% in average, keeping indexes sizes as possible as fitted (i.e., < the average length of all datasets). In case of indexing only highly common readings, ClRe 3.2 out-performs other extensions in decreasing indexes sizes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于聚类表示的时间序列动态时间翘曲改进模型
智能物联网革命(SThs)连接到互联网构建物联网(IoT)应用,每时每刻都会产生大量数据流。这种集成的主要根本原因是为了提高感知特征的准确性和实现容错。总的来说,由此产生的海量实时数据流具有大数据的5v属性(即体积(volume)、速度(velocity)、种类(variety)、准确性(veracity)和价值(value))。这些特性使得挖掘和分析海量异构数据成为一项具有挑战性的任务。在我们之前的工作中,我们提出了三种基于动态时间翘曲(DTW)的新型数据缩减模型,用于实现物联网中的平衡索引。本文提出了利用DTW弯曲路径对混合算法(ClRe 3.0)进行改进的两个扩展。第一个扩展(ClRe 3.1):目标是通过取单个扭曲项的平均值来提高索引簇代表的准确性,并且每个扭曲槽只保留50%的扭曲项。第二个扩展(ClRe 3.2):通过补偿每个扭曲的槽来尽可能减少索引簇代表的大小,只保留距离最小的公共项。使用实际样本解释了所提出的扩展,并使用Szeged-weather数据集进行了评估。评价结果表明,ClRe 3.1在保持索引大小尽可能接近拟合(即小于所有数据集的平均长度)的情况下,平均能将ClRe 3.0的准确率提高约9%。在只索引非常常见的读数的情况下,ClRe 3.2在减少索引大小方面优于其他扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Proposed System for the Identification of Modem Arabic Poetry Meters (IMAP) Evaluating the Modsecurity Web Application Firewall Against SQL Injection Attacks Low-Power Low-Complexity FM-UWB Transmitter in 130nm CMOS for WBAN Applications Blade Angle Control Using TLBO Based Modified Adaptive Controller Clustering Research Papers Using Genetic Algorithm Optimized Self-Organizing Maps
×
引用
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