Skip to main content

Optimal Filtering for Time Series Classification

  • Conference paper
  • First Online:
Intelligent Data Engineering and Automated Learning – IDEAL 2015 (IDEAL 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9375))

Abstract

The application of a (smoothing) filter is common practice in applications where time series are involved. The literature on time series similarity measures, however, seems to completely ignore the possibility of applying a filter first. In this paper, we investigate to what extent the benefit obtained by more complex distance measures may be achieved by simply applying a filter to the original series (while sticking to Euclidean distance). We propose two ways of deriving an optimized filter from classified time series to adopt the similarity measure to a given application. The empirical evaluation shows not only that in many cases a substantial fraction of the performance improvement can also be achieved by filtering, but also that for certain types of time series this simple approach outperforms more complex measures.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Only the artificial data can be shared: http://public.ostfalia.de/~hoeppnef/tsfilter.html.

References

  1. Berndt, D.J., Clifford, J.: Finding patterns in time series: a dynamic programming approach. In: Advances in Knowledge Discovery and Data Mining, pp. 229–248. MITP (1996)

    Google Scholar 

  2. Chen, L., Ng, R.: On the marriage of Lp-norms and edit distance. In: International Conference on Very Large Databases, pp. 792–803 (2004)

    Google Scholar 

  3. Chen, L., Özsu, M., Oria, V.: Robust and fast similarity search for moving object trajectories. In: Proceedings of ACM SIGMOD, pp. 491–502 (2005)

    Google Scholar 

  4. Höppner, F.: Less is more: similarity of time series under linear transformations. In: Proceedings of SIAM International Conference on Data Mining (SDM), pp. 560–568 (2014)

    Google Scholar 

  5. Jeong, Y.-S., Jeong, M.K., Omitaomu, O.A.: Weighted dynamic time warping for time series classification. Pattern Recogn. 44(9), 2231–2240 (2011)

    Article  Google Scholar 

  6. Keogh, E., Zhu, Q., Hu, B., Hao, Y., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR Time Series Classification/Clustering Homepage (2011)

    Google Scholar 

  7. Liao, W.T.: Clustering of time series data - a survey. Pattern Recogn. 38(11), 1857–1874 (2005)

    Article  MATH  Google Scholar 

  8. Serrà, J., Arcos, J.L.: An empirical evaluation of similarity measures for time series classification. Knowl. Based Syst. 67, 305–314 (2014)

    Article  Google Scholar 

  9. Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., Keogh, E.: Experimental comparison of representation methods and distance measures for time series data. Data Min. Knowl. Discov. 26(2), 275–309 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Höppner .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Höppner, F. (2015). Optimal Filtering for Time Series Classification. In: Jackowski, K., Burduk, R., Walkowiak, K., Wozniak, M., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2015. IDEAL 2015. Lecture Notes in Computer Science(), vol 9375. Springer, Cham. https://doi.org/10.1007/978-3-319-24834-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24834-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24833-2

  • Online ISBN: 978-3-319-24834-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics