Name
Abstract | ||
|---|---|---|
Most available motif discovery algorithms in real-valued time series find approximately recurring patterns of a known length without any prior information about their locations or shapes. In this paper, a new motif discovery algorithm is proposed that has the advantage of requiring no upper limit on the motif length. The proposed algorithm can discover multiple motifs of multiple lengths at once, and can achieve a better accuracy-speed balance compared with a recently proposed motif discovery algorithm. We then briefly report two successful applications of the proposed algorithm to gesture discovery and robot motion pattern discovery. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31087-4_44 | IEA/AIE |
Keywords | Field | DocType |
gesture discovery,greedy stem extension,new motif discovery algorithm,available motif discovery algorithm,multiple length,robot motion pattern discovery,motif length,motif discovery algorithm,multiple motif,proposed algorithm,known length | Data mining,Computer science,Gesture,Algorithm,Motif (music),Robot motion | Conference |
Citations | PageRank | References |
7 | 0.48 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasser Mohammad | 1 | 9 | 1.27 |
| Yoshimasa Ohmoto | 2 | 63 | 17.13 |
| Toyoaki Nishida | 3 | 1097 | 196.19 |