|تعداد مشاهده مقاله||2,480,995|
|تعداد دریافت فایل اصل مقاله||1,748,428|
|Journal of Electrical and Computer Engineering Innovations (JECEI)|
|مقاله 2، دوره 10، شماره 2، مهر 2022، صفحه 273-286 اصل مقاله (1.48 M)|
|نوع مقاله: Original Research Paper|
|شناسه دیجیتال (DOI): 10.22061/jecei.2021.8048.468|
|K. Kiaei؛ H. Omranpour*|
|Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran.|
|تاریخ دریافت: 15 تیر 1400، تاریخ بازنگری: 03 آبان 1400، تاریخ پذیرش: 10 آبان 1400|
|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.
|Time-series؛ Classification؛ Fast Fourier transform؛ Polar form؛ Random forest classifier|
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
تعداد مشاهده مقاله: 397
تعداد دریافت فایل اصل مقاله: 275