Skip to main content

A Likelihood Ratio Distance Measure for the Similarity Between the Fourier Transform of Time Series

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2005)

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

Included in the following conference series:

Abstract

Fast Fourier Transforms (FFTs) have been a popular transformation and compression technique in time series data mining since first being proposed for use in this context inĀ [1]. The Euclidean distance between coefficients has been the most commonly used distance metric with FFTs. However, on many problems it is not the best measure of similarity available. In this paper we describe an alternative distance measure based on the likelihood ratio statistic to test the hypothesis of difference between series. We compare the new distance measure to Euclidean distance on five types of data with varying levels of compression. We show that the likelihood ratio measure is better at discriminating between series from different models and grouping series from the same model.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol.Ā 730. Springer, Heidelberg (1993)

    Google ScholarĀ 

  2. Bagnall, A.J., Janacek, G.J.: Clustering time series from arma models with clipped data. In: Proceedings of 10th ACM KDD (2004)

    Google ScholarĀ 

  3. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: Proceedings of ACM SIGMOD Conference (1994)

    Google ScholarĀ 

  4. Janacek, G.J., Bagnall, A.J., Powell, M.: A likelihood ratio distance measure for the similarity between the fourier transform of time series. CMP-C05-01, UEA (2005)

    Google ScholarĀ 

  5. Kalpakis, K., Gada, D., Puttagunta, V.: Distance measures for effective clustering of ARIMA time-series. In: Proceedings of the ICDM (2001)

    Google ScholarĀ 

  6. Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: A survey and empirical demonstration. In: the Proceedings of 8th ACM KDD (2002)

    Google ScholarĀ 

  7. Morchen, F.: Time series feature extraction for data mining using DWT and DFT. Technical ReportĀ 3, Philipps-University, Marburg (2003)

    Google ScholarĀ 

  8. Povinelli, R., Johnson, M., Ye, J.: Time series classification using Gaussian mixture models of reconstructed phase spaces. IEEE T. KDE 16(6) (2004)

    Google ScholarĀ 

  9. Vlachos, M., Meet, C., Vagena, Z.: Identifying similarities, periodicities and bursts for online search queries. In: ACM SIGMOD ICMD (2004)

    Google ScholarĀ 

  10. Wu, Y., Agrawal, D., El Abbadi, A.: A comparison of DFT and DWT based similarity search in time-series databases. In: 9th ACM CIKM (2000)

    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

Janacek, G.J., Bagnall, A.J., Powell, M. (2005). A Likelihood Ratio Distance Measure for the Similarity Between the Fourier Transform of Time Series. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_85

Download citation

  • DOI: https://doi.org/10.1007/11430919_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26076-9

  • Online ISBN: 978-3-540-31935-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics