scholarly journals Automatic subject-specific spatiotemporal feature selection for subject-independent affective BCI

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0253383
Author(s):  
Badar Almarri ◽  
Sanguthevar Rajasekaran ◽  
Chun-Hsi Huang
Keyword(s):  
Time Series ◽  
Feature Selection ◽  
Emotion Recognition ◽  
Learning Algorithm ◽  
Feature Space ◽  
Support Vector ◽  
Affective Stimuli ◽  
Subject Specific ◽  
Spatially Distributed ◽  
Valence And Arousal

The dimensionality of the spatially distributed channels and the temporal resolution of electroencephalogram (EEG) based brain-computer interfaces (BCI) undermine emotion recognition models. Thus, prior to modeling such data, as the final stage of the learning pipeline, adequate preprocessing, transforming, and extracting temporal (i.e., time-series signals) and spatial (i.e., electrode channels) features are essential phases to recognize underlying human emotions. Conventionally, inter-subject variations are dealt with by avoiding the sources of variation (e.g., outliers) or turning the problem into a subject-deponent. We address this issue by preserving and learning from individual particularities in response to affective stimuli. This paper investigates and proposes a subject-independent emotion recognition framework that mitigates the subject-to-subject variability in such systems. Using an unsupervised feature selection algorithm, we reduce the feature space that is extracted from time-series signals. For the spatial features, we propose a subject-specific unsupervised learning algorithm that learns from inter-channel co-activation online. We tested this framework on real EEG benchmarks, namely DEAP, MAHNOB-HCI, and DREAMER. We train and test the selection outcomes using nested cross-validation and a support vector machine (SVM). We compared our results with the state-of-the-art subject-independent algorithms. Our results show an enhanced performance by accurately classifying human affection (i.e., based on valence and arousal) by 16%–27% compared to other studies. This work not only outperforms other subject-independent studies reported in the literature but also proposes an online analysis solution to affection recognition.

Dimensional Music Emotion Recognition by Machine Learning

2016 ◽  
Vol 10 (4) ◽  
pp. 74-89 ◽  
Author(s):  
Junjie Bai ◽  
Lixiao Feng ◽  
Jun Peng ◽  
Jinliang Shi ◽  
Kan Luo ◽  
...  
Keyword(s):  
Emotion Recognition ◽  
Feature Space ◽  
Support Vector ◽  
Continuous Variables ◽  
Regression Problem ◽  
Regression Effect ◽  
Wide Range ◽  
Adaptive Regression ◽  
Arousal Model ◽  
Valence And Arousal

Music emotion recognition (MER) is a challenging field of studies that has been addressed in multiple disciplines such as cognitive science, physiology, psychology, musicology, and arts. In this paper, music emotions are modeled as a set of continuous variables composed of valence and arousal (VA) values based on the Valence-Arousal model. MER is formulated as a regression problem where 548 dimensions of music features were extracted and selected. A wide range of methods including multivariate adaptive regression spline, support vector regression (SVR), radial basis function, random forest regression (RFR), and regression neural networks are adopted to recognize music emotions. Experimental results show that these regression algorithms have led to good regression effect for MER. The optimal R2 statistics and VA values are 29.3% and 62.5%, respectively, which are obtained by the RFR and SVR algorithms in the relief feature space.

scholarly journals Recognition Technology of Athlete’s Limb Movement Combined Based on the Integrated Learning Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Fei Tan ◽  
Xiaoqing Xie
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Learning Algorithm ◽  
Human Motion ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Recording Device ◽  
Table Tennis ◽  
Movement Recognition ◽  
Random Forest Tree

Human motion recognition based on inertial sensor is a new research direction in the field of pattern recognition. It carries out preprocessing, feature selection, and feature selection by placing inertial sensors on the surface of the human body. Finally, it mainly classifies and recognizes the extracted features of human action. There are many kinds of swing movements in table tennis. Accurately identifying these movement modes is of great significance for swing movement analysis. With the development of artificial intelligence technology, human movement recognition has made many breakthroughs in recent years, from machine learning to deep learning, from wearable sensors to visual sensors. However, there is not much work on movement recognition for table tennis, and the methods are still mainly integrated into the traditional field of machine learning. Therefore, this paper uses an acceleration sensor as a motion recording device for a table tennis disc and explores the three-axis acceleration data of four common swing motions. Traditional machine learning algorithms (decision tree, random forest tree, and support vector) are used to classify the swing motion, and a classification algorithm based on the idea of integration is designed. Experimental results show that the ensemble learning algorithm developed in this paper is better than the traditional machine learning algorithm, and the average recognition accuracy is 91%.

