Polar Formed Histogram of Fast Fourier Transform Feature for Time-series Classification Problems

Kiaei, K.; Omranpour, H.

doi:10.22061/jecei.2021.8048.468

Document Type : Original Research Paper

Authors

Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran.

https://doi.org/10.22061/jecei.2021.8048.468

Abstract

Background and Objectives: Time series classification (TSC) means classifying the data over time and based on their behavior. TSC is one of the main machine learning tasks related to time series. Because the classification accuracy is of particular importance, we have decided to increase it in this research.
Methods: In this paper, we proposed a simple method for TSC problems to achieve higher classification accuracy than other existing methods. Fast Fourier transform is a method that uses in raw time series data preprocess. In this study, we apply the fast Fourier transform (FFT) over the raw datasets. Then we use the polar form of a complex number to create a histogram. The proposed method consists of three steps: preprocessing using FFT, feature extraction by histogram computation, and decision making using a random forest classifier.
Results: The presented method was tested on 12 datasets of the UCR time series classification archive from different domains. Evaluation of our method was performed using k-fold cross-validation and classification accuracy. The experimental results state that our model has been achieved classification accuracy higher or comparable than related methods. Computational complexity has also been significantly reduced.
Conclusion: In the latest years, the TSC problems have been increased. In this work, we proposed a simple method with extracted features from fast Fourier transforms that is efficient to gain more high accuracy.

Keywords

Main Subjects

Classification

Open Access

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit: http://creativecommons.org/licenses/by/4.0/

Publisher’s Note

JECEI Publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Publisher

Shahid Rajaee Teacher Training University

References

[1] H. Madsen, Time series analysis. CRC Press, 2007.

[2] M. Langkvist, L. Karlsson, A. Loutfi, “A review of unsupervised feature learning and deep learning for time-series modeling,” Pattern Recognit. Lett., 42: 11–24, 2014.

[3] Z. Turani et al., “Optical radiomic signatures derived from optical coherence tomography images improve identification of melanoma,” Cancer Res., 79(8): 2021–2030, 2019.

[4] S. Adabi et al., “Universal in vivo textural model for human skin based on optical coherence tomograms,” Sci. Rep., 7(1): 1–11, 2017.

[5] J.C.B. Gamboa, “Deep learning for time-series analysis,” arXiv Prepr. arXiv1701.01887, 2017.

[6] M. Jung, S. Chi, “Human activity classification based on sound recognition and residual convolutional neural network,” Autom. Constr., 114: 103177, 2020.

[7] A. Rajkomar et al., “Scalable and accurate deep learning with electronic health records,” NPJ Digit. Med., 1(1): 1–10, 2018.

[8] Z. Fang, P. Wang, W. Wang, “Efficient learning interpretable shapelets for accurate time series classification,” in Proc. 2018 IEEE 34th International Conference on Data Engineering (ICDE): 497–508, 2018.

[9] J. Grabocka, N. Schilling, M. Wistuba, L. Schmidt-Thieme, “Learning time-series shapelets,” in Proc. 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: 392–401, 2014.

[10] T. Rakthanmanon, E. Keogh, “Fast shapelets: A scalable algorithm for discovering time series shapelets,” in proc. 2013 SIAM International Conference on Data Mining: 668–676, 2013.

[11] B. Wang et al., “Removal of 'strip noise' in radio-echo sounding data using combined wavelet and 2-D DFT filtering,” Ann. Glaciol., 61(81): 124-134, 2020.

[12] G.R. Schleder, A.C. M. Padilha, C.M. Acosta, M. Costa, A. Fazzio, “From DFT to machine learning: recent approaches to materials science--a review,” J. Phys. Mater., 2(3): 32001, 2019.

[13] A. Bagnall, J. Lines, A. Bostrom, J. Large, E. Keogh, “The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances,” Data Min. Knowl. Discov., 31(3): 606–660, 2017.

[14] X. Xi, E. Keogh, C. Shelton, L. Wei, C.A. Ratanamahatana, “Fast time series classification using numerosity reduction,” in Proc. 23rd international conference on Machine learning: 1033–1040, 2006.

[15] H. Sakoe, S. Chiba, “Dynamic programming algorithm optimization for spoken word recognition,” IEEE Trans. Acoust., 26(1): 43–49, 1978.

[16] L. Ye, E. Keogh, “Time series shapelets: a new primitive for data mining,” in Proc. 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: 947–956, 2009.

[17] J. Lines, L.M. Davis, J. Hills, A. Bagnall, “A shapelet transform for time series classification,” in Proc. 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: 289–297, 2012.

[18] J. Grabocka, M. Wistuba, L. Schmidt-Thieme, “Fast classification of univariate and multivariate time series through shapelet discovery,” Knowl. Inf. Syst., 49(2): 429–454, 2016.

