Abstract
Time series motif is a previously unknown pattern appearing frequently in a time series. An efficient motif discovery algorithm for time series would be useful as a tool for summarizing massive time series databases as well as many other advanced time series data mining tasks. In this paper, we propose a new efficient algorithm, called EP-BIRCH, for finding motifs in large time series datasets. This algorithm is more efficient than MK algorithm and stable to the changes of input parameters and these parameters are easy to be determined through experiments. The instances of a discovered motif may be of different lengths and user does not have to predefine the length of the motif.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: Proc. of 9th Int. Conf. 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: Proc. of 10th International Workshop on Frontiers in Hand Writing Recognition (2006)
Li, Y., Lin, J.: Approximate Variable-Length Time Series Motif Discovery Using Grammar Inference. In: Proceedings of the Tenth International Workshop on Multimedia Data Mining, Washington, D.C (July 25, 2010)
Lin, J., Keogh, E., Patel, P. and Lonardi, S.: Finding Motifs in Time Series. In: Proceedings of the 2nd Workshop on Temporal Data Mining, at the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)
Liu, Z., Yu, J.X., Lin, X., Lu, H., Wang, W.: Locating Motifs in Time-Series Data. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 343–353. Springer, Heidelberg (2005)
Mueen, A., Keogh, E., Zhu, Q., Cash, S., Westover, B.: Exact Discovery of Time Series Motif. In: Proc. of 2009 SIAM International Conference on Data Mining, pp. 1–12 (2009)
Patel, P., Keogh, E., Lin, J., Lonardi, S.: Mining motifs in massive time series databases. In: Proc. of IEEE Int. Conf. on Data Mining, pp. 370–377 (2002)
Pratt, K.B., Fink, E.: Search for patterns in compressed time series. International Journal of Image and Graphics 2(1), 89–106 (2002)
Tang, H., Liao, S.: Discovering Original Motifs with Different Lengths from Time Series. Knowledge-based Systems 21(7), 666–671 (2008)
Tanaka, Y., Iwamoto, K., Uehara, K.: Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle. Machine Learning 58(2-3), 269–300 (2005)
Tin, H.: N: Time Series Motif Discovery based on Important Extreme Points, Master Thesis, Faculty of Computer Science and Engineering, Ho Chi Minh University of Technology, Vietnam (July 2012)
Yankov, D., Keogh, E., Medina, J., Chiu, B., Zordan, V.: Detecting Time Series Motifs Under Uniform Scaling. In: Proc. of 13th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2007), pp. 844–853 (2007)
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. SIGMOD Rec. 25(2), 103–114 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Truong, C.D., Anh, D.T. (2013). An Efficient Method for Discovering Motifs in Large Time Series. In: Selamat, A., Nguyen, N.T., Haron, H. (eds) Intelligent Information and Database Systems. ACIIDS 2013. Lecture Notes in Computer Science(), vol 7802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36546-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-36546-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36545-4
Online ISBN: 978-3-642-36546-1
eBook Packages: Computer ScienceComputer Science (R0)