Abstract
Efficient online detection of similar patterns under arbitrary time scaling of a given time sequence is a challenging problem in the real-time application field of time series data mining. Some methods based on sliding window have been proposed. Although their ideas are simple and easy to realize, their computational loads are very expensive. Therefore, model based methods are proposed. Recently, the segmental semi-Markov model is introduced into the field of online series pattern detection. However, it can only detect the matching sequences with approximately equal length to that of the query pattern. In this paper, an improved segmental semi-Markov model, which can solve this challenging problem, is proposed. And it is successfully demonstrated on real data sets.
This research is supported partly by Science and Technology Project of Zhejiang (2006C21001).
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
Meek, C., Birmingham, W.: The Dangers of Parsimony in Query-By-Humming Applications. In: Proc. of International Symposium on Music Information Retrieval, Baltimore, USA, pp. 51–56 (2003)
Keogh, E., Palpanas, T., Zordan, V.B., Gunopulos, D., Cardle, M.: Indexing Large Human-Motion Databases. In: Proc. of 30th International Conference on Very Large Data Bases, Toronto, Canada, pp. 780–791 (2004)
Mandelbrot, B.: Fractals and Scaling in Finance: Discontinuity, Concentration, Risk. Springer, New York (2000)
Fu, A.W., Keogh, E., Lau, L.Y.H., Ratanamahatana, C.A.: Scaling and Time Warping in Time Series Querying. In: Proc. of the 31st VLDB, Trondheim, pp. 649–660 (2005)
Ferguson, J.D.: Variable Duration Models for Speech. In: Proc. Symposium on the Application of Hidden Markov Models to Text and Speech, pp. 143–179 (1980)
Ostendorf, M., Digalakis, V.V., Kimball, O.A.: From HMM’s to Segment Models: a Unified View of Stochastic Modeling for Speech Recognition. IEEE Transactions on Speech and Audio Processing 4(5), 360–378 (1996)
Ge, X.P., Smyth, P.: Deformable Markov Model Templates for Time-Series Pattern Matching. In: Proc. of the 6th ACM SIGKDD International Conference on Knowledge Discover and Data Mining, Boston, USA, pp. 81–90 (2000)
Ge, X.P., Smyth, P.: Hidden Markov Models for Endpooint Detection in Plasma Etch Processes. Technical Report, Dep. Of ICS, UCI. Available from http://citeser.nj.nec.com/
Jia, S., Qian, Y.T., Dai, G.: An Advance Segmental Semi-markov Model Based Online Series Pattern Detection. In: Proc. of the 17th International Conference on Pattern Recognition, Cambridge, UK, vol. 3, pp. 634–637 (2004)
Argyros, T., Ermopoulos, C.: Efficient Subsequence Matching in Time Series Databases under Time and Amplitude Transformations. In: Proc. of 3rd ICDM, USA, pp. 481–484 (2003)
Rabiner, L., Rosenberg, A., Levinson, S.: Considerations in Dynamic Time Warping Algorithms for Discrete Word Recognition. IEEE Transactions on Acoustics, Speech and Signal Processing 26(6), 575–582 (1978)
Baum, L.E., Petrie, T.: Statistical Inference for Probabilistic Functions of Finite State Markov Chains. Annals of Mathematical Statistics 37(6), 1554–1563 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ling, G., Qian, Y., Jia, S. (2006). Segmental Semi-Markov Model Based Online Series Pattern Detection Under Arbitrary Time Scaling. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_80
Download citation
DOI: https://doi.org/10.1007/11811305_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37025-3
Online ISBN: 978-3-540-37026-0
eBook Packages: Computer ScienceComputer Science (R0)