Automatic feature extraction and selection for classification of cyclical time series data

2017 ◽  
Vol 84 (3) ◽  
Author(s):  
Tizian Schneider ◽  
Nikolai Helwig ◽  
Andreas Schütze
Keyword(s):  
Time Series ◽  
Feature Extraction ◽  
Feature Selection ◽  
Time Series Data ◽  
Use Cases ◽  
Series Data ◽  
Wide Range ◽  
Feature Extraction And Selection ◽  
Cyclical Time

AbstractThe classification of cyclically recorded time series plays an important role in measurement technologies. Example use cases range from gas sensors combined with temperature cycled operation to condition monitoring using vibration analysis. Before machine learning can be applied to high dimensional cyclical time series data dimensionality reduction has to be performed to avoid the classifier suffering from overfitting and the “curse of dimensionality”. This paper introduces a set of four complementary feature extraction methods and three feature selection algorithms that can be applied in a fully automatized manner to reduce the number of dimensions. The feature extraction algorithms are capable of extracting characteristic features from cyclical time series catching information contained in local details and overall cycle shape as well as in frequency or time-frequency domain. The methods for feature selection are capable of selecting the most suitable features for linear and nonlinear classification. The methods were chosen to be applicable to a wide range of applications which is verified by testing the set of methods on four different use cases.

scholarly journals Time–frequency time–space LSTM for robust classification of physiological signals

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Tuan D. Pham
Keyword(s):  
Time Series ◽  
Network Architecture ◽  
Time Series Data ◽  
Short Term Memory ◽  
Physiological Signals ◽  
Series Data ◽  
Time Frequency ◽  
Time Space ◽  
Deep Recurrent Neural Network

AbstractAutomated analysis of physiological time series is utilized for many clinical applications in medicine and life sciences. Long short-term memory (LSTM) is a deep recurrent neural network architecture used for classification of time-series data. Here time–frequency and time–space properties of time series are introduced as a robust tool for LSTM processing of long sequential data in physiology. Based on classification results obtained from two databases of sensor-induced physiological signals, the proposed approach has the potential for (1) achieving very high classification accuracy, (2) saving tremendous time for data learning, and (3) being cost-effective and user-comfortable for clinical trials by reducing multiple wearable sensors for data recording.

scholarly journals High-pass filtering artifacts in multivariate classification of neural time series data

2021 ◽  
Vol 352 ◽  
pp. 109080
Author(s):  
Joram van Driel ◽  
Christian N.L. Olivers ◽  
Johannes J. Fahrenfort
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Series Data ◽  
Multivariate Classification ◽  
High Pass

scholarly journals Bill Money Classification of Japanese Yen Using Time Series Data

1995 ◽  
Vol 115 (3) ◽  
pp. 354-360 ◽  
Author(s):  
Shigeaki Fukuda ◽  
Toshihisa Kosaka ◽  
Sigeru Omatsu
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Series Data ◽  
Japanese Yen

Discriminate Supervised Weighted Scheme for the Classification of Time Series Signals

2021 ◽  
Vol 13 (3) ◽  
pp. 1-16
Author(s):  
Elangovan Ramanujam ◽  
S. Padmavathi
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
State Of The Art ◽  
Statistical Significance ◽  
Series Data ◽  
Bag Of Words ◽  
Time Series Classification ◽  
Problem Of Time ◽  
Weighted Matrix

Innovations and applicability of time series data mining techniques have significantly increased the researchers' interest in the problem of time series classification. Several algorithms have been proposed for this purpose categorized under shapelet, interval, motif, and whole series-based techniques. Among this, the bag-of-words technique, an extensive application of the text mining approach, performs well due to its simplicity and effectiveness. To extend the efficiency of the bag-of-words technique, this paper proposes a discriminate supervised weighted scheme to identify the characteristic and representative pattern of a class for efficient classification. This paper uses a modified weighted matrix that discriminates the representative and non-representative pattern which enables the interpretability in classification. Experimentation has been carried out to compare the performance of the proposed technique with state-of-the-art techniques in terms of accuracy and statistical significance.

scholarly journals Co-eye: a multi-resolution ensemble classifier for symbolically approximated time series

2020 ◽  
Vol 109 (11) ◽  
pp. 2029-2061
Author(s):  
Zahraa S. Abdallah ◽  
Mohamed Medhat Gaber
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Ensemble Classifier ◽  
Series Data ◽  
New Classification ◽  
Symbolic Representations ◽  
Classification Technique ◽  
Field Of Vision ◽  
Main Challenge ◽  
Wide Range

Abstract Time series classification (TSC) is a challenging task that attracted many researchers in the last few years. One main challenge in TSC is the diversity of domains where time series data come from. Thus, there is no “one model that fits all” in TSC. Some algorithms are very accurate in classifying a specific type of time series when the whole series is considered, while some only target the existence/non-existence of specific patterns/shapelets. Yet other techniques focus on the frequency of occurrences of discriminating patterns/features. This paper presents a new classification technique that addresses the inherent diversity problem in TSC using a nature-inspired method. The technique is stimulated by how flies look at the world through “compound eyes” that are made up of thousands of lenses, called ommatidia. Each ommatidium is an eye with its own lens, and thousands of them together create a broad field of vision. The developed technique similarly uses different lenses and representations to look at the time series, and then combines them for broader visibility. These lenses have been created through hyper-parameterisation of symbolic representations (Piecewise Aggregate and Fourier approximations). The algorithm builds a random forest for each lens, then performs soft dynamic voting for classifying new instances using the most confident eyes, i.e., forests. We evaluate the new technique, coined Co-eye, using the recently released extended version of UCR archive, containing more than 100 datasets across a wide range of domains. The results show the benefits of bringing together different perspectives reflecting on the accuracy and robustness of Co-eye in comparison to other state-of-the-art techniques.

Sign in / Sign up

Export Citation Format

Share Document