Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Binh, D.X., Anh, D.T.: A suite of techniques to improve Random Projection in time series motif discovery. In: Proceedings of 2016 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation and Vision for Future, 7–9 November, Hanoi, Vietnam, pp. 13–16 (2016)
Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discover of time series motifs. In: Proceedings of 9th International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 493–498 (2003)
Gruber, C., Coduro, M., Sick, B.: Signature verification with dynamic RBF network and time series motifs. In: Proceedings of 10th International Workshop on Frontiers in Hand Writing Recognition (2006)
Keogh, E., et al.: The UCR Time Series Classification/Clustering. http://www.cs.ucr.edu/~eamonn/time_series_data/. Accessed 2017
Lin, J., Keogh, E., Patel, P., Lonardi, S.: Finding motifs in time series. In: Proceedings of 2nd Workshop on Temporal Data Mining, at the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)
Lin, J., Keogh, E., Lonardi, S., Chiu, B.: Symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, San Diego, CA, 13 June (2003)
Mueen, A., Keogh, E., Zhu, Q., Cash, S., Westover, B.: Exact discovery of time series motif. In: Proceedings of SIAM International Conference on Data Mining, pp. 1–12 (2009)
Tanaka, Y., Iwamoto, K., Uehara, K.: Discovery of time series motif from multi-dimensional data based on MDL principle. Mach. Learn. 58(2–3), 269–300 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Xuan, P.T., Anh, D.T. (2018). An Efficient Hash-Based Method for Time Series Motif Discovery. In: Kaenampornpan, M., Malaka, R., Nguyen, D., Schwind, N. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2018. Lecture Notes in Computer Science(), vol 11248. Springer, Cham. https://doi.org/10.1007/978-3-030-03014-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-03014-8_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03013-1
Online ISBN: 978-3-030-03014-8
eBook Packages: Computer ScienceComputer Science (R0)