@inproceedings{f27448a873ed4a60bbb5059c7f0109f8,
title = "Finding time series motifs based on cloud model",
abstract = "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.",
keywords = "Cloud Model, K-motifs, Time Series Motifs",
author = "Hehua Chi and Shuliang Wang",
year = "2013",
doi = "10.1109/GrC.2013.6740383",
language = "English",
isbn = "9781479912810",
series = "Proceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013",
publisher = "IEEE Computer Society",
pages = "70--75",
booktitle = "Proceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013",
address = "United States",
note = "2013 IEEE International Conference on Granular Computing, GrC 2013 ; Conference date: 13-12-2013 Through 15-12-2013",
}