scholarly journals A Machine Learning Approach to EEG-based Prediction of Human Affective States Using Recursive Feature Elimination Method

2021 ◽  
Vol 335 ◽  
pp. 04001
Author(s):  
Didar Dadebayev ◽  
Goh Wei Wei ◽  
Tan Ee Xion
Keyword(s):  
Feature Selection ◽  
Fractal Dimension ◽  
Emotion Recognition ◽  
Affective Computing ◽  
Feature Selection Method ◽  
Recursive Feature Elimination ◽  
Support Vector ◽  
Emotional States ◽  
Affective States ◽  
Emotion Classification

Emotion recognition, as a branch of affective computing, has attracted great attention in the last decades as it can enable more natural brain-computer interface systems. Electroencephalography (EEG) has proven to be an effective modality for emotion recognition, with which user affective states can be tracked and recorded, especially for primitive emotional events such as arousal and valence. Although brain signals have been shown to correlate with emotional states, the effectiveness of proposed models is somewhat limited. The challenge is improving accuracy, while appropriate extraction of valuable features might be a key to success. This study proposes a framework based on incorporating fractal dimension features and recursive feature elimination approach to enhance the accuracy of EEG-based emotion recognition. The fractal dimension and spectrum-based features to be extracted and used for more accurate emotional state recognition. Recursive Feature Elimination will be used as a feature selection method, whereas the classification of emotions will be performed by the Support Vector Machine (SVM) algorithm. The proposed framework will be tested with a widely used public database, and results are expected to demonstrate higher accuracy and robustness compared to other studies. The contributions of this study are primarily about the improvement of the EEG-based emotion classification accuracy. There is a potential restriction of how generic the results can be as different EEG dataset might yield different results for the same framework. Therefore, experimenting with different EEG dataset and testing alternative feature selection schemes can be very interesting for future work.

Empirical analysis of time series using feature selection algorithms

2021 ◽  
Author(s):  
Mikhail Kanevski
Keyword(s):  
Machine Learning ◽  
Time Series ◽  
Feature Selection ◽  
Dimensional Space ◽  
Multivariate Time Series ◽  
Feature Space ◽  
Real Data ◽  
Theoretical Concepts ◽  
Wide Range ◽  
Linear And Nonlinear

<p>Nowadays a wide range of methods and tools to study and forecast time series is available. An important problem in forecasting concerns embedding of time series, i.e. construction of a high dimensional space where forecasting problem is considered as a regression task. There are several basic linear and nonlinear approaches of constructing such space by defining an optimal delay vector using different theoretical concepts. Another way is to consider this space as an input feature space – IFS, and to apply machine learning feature selection (FS) algorithms to optimize IFS according to the problem under study (analysis, modelling or forecasting). Such approach is an empirical one: it is based on data and depends on the FS algorithms applied. In machine learning features are generally classified as relevant, redundant and irrelevant. It gives a reach possibility to perform advanced multivariate time series exploration and development of interpretable predictive models.</p><p>Therefore, in the present research different FS algorithms are used to analyze fundamental properties of time series from empirical point of view. Linear and nonlinear simulated time series are studied in detail to understand the advantages and drawbacks of the proposed approach. Real data case studies deal with air pollution and wind speed times series. Preliminary results are quite promising and more research is in progress.</p>

Forecasting Demand With Support Vector Regression Technique Incorporating Feature Selection in the Presence of Calendar Effect

2018 ◽  
pp. 302-316 ◽  
Author(s):  
Malek Sarhani ◽  
Abdellatif El Afia
Keyword(s):  
Time Series ◽  
Feature Selection ◽  
Supply Chains ◽  
Support Vector Regression ◽  
Case Studies ◽  
Time Series Forecasting ◽  
Regression Technique ◽  
Support Vector ◽  
Reliable Prediction ◽  
Forecasting Methods

Reliable prediction of future demand is needed to better manage and optimize supply chains. However, a difficulty of forecasting demand arises due to the fact that heterogeneous factors may affect it. Analyzing such data by using classical time series forecasting methods will fail to capture such dependency of factors. This chapter addresses these problems by examining the use of feature selection in forecasting using support vector regression while eliminating the calendar effect using X13-ARIMA-SEATS. The approach is investigated in three different case studies.

Using the Text Categorization Framework for Protein Classification

2010 ◽  
pp. 128-140 ◽  
Author(s):  
Ricco Rakotomalala ◽  
Faouzi Mhamdi
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Predictive Model ◽  
Text Categorization ◽  
Learning Algorithm ◽  
Support Vector ◽  
Protein Classification ◽  
Fixed Length ◽  
Selection Algorithms ◽  
Proteins Classification

In this chapter, we are interested in proteins classification starting from their primary structures. The goal is to automatically affect proteins sequences to their families. The main originality of the approach is that we directly apply the text categorization framework for the protein classification with very minor modifications. The main steps of the task are clearly identified: we must extract features from the unstructured dataset, we use the fixed length n-grams descriptors; we select and combine the most relevant one for the learning phase; and then, we select the most promising learning algorithm in order to produce accurate predictive model. We obtain essentially two main results. First, the approach is credible, giving accurate results with only 2-grams descriptors length. Second, in our context where many irrelevant descriptors are automatically generated, we must combine aggressive feature selection algorithms and low variance classifiers such as SVM (Support Vector Machine).

Discrete Time Signal Processing Framework with Support Vector Machines

2011 ◽  
pp. 150-178
Author(s):  
José Luis Rojo-Álvarez ◽  
Manel Martínez-Ramón ◽  
Gustavo Camps-Valls ◽  
Carlos E. Martínez-Cruz ◽  
Carlos Figuera
Keyword(s):  
Time Series ◽  
Signal Processing ◽  
Reproducing Kernel ◽  
Digital Signal ◽  
Feature Space ◽  
Time Signal ◽  
Support Vector ◽  
Straightforward Application ◽  
Signal Processing Algorithms ◽  
Signal Models

Digital signal processing (DSP) of time series using SVM has been addressed in the literature with a straightforward application of the SVM kernel regression, but the assumption of independently distributed samples in regression models is not fulfilled by a time-series problem. Therefore, a new branch of SVM algorithms has to be developed for the advantageous application of SVM concepts when we process data with underlying time-series structure. In this chapter, we summarize our past, present, and future proposal for the SVM-DSP frame-work, which consists of several principles for creating linear and nonlinear SVM algorithms devoted to DSP problems. First, the statement of linear signal models in the primal problem (primal signal models) allows us to obtain robust estimators of the model coefficients in classical DSP problems. Next, nonlinear SVM-DSP algorithms can be addressed from two different approaches: (a) reproducing kernel Hilbert spaces (RKHS) signal models, which state the signal model equation in the feature space, and (b) dual signal models, which are based on the nonlinear regression of the time instants with appropriate Mercer’s kernels. This way, concepts like filtering, time interpolation, and convolution are considered and analyzed, and they open the field for future development on signal processing algorithms following this SVM-DSP framework.

OPTIMIZATION OF LEAST SQUARES SUPPORT VECTOR MACHINE TECHNIQUE USING GENETIC ALGORITHM FOR ELECTROENCEPHALOGRAM MULTI-DIMENSIONAL SIGNALS

2016 ◽  
Vol 78 (5-10) ◽  
Author(s):  
Farzana Kabir Ahmad ◽  
Abdullah Yousef Awwad Al-Qammaz ◽  
Yuhanis Yusof
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Feature Selection ◽  
Computational Model ◽  
Least Squares ◽  
Support Vector ◽  
Feature Selection Technique ◽  
Selection Technique ◽  
Human Emotion ◽  
Valence And Arousal

Human-computer intelligent interaction (HCII) is a rising field of science that aims to refine and enhance the interaction between computer and human. Since emotion plays a vital role in human daily life, the ability of computer to interpret and response to human emotion is a crucial element for future intelligent system. Accordingly, several studies have been conducted to recognise human emotion using different technique such as facial expression, speech, galvanic skin response (GSR), or heart rate (HR). However, such techniques have problems mainly in terms of credibility and reliability as people can fake their feeling and response. Electroencephalogram (EEG) on the other has shown to be a very effective way in recognising human emotion as this technique records the brain activity of human and they can hardly be deceived by voluntary control. Regardless the popularity of EEG in recognizing human emotion, this study field is relatively challenging as EEG signal is nonlinear, involves myriad factors and chaotic in nature. These issues have led to high dimensional problem and poor classification results. To address such problems, this study has proposed a novel computational model, which consist of three main stages, namely a) feature extraction; b) feature selection and c) classifier. Discrete wavelet packet transform (DWPT) has been used to extract EEG signals feature and ultimately 204,800 features from 32 subject-independent have been obtained. Meanwhile, Genetic Algorithm (GA) and Least squares support vector machine (LS-SVM) have been used as a feature selection technique and classifier respectively. This computational model is tested on the common DEAP pre-processed EEG dataset in order to classify three levels of valence and arousal. The empirical results have shown that the proposed GA-LSSVM, has improved the classification results to 49.22% and 54.83% for valence and arousal respectively, whereas is it observed that 46.33% of valence and 48.30% of arousal classification were achieved when no feature selection technique is applied on the identical classifier

Sign in / Sign up

Export Citation Format

Share Document