Abstract
Finding similar time series in a time series database is one of the important problems in time series data mining. The time series which has the highest count of its similar time series within a range r in a time series database is called the 1-motif. The problem of time series motif discovery has attracted a lot of attention and is useful in many real world applications. However, most of the proposed methods so far use Euclidean distance to deal with this problem. In this work, we propose a fast method for time series motif discovery which uses Dynamic Time Warping distance, a better measure than Euclidean distance. Experimental results showed that our proposed motif discovery method performs very efficiently on large time serried datasets while brings out high accuracy.
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
Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., Keogh, E.: Querying and mining of time series data: experimental comparison of representations and distance measures. In: Proc. of 34th International Conference on Very Large Data Bases, VLDB (2008)
Itakura, F.: Minimum prediction residual principle applied to speech recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing 23, 67–72 (1975)
Keogh, E.: Exact indexing of Dynamic Time Warping. In: Proc. of 28th International Conference on Very Large Databases, VLDB (2002)
Keogh, E., Wei, L., Xi, X., Lee, S.H., Vlachos, M.: LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. In: Proc. of 32th International Conference on Very Large Data Bases, VLDB (2006)
Kim, S., Park, S., Chu, W.: An index-based approach for similarity search supporting time warping in large sequence databases. In: Proc. of 17th Int. Conf. on Data Engineering, ICDE (2001)
Lemire, D.: Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognition 42(9), 2169–2180 (2009)
Lin, J., Keogh, E., Patel, P., Lonardi, S.: Finding motifs in time series. In: Proc. of the 2nd Workshop on Temporal Data Mining, at the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD (2002)
Mueen, A., Keogh, E., Zhu, Q., Cash, S., Westover, B.: Exact discovery of time series motif. In: Proc. of 2009 SIAM Int. Conf. on Data Mining. SIAM (2009)
Rakthanmanon, T., et al.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proc. of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2012)
Ratanamahatana, C.A., Keogh, E.: Three myths about Dynamic Time Warping data mining. In: Proc. of 5th SIAM Int. Conf. on Data Mining, SDM (2005)
Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoustics, Speech, and Signal Proc. ASSP-26 (1978)
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)
Xi, X., Keogh, E., Li, W., Mafraneto, A.: Finding Motifs in a Database of Shapes. In: Proc. of 7th SIAM International Conference on Data Mining, SDM (2007)
Yi, B., Jagadish, H., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: Proc. of the 14th Int. Conf. on Data Engineering, ICDE (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Truong, C.D., Anh, D.T. (2015). A Fast Method for Motif Discovery in Large Time Series Database under Dynamic Time Warping. In: Nguyen, VH., Le, AC., Huynh, VN. (eds) Knowledge and Systems Engineering. Advances in Intelligent Systems and Computing, vol 326. Springer, Cham. https://doi.org/10.1007/978-3-319-11680-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-11680-8_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11679-2
Online ISBN: 978-3-319-11680-8
eBook Packages: EngineeringEngineering (R0)