Finding time series motifs based on cloud model

Hehua Chi, Shuliang Wang

科研成果: 书/报告/会议事项章节会议稿件同行评审

1 引用 (Scopus)

摘要

The research of finding time series motifs has received much attention recently. In an earlier work, we proposed a relatively comprehensive definition of K-motifs to mine more frequent patterns from time series datasets. However, that work has not given a method to select a better K-motif when we encounter the situation that there are several candidate K-motifs. This paper addresses the problem by introducing a novel method inspired by the cloud model theory. Our method can represent qualitative concepts from the quantitative point of view based on the three numerical characteristics of the cloud model and select a better K-motif effectively and accurately. Finally, in order to demonstrate the feasibility of our method, we conduct several experiments. The results show that our method is feasible and effective.

源语言英语
主期刊名Proceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013
出版商IEEE Computer Society
70-75
页数6
ISBN(印刷版)9781479912810
DOI
出版状态已出版 - 2013
活动2013 IEEE International Conference on Granular Computing, GrC 2013 - Beijing, 中国
期限: 13 12月 201315 12月 2013

出版系列

姓名Proceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013

会议

会议2013 IEEE International Conference on Granular Computing, GrC 2013
国家/地区中国
Beijing
时期13/12/1315/12/13

指纹

探究 'Finding time series motifs based on cloud model' 的科研主题。它们共同构成独一无二的指纹。

引用此