Skip to main content

An Interpretable Time Series Classification Approach Based on Feature Clustering

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13246))

Included in the following conference series:

Abstract

The time series classification problem has been an important mining task and applied in many real-life applications. A large number of approaches have been proposed, including shape-based approaches, dictionary-based ones, ensemble-based ones and some deep-learning approaches. However, these approaches either suffer from low accuracy or need massive features which hinder the interpretability. To overcome these challenges, in this paper, we propose a novel approach, FCCA, based on the feature clustering. We first present the formal definition features of various types. Then we propose the approaches of feature candidates generation, feature filtering and feature clustering. With a small number of representative features, FCCA not only achieves high accuracy, but also improves the interpretability greatly. Extensive experiments are conducted on UCR benchmark to verify the effectiveness and efficiency of the proposed approach.

The work is supported by the Ministry of Science and Technology of China, National Key Research and Development Program (No. 2020YFB1710001), NSFC (No. 52172397).

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Notes

  1. 1.

    The subscript \(\lambda \) only works for the interval-based feature group.

  2. 2.

    Our Github repository: https://github.com/EuphoriaFF/FCCA.

References

  1. Chen, Y., et al.: The UCR time series classification archive, July 2015. http://www.timeseriesclassification.com

  2. Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., Muller, P.-A.: Deep learning for time series classification: a review. Data Min. Knowl. Disc. 33(4), 917–963 (2019). https://doi.org/10.1007/s10618-019-00619-1

    Article  MathSciNet  MATH  Google Scholar 

  3. Keogh, E.J., Rakthanmanon, T.: Fast Shapelets: a scalable algorithm for discovering time series Shapelets. In: SIAM 2013, pp. 668–676 (2013)

    Google Scholar 

  4. Lin, J., Keogh, E.J., Wei, L., Lonardi, S.: Experiencing SAX: a novel symbolic representation of time series. DMKD 15(2), 107–144 (2007). https://doi.org/10.1007/s10618-007-0064-z

    Article  MathSciNet  Google Scholar 

  5. Lines, J., Bagnall, A.: Time series classification with ensembles of elastic distance measures. Data Min. Knowl. Disc. 29(3), 565–592 (2014). https://doi.org/10.1007/s10618-014-0361-2

    Article  MathSciNet  MATH  Google Scholar 

  6. Lines, J., Taylor, S., Bagnall, A.J.: HIVE-COTE: the hierarchical vote collective of transformation-based ensembles for time series classification. In: ICDM 2016 (2016)

    Google Scholar 

  7. Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: NeurIPS 2017, pp. 4765–4774 (2017)

    Google Scholar 

  8. Ma, Q., Zhuang, W., Cottrell, G.W.: Triple-Shapelet networks for time series classification. In: ICDM 2019, pp. 1246–1251 (2019)

    Google Scholar 

  9. Nguyen, T.L., Gsponer, S., Ifrim, G.: Time series classification by sequence learning in all-subsequence space. In: ICDE 2017, pp. 947–958 (2017)

    Google Scholar 

  10. Ribeiro, M.T., Singh, S., Guestrin, C.: “Why should I trust you?”: explaining the predictions of any classifier. In: SIGKDD 2016, pp. 1135–1144 (2016)

    Google Scholar 

  11. Schäfer, P.: The BOSS is concerned with time series classification in the presence of noise. Data Min. Knowl. Disc. 29(6), 1505–1530 (2014). https://doi.org/10.1007/s10618-014-0377-7

    Article  MathSciNet  MATH  Google Scholar 

  12. Schäfer, P., Högqvist, M.: SFA: a symbolic Fourier approximation and index for similarity search in high dimensional datasets. In: EDBT 2012, pp. 516–527 (2012)

    Google Scholar 

  13. Shifaz, A., Pelletier, C., Petitjean, F., Webb, G.I.: TS-CHIEF: a scalable and accurate forest algorithm for time series classification. Data Min. Knowl. Disc. 34(3), 742–775 (2020). https://doi.org/10.1007/s10618-020-00679-8

    Article  MathSciNet  MATH  Google Scholar 

  14. Wang, J., Wang, Z., Li, J., Wu, J.: Multilevel wavelet decomposition network for interpretable time series analysis. In: SIGKDD 2018, pp. 2437–2446 (2018)

    Google Scholar 

  15. Ye, L., Keogh, E.: Time series Shapelets: a new primitive for data mining. In: SIGKDD 2009, pp. 947–956 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qiao, F., Wang, P., Wang, W., Wang, B. (2022). An Interpretable Time Series Classification Approach Based on Feature Clustering. In: Bhattacharya, A., et al. Database Systems for Advanced Applications. DASFAA 2022. Lecture Notes in Computer Science, vol 13246. Springer, Cham. https://doi.org/10.1007/978-3-031-00126-0_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-00126-0_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-00125-3

  • Online ISBN: 978-3-031-00126-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics