Abstract
Variable length time series motif discovery has attracted great interest in the community of time series data mining due to its importance in many applications such as medicine, motion analysis and robotics studies. In this work, a simple yet efficient suffix array based variable length motif discovery is proposed using a symbolic representation of time. As motif discovery is performed in discrete, low-dimensional representation, the number of motifs discovered and their frequencies are partially influenced by the number of symbols used to represent the motifs. We experimented with 4 electrocardiogram data sets from a benchmark repository to investigate the effect of alphabet size on the quantity and the quality of motifs from the time series classification perspective. The finding indicates that our approach can find variable length motifs and the discovered motifs can be used in classification of data where frequent patterns are inherently known to exist.
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
Preview
Unable to display preview. Download preview PDF.
References
Das, G., Lin, K., Mannila, H.: Rule Discovery from Time Series. In: Proceedings of Fourth Int’l Conf. Knowledge Discovery and Data Mining, New York, NY, USA, pp. 16–22 (1998)
Phu, L., Anh, D.T.: Motif-Based Method for Initialization the K-Means, pp. 11–20 (2011)
Hegland, M., Clarke, W., Kahn, M.: Mining the MACHO dataset. Computer Physics Communications 142, 22–28 (2001)
Lin, J., Keogh, E., Lonardi, S.: Visualizing and discovering non-trivial patterns in large time series databases. Information Visualization 4, 61–82 (2005)
Li, Y., Lin, J., Oates, T.: Visualizing Variable-Length Time Series Motifs. In: Proceedings of the 2012 SIAM International Conference on Data Mining, Anaheim, CA, pp. 895–906 (2012)
Mueen, A.: Enumeration of Time Series Motifs of All Lengths. In: ICDM. IEEE (2013)
Ratanamahatana, C.A., Lin, J., Dimitrios, G., Keogh, E.J., Vlachos, M., Das, G.: Mining Time Series Data. In: The Data Mining and Knowledge Discovery Handbook, pp. 1069–1103 (2005)
Castro, N., Azevedo, P.: Significant Motifs in Time Series. Statistical Analysis and Data Mining 5(1), 35–53 (2012)
Buza, K., Schmidt-Thieme, L.: Motif-based Classification of Time Series with Bayesian Networks and SVMs. In: Fink, A., Lausen, B., Seidel, W., Ultsch, A. (eds.) Advances in Data Analysis, Data Handling and Business Intelligence, pp. 105–114 (2010)
Lin, J., Keogh, E., Wei, L., Lonardi, S.: Experiencing SAX: A Novel Symbolic Representation of Time Series. Data Mining and Knowledge Discovery 15, 107–144 (2007)
Chiu, B., Keogh, E., Lonardi, S.: Probabilistic Discovery of Time Series Motifs. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 493–498. ACM Press, New York (2003)
Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing 22, 935–948 (1993)
Ferragina, P., Fischer, J.: Suffix Arrays on Words. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 328–339. Springer, Heidelberg (2007)
Fischer, J.: Inducing the LCP-Array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374–385. Springer, Heidelberg (2011)
Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: The Enhanced Suffix Array and Its Applications to Genome Analysis. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 449–463. Springer, Heidelberg (2002)
Keogh, E., Zhu, Q., Hu, B., Hao, Y., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR Time Series Classification/Clustering Homepage, http://www.cs.ucr.edu/~eamonn/time_series_data/
Larsson, N.J., Sadakane, K.: Faster suffix sorting. Theoretical Computer Science 387, 258–272 (2007)
Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, M.S., Tangsripairoj, S., Pupacdi, B. (2014). Variable Length Motif-Based Time Series Classification. In: Boonkrong, S., Unger, H., Meesad, P. (eds) Recent Advances in Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 265. Springer, Cham. https://doi.org/10.1007/978-3-319-06538-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-06538-0_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06537-3
Online ISBN: 978-3-319-06538-0
eBook Packages: EngineeringEngineering (R0)