Skip to main content

Empirical Comparison of Clustering Methods for Long Time-Series Databases

  • Conference paper
Active Mining

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3430))

Abstract

In this paper we report some characteristics of time-series comparison methods and clustering methods found empirically using a real-world medical database. First, we examined basic characteristics of two sequence comparison methods, multiscale matching (MSM) and dynamic time warping (DTW), using a simple sine wave and its variants. Next, we examined the characteristics of various combinations of sequence comparison methods and clustering methods, in terms of interpretability of generating clusters, using a time-series medical database. Although the subjects for comparison were limited, the results demonstrated that (1) shape representation parameters in MSM could capture the structural feature of time series; for example, the difference of amplitude was successfully captured using rotation term, and that differences on phases and trends were also successfully reflected in the dissimilarity. (2) However, the dissimilarity induced by MSM lacks linearity compared with DTW. It was also demonstrated that (1) complete-linkage criterion (CL-AHC) outperforms average-linkage (AL-AHC) criterion in terms of the interpret-ability of a dendrogram and clustering results, (2) combination of DTW and CL-AHC constantly produced interpretable results, (3) combination of DTW and RC would be used to find core sequences of the clusters. MSM may suffer from the problem of ’no-match’ pairs, however, the problem may be eluded by using RC as a subsequent grouping method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Keogh, E.: Mining and Indexing Time Series Data. In: Tutorial at the 2001 IEEE International Conference on Data Mining (2001)

    Google Scholar 

  2. Chu, S., Keogh, E., Hart, D., Pazzani, M.: Iterative Deepening Dynamic Time Warping for Time Series. In: Proceedings of the second SIAM International Conference on Data Mining (2002)

    Google Scholar 

  3. Sankoff, D., Kruskal, J.: Time Warps, String Edits, and Macromolecules. CLSI Publications, Stanford (1999)

    MATH  Google Scholar 

  4. Hirano, S., Tsumoto, S.: Mining Similar Temporal Patterns in Long Time-series Data and Its Application to Medicine. In: Proceedings of the IEEE 2002 International Conference on Data Mining, pp. 219–226 (2002)

    Google Scholar 

  5. Ueda, N., Suzuki, S.: A Matching Algorithm of Deformed Planar Curves Using Multiscale Convex/Concave Structures. In: IEICE Transactions on Information and Systems, vol. J73-D-II(7), pp. 992–1000 (1990)

    Google Scholar 

  6. Mokhtarian, F., Mackworth, A.K.: Scale-based Description and Recognition of planar Curves and Two Dimensional Shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 8(1), 24–43 (1986)

    Google Scholar 

  7. http://lisp.vse.cz/challenge/ecmlpkdd2003/

  8. Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis, 4th edn. Arnold Publishers (2001)

    Google Scholar 

  9. Hirano, S., Tsumoto, S.: An Indiscernibility-based Clustering Method with Iterative Refinement of Equivalence Relations - Rough Clustering -. Journal of Advanced Computational Intelligence and Intelligent Informatics 7(2), 169–177 (2003)

    Google Scholar 

  10. Lowe, D.G.: Organization of Smooth Image Curves at Multiple Scales. International Journal of Computer Vision 3, 119–130 (1980)

    Article  Google Scholar 

  11. Pawlak, Z.: Rough Sets, Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  12. Witkin, A.P.: Scale-space Filtering. In: Proceedings of the Eighth IJCAI, pp. 1019–1022 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirano, S., Tsumoto, S. (2005). Empirical Comparison of Clustering Methods for Long Time-Series Databases. In: Tsumoto, S., Yamaguchi, T., Numao, M., Motoda, H. (eds) Active Mining. Lecture Notes in Computer Science(), vol 3430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423270_15

Download citation

  • DOI: https://doi.org/10.1007/11423270_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26157-5

  • Online ISBN: 978-3-540-31933-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics