Finding time series motifs based on cloud model

Hehua Chi, Shuliang Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013
PublisherIEEE Computer Society
Pages70-75
Number of pages6
ISBN (Print)9781479912810
DOIs
Publication statusPublished - 2013
Event2013 IEEE International Conference on Granular Computing, GrC 2013 - Beijing, China
Duration: 13 Dec 201315 Dec 2013

Publication series

NameProceedings - 2013 IEEE International Conference on Granular Computing, GrC 2013

Conference

Conference2013 IEEE International Conference on Granular Computing, GrC 2013
Country/TerritoryChina
CityBeijing
Period13/12/1315/12/13

Keywords

  • Cloud Model
  • K-motifs
  • Time Series Motifs

Fingerprint

Dive into the research topics of 'Finding time series motifs based on cloud model'. Together they form a unique fingerprint.

Cite this