In this paper, we propose a new efficient method for discovering 1-motifs in large time series data that can perform faster than Random Projection algorithm. The proposed method is based on hashing with three improvement techniques. Experimental results on several benchmark datasets show that our proposed method can discover precise motifs with high accuracy and time efficiency on large time series data.
CITATION STYLE
Xuan, P. T., & Anh, D. T. (2018). An efficient hash-based method for time series motif discovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11248 LNAI, pp. 205–211). Springer Verlag. https://doi.org/10.1007/978-3-030-03014-8_17
Mendeley helps you to discover research relevant for your work.