Skip to main content
SpringerLink
Log in

Models of time series with time granulation

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Albeit simple and easy to interpret, a piecewise representation of time series comes with discontinuities that inevitably lead to substantial representation (approximation) error. In this study, we present models of time series with time granulation that reduce representation errors and subsequently give rise to the better approximation abilities and classification rates of classifiers of time series. The jumps (discontinuities) occurring because of the local piecewise representation of time series over disjoint time windows are eliminated due to the use of fuzzy sets describing overlapping time segments (temporal windows). We engage particle swarm optimization (PSO) as an optimization vehicle to minimize the representation error based on the adjustments of the length of the segments and the degree of overlap among membership functions of the temporal windows. We also consider PSO to minimize the classification error of classifiers of time series. In a series of experiments, we consider two commonly used piecewise techniques of approximation of time series such as piecewise aggregate approximation (PAA) and piecewise linear representation (PLR). The results demonstrate that PLR models produce lower approximation errors in comparison with those obtained for the PAA representation and quantify an impact of fuzzy temporal segmentation on the overall quality of the model. Results of comprehensive comparative studies are provided as well.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Agrawal R, Faloutsos C, Swami A (1993) Efficient similarity search in sequence databases. In: Proceedings of the fourth international conference on foundations of data organization and algorithms, pp 69–84

  2. Aznarte JL, Benitez JM (2010) Equivalences between neural-autoregressive time series models and fuzzy systems. IEEE Trans Fuzzy Syst 21(9):1434–1444

    Google Scholar 

  3. Abonyi J, Feil B, Nemeth S, Arva P (2005) Modified Gath–Geva clustering for fuzzy segmentation of multivariate time-series. Fuzzy Sets Syst 149:39–56

    Article  MathSciNet  MATH  Google Scholar 

  4. Fu TC (2011) A review on time series data mining. Eng Appl Artif Intell 24:164–181

    Article  Google Scholar 

  5. Kasabov NK, Song Q (2002) DENFIS: dynamic evolving neural-fuzzy inference system and its application for time series prediction. IEEE Trans Fuzzy Syst 10(2):144–154

    Article  Google Scholar 

  6. Keogh E, Pazzani M (2002) A simple dimensionality reduction technique for fast similarity search in large time series databases. In: proceedings of the 4th Pacific–Asia conference on knowledge discovery and data mining, pp 122–133

  7. Yang Y, Chen K (2011) Time-series clustering via RPCL network ensemble with different representations. IEEE Trans Syst Man Cybern C Appl Rev 41(2):190–199

    Article  Google Scholar 

  8. Chan K, Fu A (1999) Efficient time series matching by wavelets. In: Proceedings of 15th international conference on data engineering, pp 126–133

  9. Chen Q, Chen L, Lian X, Liu Y (2007) Indexable PLA for efficient similarity search. In: Proceedings of 33rd international conference on very large data bases, pp 435–446

  10. Lin J, Keogh E, Wei L, Lonardi S (2007) Experiencing SAX: a novel symbolic representation of time series. Data Min Knowl Disc 15(2):107–144

    Article  MathSciNet  Google Scholar 

  11. Sun Y, Li J, Liu J, Sun B, Chow C (2014) An improvement of symbolic aggregate approximation distance measure for time series. Neurocomputing 138:189–198

    Article  Google Scholar 

  12. Vemulapalli PK, Monga V, Brennan SN (2013) Robust extrema features for time-series data analysis. IEEE Trans Pattern Anal Mach Intell 35(6):1464–1479

    Article  Google Scholar 

  13. Shing Perng C, Wang H, Zhang SR, Parker DS (2000) Landmarks: a new model for similarity-based pattern querying in time series databases. In: Proceedings of international conference on data engineering, pp 33–42

  14. Policker S, Geva AB (2000) Nonstationary time series analysis by temporal clustering. IEEE Trans Syst Man Cybern 30(2):339–343

    Article  Google Scholar 

  15. Dimitova N, Golshani F (1995) Motion recovery for video content classification. ACM Trans Inf Syst 13:408–439

    Article  Google Scholar 

  16. Faloutas C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: Proceedings of ACM SIGMOD conference, pp 419–429

  17. Keogh E, Chakrabarti K, Pazzani M, Mehrotra S (2000) Dimensionality reduction for fast similarity search in large time series databases. J Knowl Inf Syst 3(3):263–286

    Article  MATH  Google Scholar 

  18. Keogh E, Chakrabarti K, Mehrotra S, Pazzani M (2001) Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, pp 151–163

  19. Lee S, Kwon D, Lee S (2003) Dimensionality reduction for indexing time series based on the minimum distance. J Inf Sci Eng 19:697–711

    MathSciNet  Google Scholar 

  20. Ratanamahatana CA, Keogh E, Bagnall AJ, Lonardi S(2005) Novel bit level time series representation with implications for similarity search and clustering. In: Proceedings of the ninth Pacific–Asia conference on knowledge discovery and data mining, pp 771–777

  21. Bagnall A, Ratanamahatana CA, Keogh E, Lonardi S, Janacek GA (2006) Bit level representation for time series data mining with shape based similarity. Data Min Knowl Disc 13(1):11–40

    Article  MathSciNet  Google Scholar 

  22. Keogh E (1997) Fast similarity search in the presence of longitudinal scaling in time series databases, In: Proceedings of the ninth IEEE international conference on tools with artificial intelligence, pp 578–584

  23. Keogh E, Smyth PA (1997) Probabilistic approach to fast pattern matching in time series databases, In: Proceedings of the third ACM SIGKDD international conference on knowledge discovery and data mining, pp 24–30

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

  25. Smyth P, Keogh E (1997) Clustering and mode classification of engineering time series data. In: Proceedings of the third ACM SIGKDD international conference on knowledge discovery and data mining, pp 24–30

  26. Chung FL, Fu TC, Luk R, Ng V (2005) Flexible time series pattern matching based on perceptually important points. In: International joint conference on artificial intelligence workshop on learning from temporal and spatial data, pp 1–7

  27. Krawczak M, Szkatuła G (July 2010) Time series envelopes for classification. In: IEEE intelligent systems conference, London, pp 7–9 (July 2010)

  28. Krawczak M, Szkatuła G (2014) An approach to dimensionality reduction in time series. Inf Sci 260:15–36

    Article  MathSciNet  MATH  Google Scholar 

  29. Fuchs E, Gruber T, Nitschke J, Sick B (2010) Online segmentation of time series based on polynomial least-squares approximations. IEEE Trans Pattern Anal Mach Intell 32(12):2232–2245

    Article  Google Scholar 

  30. Fisch D, Gruber T, Sick B (2011) SwiftRule: mining comprehensible classification rules for time series analysis. IEEE Trans Knowl Data Eng 23(5):774–787

    Article  Google Scholar 

  31. Nikolaou A, Gutiérrez PA, Durán A, Dicaire I, Fernández-Navarro F, Hervás-Martínez C (2014) Detection of early warning signals in paleoclimate data using a genetic time series segmentation algorithm. Clim Dyn 44(7–8):1919–1933

    Google Scholar 

  32. Keogh E, Zhu Q, Hu B, Hao Y, Xi X, Wei L, Ratanamahatana CA (2011) The UCR time series classification/clustering. Available: www.cs.ucr.edu/~eamonn/time_series_data/

  33. Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco

    Google Scholar 

  34. Keogh E (2006) Weka on time series. Available: www.cs.ucr.edu/~eamonn/time_series_data/WekaOnTimeSeries.xls

  35. Al-Hmouz R, Pedrycz W, Balamash A, Morfeq A (2015) Description and classification of granular time series. Soft Comput 19(4):1003–1017

    Article  Google Scholar 

Download references

Acknowledgments

This project was funded by the Deanship of Scientific Research (DSR). King Abdulaziz University, Jeddah, under Grant No. (277/135/1434). The authors, therefore, acknowledge with thanks DSR technical and financial support.

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, King Abdulaziz University, Jeddah, Saudi Arabia

    Rami Al-Hmouz & Witold Pedrycz

  2. Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, T6R 2V4, Canada

    Witold Pedrycz

  3. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Witold Pedrycz

Authors
  1. Rami Al-Hmouz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Witold Pedrycz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rami Al-Hmouz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al-Hmouz, R., Pedrycz, W. Models of time series with time granulation. Knowl Inf Syst 48, 561–580 (2016). https://doi.org/10.1007/s10115-015-0868-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-015-0868-x

Keywords

Search

Navigation