Improving U-shapelets Clustering Performance: An Shapelets Quality Optimizing Method

Si-yue Yu, Qiuyan Yan, Xinming Yan
{"title":"Improving U-shapelets Clustering Performance: An Shapelets Quality Optimizing Method","authors":"Si-yue Yu, Qiuyan Yan, Xinming Yan","doi":"10.14257/ijhit.2017.10.4.03","DOIUrl":null,"url":null,"abstract":"Unsupervised shapelets (u-shapelets) are time series subsequences that can best separates between time series coming from different clusters of data set without label. Because of the high computational cost, the u-shapelets are prohibited for many large dataset. Nevertheless, almost all of the current methods try to improving the u-shapelets based clustering method through reducing the computation time of u-shapelets candidate set. In this paper, we proposed a novel method improving efficiency of u-shapelets in terms of improving the u-shapelets quality. There are three contributions in our work: firstly, we show that by using internal evaluation measure instead gap score can improve quality of u-shapelets. Secondly, a novel method was proposed that applying diversified top-k query technology to filter similar u-shapelets, especially selecting the k most representative u-shapelets on the entirely shapelets candidates. Lastly, extensive experimental results show that combining internal evaluation measure and diversified top-k u-shapelets technology, our proposed method outperforms not only u-shapelet based methods, but also typical time series clustering approaches.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Hybrid Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/ijhit.2017.10.4.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Unsupervised shapelets (u-shapelets) are time series subsequences that can best separates between time series coming from different clusters of data set without label. Because of the high computational cost, the u-shapelets are prohibited for many large dataset. Nevertheless, almost all of the current methods try to improving the u-shapelets based clustering method through reducing the computation time of u-shapelets candidate set. In this paper, we proposed a novel method improving efficiency of u-shapelets in terms of improving the u-shapelets quality. There are three contributions in our work: firstly, we show that by using internal evaluation measure instead gap score can improve quality of u-shapelets. Secondly, a novel method was proposed that applying diversified top-k query technology to filter similar u-shapelets, especially selecting the k most representative u-shapelets on the entirely shapelets candidates. Lastly, extensive experimental results show that combining internal evaluation measure and diversified top-k u-shapelets technology, our proposed method outperforms not only u-shapelet based methods, but also typical time series clustering approaches.
提高U-shapelets聚类性能:一种Shapelets质量优化方法
无监督shapelets (u-shapelets)是一种时间序列子序列,它可以最好地分离来自不同数据集的时间序列。由于计算成本高,许多大型数据集都禁止使用u形集。然而,目前几乎所有的方法都试图通过减少u-shapelets候选集的计算时间来改进基于u-shapelets的聚类方法。本文从提高u形片质量的角度出发,提出了一种提高u形片效率的新方法。本文的工作有三个贡献:首先,我们证明了用内部评价度量代替间隙评分可以提高u形球的质量。其次,提出了一种应用多样化top-k查询技术过滤相似u-shapelets的新方法,特别是在完整的候选shapelets上选择k个最具代表性的u-shapelets;最后,大量的实验结果表明,结合内部评价测度和多样化top-k u-shapelets技术,我们提出的方法不仅优于基于u-shapelets的方法,而且优于典型的时间序列聚类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信