Skip to main content

Motif Alignment for Time Series Data Augmentation

  • Conference paper
  • First Online:
Big Data Analytics and Knowledge Discovery (DaWaK 2023)

Abstract

In this paper, we propose MotifAug, a parameter-free, pattern mixing-based time series data augmentation method that improves previous approaches in the literature. MotifAug leverages the warping path constructed by MotifDTW, a novel alignment method that uses the Matrix Profile (MP) motif discovery mechanism and Dynamic Time Warping (DTW) to align two time series data instances.

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

    https://sites.google.com/view/MotifAug/home.

  2. 2.

    https://github.com/omarbahri/MotifAug.

References

  1. Chawla, N.V., Bowyer, K.W., Hall, L.O., Kegelmeyer, W.P.: SMOTE: synthetic minority over-sampling technique. J. Artif. Intell. Res. 16, 321–357 (2002)

    Google Scholar 

  2. Forestier, G., Petitjean, F., Dau, H.A., Webb, G.I., Keogh, E.: Generating synthetic time series to augment sparse datasets. In: Proceedings - IEEE International Conference on Data Mining, ICDM, vol. 2017-Novem, pp. 865–870, December 2017

    Google Scholar 

  3. Iwana, B.K., Uchida, S.: Time series data augmentation for neural networks by time warping with a discriminative teacher, April 2020

    Google Scholar 

  4. Iwana, B.K., Uchida, S.: An empirical survey of data augmentation for time series classification with neural networks. PLOS ONE 16(7), e0254841 (2021)

    Google Scholar 

  5. Kamycki, K., Kapuscinski, T., Oszust, M.: Data augmentation with suboptimal warping for time-series classification. Sensors 20(1), 98 (2019)

    Google Scholar 

  6. Madrid, F., Imani, S., Mercer, R., Zimmerman, Z., Shakibay, N., Keogh, E.: Matrix profile XX: finding and visualizing time series motifs of all lengths using the matrix profile. In: International Conference on Big Knowledge, ICBK 2019, pp. 175–182, November 2019

    Google Scholar 

  7. Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Sig. Process. 26(1), 43–49 (1978)

    Article  MATH  Google Scholar 

  8. Yeh, C.C.M., et al.: Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and Shapelets, pp. 1317–1322, February 2017

    Google Scholar 

Download references

Acknowledgments

This project has been supported in part by funding from GEO Directorate under NSF awards #2204363, #2240022, and #2301397 and the CISE Directorate under NSF award #2305781.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Omar Bahri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Bahri, O., Li, P., Boubrahimi, S.F., Hamdi, S.M. (2023). Motif Alignment for Time Series Data Augmentation. In: Wrembel, R., Gamper, J., Kotsis, G., Tjoa, A.M., Khalil, I. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2023. Lecture Notes in Computer Science, vol 14148. Springer, Cham. https://doi.org/10.1007/978-3-031-39831-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-39831-5_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-39830-8

  • Online ISBN: 978-3-031-39831-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics