Iterative Incremental Clustering of Time Series

  • Jessica Lin
  • Michail Vlachos
  • Eamonn Keogh
  • Dimitrios Gunopulos
Conference paper

DOI: 10.1007/978-3-540-24741-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)
Cite this paper as:
Lin J., Vlachos M., Keogh E., Gunopulos D. (2004) Iterative Incremental Clustering of Time Series. In: Bertino E. et al. (eds) Advances in Database Technology - EDBT 2004. EDBT 2004. Lecture Notes in Computer Science, vol 2992. Springer, Berlin, Heidelberg

Abstract

We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property of wavelets. The dilemma of choosing the initial centers is mitigated by initializing the centers at each approximation level, using the final centers returned by the coarser representations. In addition to casting the clustering algorithms as anytime algorithms, this approach has two other very desirable properties. By working at lower dimensionalities we can efficiently avoid local minima. Therefore, the quality of the clustering is usually better than the batch algorithm. In addition, even if the algorithm is run to completion, our approach is much faster than its batch counterpart. We explain, and empirically demonstrate these surprising and desirable properties with comprehensive experiments on several publicly available real data sets. We further demonstrate that our approach can be generalized to a framework of much broader range of algorithms or data mining problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jessica Lin
    • 1
  • Michail Vlachos
    • 1
  • Eamonn Keogh
    • 1
  • Dimitrios Gunopulos
    • 1
  1. 1.Computer Science & Engineering DepartmentUniversity of California, RiversideRiverside

Personalised recommendations