[19] T. Le Nguyen, S. Gsponer, G. Ifrim, “Time series classification by sequence learning in all-subsequence space,” in Proc. 2017 IEEE 33rd international Conference on Data Engineering (ICDE): 947–958, 2017.

[20] T. Rakthanmanon et al., “Searching and mining trillions of time series subsequences under dynamic time warping,” in Proc. 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: 262–270, 2012.

[21] J. Lin, E. Keogh, L. Wei, S. Lonardi, “Experiencing SAX: a novel symbolic representation of time series,” Data Min. Knowl. Discov., 15(2): 107–144, 2007.

[22] P. Schäfer, U. Leser, “Fast and accurate time series classification with weasel,” in Proc. 2017 ACM on Conference on Information and Knowledge Management: 637–646, 2017.

[23] R. Agrawal, C. Faloutsos, A. Swami, “Efficient similarity search in sequence databases,” in Proc. International Conference on Foundations of Data Organization and Algorithms: 69–84, 1993.

[24] J. Lin, R. Khade, Y. Li, “Rotation-invariant similarity in time series using bag-of-patterns representation,” J. Intell. Inf. Syst., 39(2): 287–315, 2012.

[25] P. Senin, S. Malinchik, “Sax-vsm: Interpretable time series classification using sax and vector space model,” in Proc. 2013 IEEE 13th International Conference on Data Mining: 1175–1180, 2013.

[26] G. Ifrim, C. Wiuf, “Bounded coordinate-descent for biological sequence classification in high dimensional predictor space,” in Proc. 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: 708–716, 2011.

[27] P. Schäfer, “Scalable time series classification,” Data Min. Knowl. Discov., 30(5): 1273–1298, 2016.

[28] “The Fast Fourier Transform (FFT) as a statistical tool for time-series analysis.”

[29] S. Zhang, X. Li, M. Zong, X. Zhu, D. Cheng, “Learning k for knn classification,” ACM Trans. Intell. Syst. Technol., 8(3): 1–19, 2017.

[30] A. A. Soofi, A. Awan, “Classification techniques in machine learning: applications and issues,” J. Basic Appl. Sci., 13: 459–465, 2017.

[31] G. Biau, E. Scornet, “A random forest guided tour,” Test, 25(2): 197–227, 2016.

[32] G. Li, B.K.K. Choi, J. Xu, S.S. Bhowmick, K.-P. Chun, G.L.H. Wong, “Efficient shapelet discovery for time series classification,” IEEE Trans. Knowl. Data Eng., 2020.

[33] A. Bagnall, J. Lines, J. Hills, A. Bostrom, “Time-series classification with COTE: the collective of transformation-based ensembles,” IEEE Trans. Knowl. Data Eng., 27(9): 2522–2535, 2015.

[34] H. A. Dau et al., “The UCR time series archive,” IEEE/CAA J. Autom. Sin., 6(6): 1293–1305, 2019.

[35] L. Breiman, A. Cutler, “Manual--setting up, using, and understanding random forests V4. 0. 2003,”.

[36] H.I. Fawaz, G. Forestier, J. Weber, L. Idoumghar, P.A. Muller, “Deep learning for time series classification: a review,” Data Min. Knowl. Discov., 33(4): 917–963, 2019.

[37] J. Derrac, S. García, D. Molina, F. Herrera, “A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,” Swarm Evol. Comput., 1(1): 3–18, 2011.

LETTERS TO EDITOR

Journal of Electrical and Computer Engineering Innovations (JECEI) welcomes letters to the editor for the post-publication discussions and corrections which allows debate post publication on its site, through the Letters to Editor. Letters pertaining to manuscript published in JECEI should be sent to the editorial office of JECEI within three months of either online publication or before printed publication, except for critiques of original research. Following points are to be considering before sending the letters (comments) to the editor.

[1] Letters that include statements of statistics, facts, research, or theories should include appropriate references, although more than three are discouraged.

[2] Letters that are personal attacks on an author rather than thoughtful criticism of the author’s ideas will not be considered for publication.

[3] Letters can be no more than 300 words in length.

[4] Letter writers should include a statement at the beginning of the letter stating that it is being submitted either for publication or not.

[5] Anonymous letters will not be considered.

[6] Letter writers must include their city and state of residence or work.

[7] Letters will be edited for clarity and length.

Name *

Email Address *

Affiliation *

Comments *

Security Code *

Journal of Electrical and Computer Engineering Innovations (JECEI)

Polar Formed Histogram of Fast Fourier Transform Feature for Time-series Classification Problems

References

References

Send comment about this article

Volume 10, Issue 2
July 2022
Pages 273-286

Polar Formed Histogram of Fast Fourier Transform Feature for Time-series Classification Problems

References

References

Send comment about this article

Volume 10, Issue 2July 2022Pages 273-286

Volume 10, Issue 2
July 2022
Pages 273-286