Skip to main content

Time Series Classification Based on Multi-codebook Important Time Subsequence Approximation Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9950))

Abstract

This paper proposes a multi-codebook important time subsequence approximation (MCITSA) algorithm for time series classification. MCITSA generates a codebook using important time subsequences for each class based on the difference of categories. In this way, each codebook contains the class information itself. To predict the class label of an unseen time series, MCITSA needs to compare the similarities between important time subsequences extracted from the unseen time series and codewords of each class. Experimental results on time series datasets demonstrate that MCITSA is more powerful than PVQA in classifying time series.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Wang, Q., Megalooikonomou, V.: A dimensionality reduction technique for efficient time series similarity analysis. Inf. Syst. 33, 115–132 (2008)

    Article  Google Scholar 

  2. 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 

  3. Chan, K.P., Fu, W.C.: Efficient time series matching by wavelets. In: 15th IEEE International Conference on Data Engineering, pp. 126–133, Sydney (1999)

    Google Scholar 

  4. Chan, K.P., Fu, W.C., Yu, C.: Haar wavelets for efficient similarity search of time series: with and without time warping. IEEE Trans. Knowl. Data Eng. 15, 686–705 (2003)

    Article  Google Scholar 

  5. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time series databases, In: ACM Sigmode Record, pp. 419–429. ACM Press (1994)

    Google Scholar 

  6. Li, H., Yang, L.: Time series visualization based on shape features. Knowl.-Based Syst. 41, 43–53 (2013)

    Article  Google Scholar 

  7. Keogh, E., Lin, J., Fu, A.: Hot SAX: efficiently finding the most unusual time series subsequence. In: 5th IEEE International Conference on Data Mining, pp. 226–233 (2005)

    Google Scholar 

  8. Lin, J., Keogh, E., Li, W., Lonardi, S.: Experiencing SAX: a novel symbolic representation of time series. Data Min. Knowl. Discov. 15, 107–144 (2007)

    Article  MathSciNet  Google Scholar 

  9. Lathauwer, L.D., Moor, B.D., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 1253–1278 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li, H., Yang, L., Guo, C.: Improved piecewise vector quantized approximation based on normalized time subsequences. Measurement 46, 3429–3439 (2013)

    Article  Google Scholar 

  11. Górecki, T., Łuczak, M.: Multivariate time series classification with parametric derivative dynamic time warping. Expert Syst. Appl. 42, 2305–2312 (2014)

    Article  Google Scholar 

  12. Sasikala, I., Banu, I.N.: Privacy preserving data mining using piecewise vector quantization (PVQ). Int. J. Adv. Res. Comput. Sci. Technol. 2, 302–306 (2014)

    Google Scholar 

  13. Lu, Z.M., Wang, J.X., Liu, B.B.: An improved lossless data hiding scheme based on image VQ-index residual value coding. J. Syst. Softw. 82, 1016–1024 (2009)

    Article  Google Scholar 

  14. Zhang, L., Zhou, W.D., Chang, P.C.: Kernel sparse representation-based classifier. IEEE Trans. Sig. Process. 60, 1684–1695 (2012)

    Article  MathSciNet  Google Scholar 

  15. Fu, T.C., Chung, F.L., Kwok, K.Y.: Stock time series visualization based on data point importance. Eng. Appl. Artif. Intell. 21, 1217–1232 (2008)

    Article  Google Scholar 

  16. Tsinaslanidis, P.E., Kugiumtzis, D.: A prediction scheme using perceptually important points and dynamic time warping. Expert Syst. Appl. Intell. J. 41, 6848–6860 (2014)

    Article  Google Scholar 

  17. Roverso, D.: Multivariate temporal classification by windowed wavelet decomposition and recurrent neural networks. In: 3rd ANS International Topical Meeting on Nuclear Plant Instrumentation, Control and Human-Machine Interface, vol. 20 (2000)

    Google Scholar 

  18. Welcome to the UCR time series classification/clustering page (2003). http://www.cs.ucr.edu/~eamonn/time_series_data/

  19. Wang, Q., Megalooikonomou, V., Faloutsos, C.: Time series analysis with multiple resolutions. Inf. Syst. 35, 56–74 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61373093 and 61402310, by the Natural Science Foundation of Jiangsu Province of China under Grant No. BK20140008, by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China under Grant No. 13KJA520001, and by the Soochow Scholar Project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Li Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Tao, Z., Zhang, L., Wang, B., Li, F. (2016). Time Series Classification Based on Multi-codebook Important Time Subsequence Approximation Algorithm. In: Hirose, A., Ozawa, S., Doya, K., Ikeda, K., Lee, M., Liu, D. (eds) Neural Information Processing. ICONIP 2016. Lecture Notes in Computer Science(), vol 9950. Springer, Cham. https://doi.org/10.1007/978-3-319-46681-1_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46681-1_69

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46680-4

  • Online ISBN: 978-3-319-46681-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics