Skip to main content
Springer Nature Link
Log in

Efficient matching of very complex time series

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

We propose a novel method (FANSEA) that performs very complex time series matching. The matching here includes comparison and alignment of time series, for diverse needs: diagnosis, clustering, retrieval, mining, etc. The complexity stands in the fact that the method is able to match quasi-periodic time series, that are eventually phase shifted, of different lengths, composed of different number of periods, characterized by local morphological changes and that might be shifted/scaled on the time/magnitude axis. This is the most complex case that can occur in time series matching. The efficiency stands in the fact that the newly developed FANSEA method produces alignments that are comparable to those of the previously published SEA method. However and as a result of data reduction, FANSEA consumes much less time and data; hence, allowing for faster matching and lower storage space. Basically, FANSEA is composed of two main steps: Data reduction by curve simplification of the time series traces and matching through exchange of extracted signatures between the time series under process. Due to the quasi-periodic nature of the electrocardiogram (ECG), the tests were conducted on records selected from the Massachusetts Institute of Technology-Beth Israel Hospital database (MIT-BIH). Numerically, the new method data reduction was up to 80 % and the time reduction was up to 95 %. Accordingly and among many possible applications, the new method is very suitable for searching, querying and mining of large time series databases.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Huang Y-P, Hsu C-C, Wang S-H (2007) Pattern recognition in time series database: a case study on financial database. Expert Syst Appl 33:199–205

    Article  Google Scholar 

  2. Devisscher M, De Baets B, Nopens I, Decruyenaere J, Benoit D (2008) Pattern discovery in intensive care data through sequence alignment of qualitative trends data: proof of concept on a diuresis data set. In: Proceedings of the ICML/UAI/COLT 2008 workshop on machine learning for health-care applications, 9 July 2008, Helsinki

  3. Tang L-A, Cui B, Li H, Miao G, Yang D, and Zhou X (2007) Effective variation management for pseudo periodical streams. In: SIGMOD conference’07, 11–14 June 2007, Beijing

  4. Potamias G, Dermon CR (2001) Patterning brain developmental events via the discovery of time-series coherences. In: 4th international conference “neural networks and expert systems in medicine and healthcare” NNESMED 2001, 20–22 June 2001, Milos Island

  5. Lijffijt J, Papapetrou P, Hollmén J, Athitsos V (2010) Benchmarking dynamic time warping for music retrieval. In: PETRA’10, 23–25 June 2010, Samos

  6. Ono K, Suzuki Y, Kawagoe K (2008) A music retrieval method based on distribution of feature segments. In: Tenth IEEE international symposium on multimedia, 15–17 Dec 2008, Berkely. doi:10.1109/ISM.2008.93

  7. Camarena-Ibarrola A, Chavez E (2011) Online music tracking with global alignment. Int J Mach Learn Cyber 2:147–156. doi:10.1007/s13042-011-0025-0

    Article  Google Scholar 

  8. Fassois SD, Sakellariou JS (2007) Time series methods for fault detection and identification in vibrating structures. Philos Trans Royal Soc Math Phys Eng Sci 365:411–448. doi:10.1098/rsta.2006.1929

    Article  MathSciNet  Google Scholar 

  9. Timuska M, Lipsettb M, Mechefskec CK (2008) Fault detection using transient machine signals. Mech Syst Signal Process 22:1724–1749

    Article  Google Scholar 

  10. Khatkhatea A, Guptaa S, Raya A, Patankarb R (2008) Anomaly detection in flexible mechanical couplings via symbolic time series analysis. J Sound Vib 311:608–622

    Article  Google Scholar 

  11. Xiao J-Z, Wang H-R, Yang X-C, Gao Z (2011) Multiple faults diagnosis in motion system based on SVM. Int J Mach Learn Cyber 2:49–54. doi:10.1007/s13042-011-0035-y

    Article  Google Scholar 

  12. Kruskal JB, Leiberman M (1983) The symmetric time warping algorithm: from continuous to discrete. In: Sankoff D, Kruskal JB (eds) Time warps, string edits and macromolecules, Addison-Wesley

  13. Boucheham B (2008) Matching of quasi-periodic time series patterns by exchange of block-sorting signatures. Pattern Recognit Lett (Elsevier) 29:501–514

    Article  Google Scholar 

  14. Gardenhire LW (1964) Redundancy reduction the key to adaptive telemetry. In: Proceedings of the national telemetry conference, June 1964, pp 1–16

  15. Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: Proceedings of the 4th international conference of foundations of data organization and algorithms, Chicago, 13–15 Oct 1993, pp 69–84

  16. Shatkay H, Zdonik S B (1996) Approximate queries and representations for large data sequences. In: Proceedings of the 4th international conference on data engineering, Washington, pp 536–545

  17. Chen L, Özsu MT (2003) Similarity based retrieval of time series data using multi-scale histograms. In: Computer sciences technical report, CS-2003-31, University of Waterloo, Waterloo, Sep 2003

  18. Bozkaya T, Yazdani N, Ozsoyoglu ZM (1997) Matching and indexing sequences of different lengths. In: Proceedings 6th international conference on information and knowledge management at CIKM 97, Las Vegas, 10–14 Nov 1997, pp 128–135

  19. Wagner RA, Fisher MJ (1974) The string to string correction problem. JACM 21(1):168–173

    Article  MATH  Google Scholar 

  20. Berndt DJ, Clifford J (1994) Using dynamic time warping to find patterns in time series. In: AAA-94 workshop on knowledge discovery in databases, Seattle, pp 359–370

  21. Zhu Y, Shasha D (2003) Warping indexes with envelope transforms for query by Humming. In: Proceedings ACM SIGMOD international conference on management of data, New York, pp 181–192

  22. Tuzcu V, Nas S (2005) Dynamic time warping as a novel tool in pattern recognition of ECG changes in heart rhythm disturbances. In: IEEE international conference on systems, man and cybernetics, Waikoloa, 10–12 Oct 2005, pp 182–185

  23. Keogh EJ, Ratanamahatana CA (2004) Exact indexing of dynamic time warping. Knowl Info Syst (Springer) 7(3):358–386

    Article  Google Scholar 

  24. Keogh E, Wei L, Xi X, Lee SH, Vlachos M (2006) LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures, VLDB

  25. Boucheham B (2007) ShaLTeRR: a contribution to short and long-term redundancy reduction in digital signals. Signal Process (Elsevier) 87(10):2336–2347

    Article  MATH  Google Scholar 

  26. Boucheham B (2010) Reduced data similarity-based matching for time series patterns alignment. Pattern Recogn Lett 31:629–638. doi:10.1016/j.patrec.2009.11.019

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank the anonymous referees for their efforts and time. Their comments and opinions greatly contributed to the enhancement of this work. This work was supported in part by the Algerian Ministry of Higher Education and Scientific Research through a CNEPRU Grant. This work is dedicated to the memory of my father, late Hocine Boucheham, who quit us on the 18th of November, 2011.

Author information

Authors and Affiliations

  1. Department of Informatics, University of Skikda, BP 26, Route El-Hadaek, 21000, Skikda, Algeria

    Bachir Boucheham

Authors
  1. Bachir Boucheham
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Bachir Boucheham.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boucheham, B. Efficient matching of very complex time series. Int. J. Mach. Learn. & Cyber. 4, 537–550 (2013). https://doi.org/10.1007/s13042-012-0117-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-012-0117-5

Keywords