基于粒度动态时间翘曲方法的时间序列聚类

Fusheng Yu, Keqiang Dong, Fei Chen, Yongke Jiang, Wenyi Zeng
{"title":"基于粒度动态时间翘曲方法的时间序列聚类","authors":"Fusheng Yu, Keqiang Dong, Fei Chen, Yongke Jiang, Wenyi Zeng","doi":"10.1109/GrC.2007.34","DOIUrl":null,"url":null,"abstract":"In this paper, a new method, named granular dynamic time warping is proposed. This method is based on the granular approach of information granulation and has the characteristics of dynamic time warping approach. Thus it can be used to cluster time series with different lengths on the granular level. To cluster time series, this method first builds the corresponding granular time series, and then does the clustering on the granular time series. With this method, higher efficiency will be achieved in clustering time series, which is a goal pursued in clustering of large amount of time series. We also illustrate the prior performance of the new method with experiments.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Clustering Time Series with Granular Dynamic Time Warping Method\",\"authors\":\"Fusheng Yu, Keqiang Dong, Fei Chen, Yongke Jiang, Wenyi Zeng\",\"doi\":\"10.1109/GrC.2007.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new method, named granular dynamic time warping is proposed. This method is based on the granular approach of information granulation and has the characteristics of dynamic time warping approach. Thus it can be used to cluster time series with different lengths on the granular level. To cluster time series, this method first builds the corresponding granular time series, and then does the clustering on the granular time series. With this method, higher efficiency will be achieved in clustering time series, which is a goal pursued in clustering of large amount of time series. We also illustrate the prior performance of the new method with experiments.\",\"PeriodicalId\":259430,\"journal\":{\"name\":\"2007 IEEE International Conference on Granular Computing (GRC 2007)\",\"volume\":\"24 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Granular Computing (GRC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GrC.2007.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Granular Computing (GRC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GrC.2007.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

本文提出了一种新的方法——颗粒动态时间规整。该方法基于信息粒化的颗粒化方法,具有动态时间规整方法的特点。因此,它可以用于在粒度级别上对不同长度的时间序列进行聚类。为了对时间序列进行聚类,该方法首先建立相应的粒度时间序列,然后对该粒度时间序列进行聚类。该方法可以提高时间序列聚类的效率,这是大量时间序列聚类所追求的目标。我们还通过实验说明了新方法的先验性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering Time Series with Granular Dynamic Time Warping Method
In this paper, a new method, named granular dynamic time warping is proposed. This method is based on the granular approach of information granulation and has the characteristics of dynamic time warping approach. Thus it can be used to cluster time series with different lengths on the granular level. To cluster time series, this method first builds the corresponding granular time series, and then does the clustering on the granular time series. With this method, higher efficiency will be achieved in clustering time series, which is a goal pursued in clustering of large amount of time series. We also illustrate the prior performance of the new method with experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信