Abstract
Although k-means clustering is often applied to time series clustering, the underlying Euclidean distance measure is very restrictive in comparison to the human perception of time series. A time series and its translated copy appear dissimilar under the Euclidean distance (because the comparison is made pointwise), whereas a human would perceive both series as similar. As the human perception is tolerant to translational effects, using the cross correlation distance would be a better choice than Euclidean distance. We show how to modify a k-means variant such that it operates correctly with the cross correlation distance. The resulting algorithm may also be used for meaningful clustering of time series subsequences, which delivers meaningless results in case of Euclidean or Pearson distance.
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
Asuncion, A., Newman, D.: UCI machine learning repository (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Berthold, M.R., Höppner, F.: On clustering time series using euclidean distance and pearson correlation. Technical report, University of Konstanz (2008)
Bezdek, J.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)
Bezdek, J., Keller, J., Krishnapuram, R., Pal, N.: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. Kluwer, Boston (1999)
Chen, J.R.: Useful clustering outcomes from meaningful time series clustering. In: AusDM 2007: Proceedings of the sixth Australasian conference on Data mining and analytics, Darlinghurst, Australia, pp. 101–109. Australian Computer Society, Inc. (2007)
Das, G., Lin, K.-I., Mannila, H., Renganathan, G., Smyth, P.: Rule discovery from time series. In: Proc. of the 4th ACM SIGKDD Int. Conf. on Knowl. Discovery and Data Mining, pp. 16–22. AAAI Press, Menlo Park (1998)
Davé, R.: Characterization and detection of noise in clustering. Pattern Recognition Letters 12, 657–664 (1991)
Georgieva, O., Klawonn, F.: Dynamic data assigning assessment clustering of streaming data. Applied Soft Computing 8, 1305–1313 (2008)
Höppner, F.: Time series abstraction methods – a survey. In: Proceedings GI Jahrestagung Informatik, Workshop on Knowl. Discovery in Databases, Dortmund, Germany, September 2002. Lecture Notes in Informatics, pp. 777–786 (2002)
Höppner, F., Klawonn, F., Kruse, R., Runkler, T.: Fuzzy cluster analysis. Wiley, Chichester (1999)
Idé, T.: Why does subsequence time-series clustering produce sine waves? In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 211–222. Springer, Heidelberg (2006)
Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: A survey and empirical demonstration. Data Mining and Knowledge Discovery 7(4), 349–371 (2003)
Keogh, E., Lin, J., Truppel, W.: Clustering of time series subsequences is meaningless: implications for previous and future research. In: Proc. IEEE Int. Conf. on Data Mining (ICDM), pp. 115–122 (2003)
Keogh, E., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR time series classification/clustering homepage (2006), www.cs.ucr.edu/~eamonn/time_series_data/
Klawonn, F.: Fuzzy clustering: Insights and a new approach. Mathware and Soft Computing 11, 125–142 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Höppner, F., Klawonn, F. (2009). Compensation of Translational Displacement in Time Series Clustering Using Cross Correlation. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, JF. (eds) Advances in Intelligent Data Analysis VIII. IDA 2009. Lecture Notes in Computer Science, vol 5772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03915-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03915-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03914-0
Online ISBN: 978-3-642-03915-7
eBook Packages: Computer ScienceComputer Science (R0)