<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Comput. Neurosci.</journal-id>
<journal-title>Frontiers in Computational Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Comput. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5188</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fncom.2021.741086</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Emotion Recognition Based on Dynamic Energy Features Using a Bi-LSTM Network</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Zhu</surname> <given-names>Meili</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1406851/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Wang</surname> <given-names>Qingqing</given-names></name>
</contrib>
<contrib contrib-type="author">
<name><surname>Luo</surname> <given-names>Jianglin</given-names></name>
</contrib>
</contrib-group>
<aff><institution>Modern Animation Technology Engineering Research Center of Jilin Higher Learning Institutions, Jilin Animation Institute</institution>, <addr-line>Changchun</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Si Wu, Peking University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Fei He, Coventry University, United Kingdom; Abhishek Tiwari, Universit&#x00E9; du Qu&#x00E9;bec, Canada</p></fn>
<corresp id="c001">&#x002A;Correspondence: Meili Zhu, <email>zhumeilizhu@163.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>21</day>
<month>02</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>15</volume>
<elocation-id>741086</elocation-id>
<history>
<date date-type="received">
<day>14</day>
<month>07</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>31</day>
<month>12</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2022 Zhu, Wang and Luo.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Zhu, Wang and Luo</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Among electroencephalogram (EEG) signal emotion recognition methods based on deep learning, most methods have difficulty in using a high-quality model due to the low resolution and the small sample size of EEG images. To solve this problem, this study proposes a deep network model based on dynamic energy features. In this method, first, to reduce the noise superposition caused by feature analysis and extraction, the concept of an energy sequence is proposed. Second, to obtain the feature set reflecting the time persistence and multicomponent complexity of EEG signals, the construction method of the dynamic energy feature set is given. Finally, to make the network model suitable for small datasets, we used fully connected layers and bidirectional long short-term memory (Bi-LSTM) networks. To verify the effectiveness of the proposed method, we used leave one subject out (LOSO) and 10-fold cross validation (CV) strategies to carry out experiments on the SEED and DEAP datasets. The experimental results show that the accuracy of the proposed method can reach 89.42% (SEED) and 77.34% (DEAP).</p>
</abstract>
<kwd-group>
<kwd>EEG</kwd>
<kwd>emotion recognition</kwd>
<kwd>dynamic energy feature</kwd>
<kwd>Bi-LSTM</kwd>
<kwd>energy sequence</kwd>
</kwd-group>
<counts>
<fig-count count="7"/>
<table-count count="5"/>
<equation-count count="35"/>
<ref-count count="36"/>
<page-count count="12"/>
<word-count count="8041"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="intro">
<title>Introduction</title>
<p>Emotion mainly refers to a kind of inner emotional response produced by the psychological needs of people. It is a series of subjective psychological experiences formed by integrating the feelings, perceptions, and behaviors of people (<xref ref-type="bibr" rid="B18">Li, 2017</xref>). In the daily life and work of people, emotion is everywhere. In medical care, different nursing measures can be provided according to the emotions of patients to improve the quality of care. When treating psychological and physical diseases, an emotional state can be used as an auxiliary diagnostic basis. In the human-computer interaction, by identifying emotional states, the interaction is more friendly and natural. Therefore, the qualitative recognition and classification of emotional states of people have a high research value.</p>
<p>Psychological and emotional states can be transmitted in a variety of signal forms, such as <italic>via</italic> facial expressions, voice intonation, text, body posture, and other directly observable emotional signals. An emotional state of a person can also be learned through physiological signals, such as electrical brain signals, skin temperature, and breathing signals. Compared with observable emotions, electroencephalogram (EEG) signals are obtained by directly reading brain activity. EEG signals are more real and difficult to disguise. Therefore, the results obtained by using EEG signals to classify emotions are more authentic and reliable (<xref ref-type="bibr" rid="B30">Ullsperger et al., 2014</xref>; <xref ref-type="bibr" rid="B22">Naseer and Hong, 2015</xref>; <xref ref-type="bibr" rid="B5">Chen et al., 2020</xref>). As a result, this article mainly discusses studying emotion recognition methods based on EEG signals.</p>
<p>In EEG emotion recognition research, the first type of method is based on traditional machine learning technology. This kind of method first expands the emotional feature extraction from the EEG signal and then expands the corresponding emotional pattern learning and classification of the feature data. Emotional feature extraction of EEG signals can be divided into four categories, including time-domain features, frequency-domain features, time-frequency features, and EEG signal non-linear dynamic features. For example, Atkinson et al. proposed an EEG emotion recognition method based on feature selection and a kernel classifier (<xref ref-type="bibr" rid="B2">Atkinson and Campos, 2016</xref>). In this study, the statistical characteristics of the EEG signal, frequency band power of different frequencies, Hjorth parameter, and fractal dimension are used. The statistical features include median, SD, and kurtosis coefficient. The frequency bands of EEG signals use &#x03B8; (4&#x2013;8 Hz), low &#x03B1; (8&#x2013;10 Hz), &#x03B1; (8&#x2013;12 Hz), &#x03B2; (12&#x2013;30 Hz), and &#x03B3; (30&#x2013;45 Hz). Then, a feature selection method based on mutual information and a kernel classifier are used to optimize the performance of the emotion classification task. Mohammadi et al. decomposed the EEG signal using a wavelet transform, while the entropy feature and the energy feature were extracted from each sub-band signal. Then, the support vector machine (SVM) and <italic>k</italic>-nearest neighbor (KNN) pattern classifiers were used for training and testing (<xref ref-type="bibr" rid="B21">Mohammadi et al., 2017</xref>). The results showed that the accuracy of arousal was 86.75%, and the accuracy of valence was 84.05%. Fern&#x00E1;ndez-Varela et al. evaluated the emotion recognition performance of six machine learning models in detail as follows: Fisher&#x2019;s linear discriminant, SVM, artificial neural network, classification tree, KNN, and naive Bayes (<xref ref-type="bibr" rid="B13">Isaac et al., 2017</xref>). <xref ref-type="bibr" rid="B20">Li et al. (2018)</xref> studied the effectiveness and performance of 9 time-frequency domain features and 9 non-linear dynamic features through the combination of different feature selection and SVMs. Abhishek Tiwari et al. proposed motif series and graph-theoretical features, before analyzing three feature selection methods [ANOVA-based feature ranking and selection, minimum redundancy maximum relevance (mRMR) feature selection, and recursive feature elimination (RFE)] and three fusion strategies (feature fusion, score-level fusion, and output-associated fusion). They finally concluded that motif series features are better than spectral features and that feature-level fusion strategies can improve recognition accuracy. Score-level fusion can improve arousal prediction (<xref ref-type="bibr" rid="B28">Tiwari and Falk, 2019</xref>). Fu Yang et al. constructed a multidimensional high-dimensional feature set by extracting eight linear features, such as the Hjorth parameter, power spectral density, and SD, and two non-linear features, such as wavelet entropy and sample entropy. Then, the ST-SBSSVM method was proposed by combining the significance test, sequential backward selection, and the SVM (<xref ref-type="bibr" rid="B32">Yang et al., 2019</xref>). The accuracy of the ST-SBSSVM was 72% (DEAP) and 98% (SEED).</p>
<p>The second type of method is based on deep learning technology. Deep learning has powerful feature extraction and classification capabilities. The main deep learning models used in the field of EEG signal classification include convolutional neural networks (CNNs), recurrent neural networks (RNNs), and generative adversarial networks (GANs). For example, <xref ref-type="bibr" rid="B31">Wang and Shang (2013)</xref> used a deep belief network (DBN) to extract features from the original physiological data and constructed three classifiers to estimate the arousal, valence, and liking of emotions. <xref ref-type="bibr" rid="B33">Yang et al. (2018)</xref> and <xref ref-type="bibr" rid="B3">Banee et al. (2019)</xref> put 32 electrodes into a 9 &#x00D7; 9 matrix according to the position of the international 10&#x2013;20 system. The former used a time sliding window to divide the continuous EEG signal and calculated the average value of the corresponding electrode in each window. The latter directly inputs the original signal value into the matrix. The final input of the CNN network is a two-dimensional matrix containing spatial location information. <xref ref-type="bibr" rid="B19">Li et al. (2017)</xref> used a sparse wavelet transform to transform the EEG signals of each channel into a two-dimensional spectrum and then input them into a CNN-RNN hybrid network. <xref ref-type="bibr" rid="B11">Hwang et al. (2020)</xref> generated an egg image with topological information based on differential entropy (DE) features and then used a deep network structure combining a CNN and an LSTM. <xref ref-type="bibr" rid="B25">Shawky et al. (2018)</xref> converted EEG signals into a three-dimensional continuous frame input depth network, which compared EEG signals with images while ignoring the spatial position information of electrodes in EEG signals. Ant topic et al. proposed two feature mapping methods, called topography (TOPO-FM) and holography (HOLO-FM). Then, the deep learning technique was employed for feature learning from TOPO-FM and HOLO-FM, and finally, SVM was used to classify emotions (<xref ref-type="bibr" rid="B29">Topic and Russo, 2021</xref>). In the above research, the transformation of the EEG feature form imitated the image learning mode of deep networks, including a CNN, an RNN, and a DBN as much as possible. In addition, there are studies on EEG signal analysis by using brain function networks, such as energy landscape (<xref ref-type="bibr" rid="B17">Krzemi&#x0144;ski et al., 2020</xref>; <xref ref-type="bibr" rid="B14">Klepl et al., 2021</xref>), which provides a new idea for the study of EEG signals.</p>
<p>Electroencephalogram signals are non-stationary, non-linear, and complex physiological signals with multicomponent mechanisms (<xref ref-type="bibr" rid="B7">Golyandina et al., 2001</xref>). In the machine learning method, the time domain, frequency domain, and time-frequency domain characteristics ignore the fact that the EEG signal is a non-linear signal, and non-linear dynamic features need to extract sufficient structural information of EEG components. In addition, the traditional machine learning method extracts features from multiple channels of EEG signals and then connects them to a single feature vector without considering the temporal dynamics. In the method based on deep learning, it is difficult to train a high-quality model due to the small number of samples and the low resolution of EEG images. In addition, the feature analysis and extraction of EEG signals are easily affected by noise, which impacts the effect of the deep learning model. Therefore, this study discusses combining the features extracted by manual calculation with a neural network to solve two problems. The first problem is simply and effectively representing multichannel EEG signals before establishing the emotion recognition model. The second problem is constructing effective features to learn temporal dynamics. We regarded brain emotion processing as an overall coordinated physiological response. To save artificial features while retaining the original information as much as possible, we proposed emotion recognition based on dynamic energy features using a Bi-LSTM network, and the main contributions are as follows:</p>
<list list-type="simple">
<list-item>
<label>(1)</label>
<p>The concept of energy sequence is proposed. Dynamic feature extraction based on the energy sequence can effectively avoid the noise superposition effect caused by the feature extraction of a single channel sequence.</p>
</list-item>
<list-item>
<label>(2)</label>
<p>The feature set is constructed by the combination of mutual information and principal component analysis (PCA). The feature set can reflect the time persistence of the EEG signal and the complexity of the multicomponent structure. The network model adopts fully connected layers and long short-term memory (LSTM) networks, which are suitable for small datasets.</p>
</list-item>
</list>
</sec>
<sec id="S2" sec-type="materials|methods">
<title>Materials and Methods</title>
<sec id="S2.SS1">
<title>Experimental Data</title>
<p>The datasets used in this study are SEED and DEAP. SEED (<xref ref-type="bibr" rid="B6">Duan et al., 2013</xref>; <xref ref-type="bibr" rid="B35">Zheng and Lu, 2015</xref>) is a collection of EEG datasets provided by the BCMI laboratory. The dataset recorded 62 channels of EEG data at a sampling frequency of 1,000 Hz (200 Hz resampling) and collected 15 individuals (7 men and 8 women), as well as three kinds of emotional EEG data (positive, negative, and neutral). The size of the dataset is 3 &#x00D7; 15 &#x00D7; 15 &#x00D7; 62 &#x00D7; 4,800 (3 experiments, 15 videos/trials, 62 channels, and (200 Hz &#x00D7; 240 s) data). The DEAP (database for emotion analysis using physical signals) was collected by <xref ref-type="bibr" rid="B15">Koelstra et al. (2012)</xref> from Queen Mary University in London, the University of Twente in the Netherlands, the University of Geneva in Switzerland, and the Federal Institute of Technology in Switzerland. The dataset recorded 40 channels of physiological signals at a sampling frequency of 512 Hz (128 Hz resampling) and collected the data of four emotions (valence, arousal, dominion, and liking) of 32 people (16 men and 16 women). The size of the dataset was 32 &#x00D7; 40 &#x00D7; 40 &#x00D7; 8,064 (40 videos/trials, 40 channels, and 128 Hz &#x00D7; 63 s).</p>
</sec>
<sec id="S2.SS2">
<title>Data Preprocessing</title>
<p>Single-channel EEG signals can achieve strong results in attention state detection, sleep state detection, and identity recognition. <xref ref-type="bibr" rid="B27">Taran and Bajaj (2019)</xref> also obtained good results in emotion recognition through a single-channel signal. Inspired by this, this study combines the spatial distribution of the whole head electrode to preserve the integrity of cerebral cortex information. The data preprocessing is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption><p>Data preprocessing.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g001.tif"/>
</fig>
<p>First, the spatial information of different channels is fused, and the concept of a dynamic energy sequence is proposed as follows:</p>
<disp-formula id="S2.Ex1"><mml:math id="M1"><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>N</italic> represents the channels and <italic>s</italic>(<italic>t</italic>, <italic>i</italic>) is the value of time <italic>t</italic> in the <italic>i</italic>-th channel. The energy sequence projects the time sequence in multiple channels onto an equal-length energy sequence.</p>
<p>Assuming that the time signal of the <italic>i</italic>-th channel is<italic>s</italic>(<italic>t</italic>, <italic>i</italic>)and the noise is <italic>n</italic>(<italic>t</italic>, <italic>i</italic>), the noise and the signal space are independent of each other and distributed independently. Then, the time signal affected by the noise is as follows:</p>
<disp-formula id="S2.Ex2"><mml:math id="M2"><mml:mrow><mml:mrow><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The average value of the energy sequence is as follows:</p>
<disp-formula id="S2.Ex2a"><mml:math id="M3"><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mover accent="true"><mml:mi>s</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mover accent="true"><mml:mi>n</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="INEQ4"><mml:mrow><mml:mover accent="true"><mml:mi>s</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>represents the average value of the sequence and <inline-formula><mml:math id="INEQ5"><mml:mrow><mml:mover accent="true"><mml:mi>n</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the average value of the noise.</p>
<p>The variance of the energy series is as follows:</p>
<disp-formula id="S2.Ex3"><mml:math id="M4"><mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex3a"><mml:math id="M5"><mml:mo>=</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mover accent="true"><mml:mi>s</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mover accent="true"><mml:mi>n</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x007D;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex3b"><mml:math id="M6"><mml:mo>=</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo lspace="1.5pt">&#x007B;</mml:mo><mml:mrow><mml:mrow><mml:mo lspace="1.5pt" stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mover accent="true"><mml:mi>s</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mover accent="true"><mml:mi>n</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x007D;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex4"><mml:math id="M7"><mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>T</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex5"><mml:math id="M8"><mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Equations (2) and (3) show that the mean value of the energy sequence after noise influence is the same as that of the single-channel sequence, and the variance is 1/<italic>N</italic> of the single-channel sequence. In the traditional EEG sequence recognition process, each channel is extracted separately, and then it is recognized or trained. During the recognition process, the noise will be superimposed, and the noise interference is much greater than that of single-channel sequence noise. Therefore, the method of projecting the sequence of multiple channels to the energy sequence can effectively smooth the noise, avoid the noise superimposition effect caused by extracting the features of the single-channel sequence separately, and improve the robustness.</p>
<p>During the procedure of EEG signal processing, even if preprocessing methods are used, such as artifact removal, downsampling, filtering, and component decomposition, the EEG signal noise still remains. Therefore, this study ignores the asymmetry of the brain emotion processing function, regards brain emotion processing as an overall coordinated physiological response, projects the time sequences of multiple channels to the energy time sequence, and saves the cost of artificial feature extraction while retaining the original information as much as possible. In our later experiments, considering the different activation degrees of different channels, the contribution to the template is also different. Therefore, we divided the brain lobe into 4 regions, which are the left anterior region, right anterior region, left posterior region, and right posterior region. According to the conclusion in the study (<xref ref-type="bibr" rid="B20">Li et al., 2018</xref>; <xref ref-type="bibr" rid="B36">Zheng et al., 2019</xref>), the area with high emotional activation response is set with a high coefficient. The specific region division and coefficient setting are shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap position="float" id="T1">
<label>TABLE 1</label>
<caption><p>Regional division and coefficient setting.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left"></td>
<td valign="top" align="left">SEED</td>
<td valign="top" align="left">DEAP</td>
<td valign="top" align="center">a<sub><italic>i</italic></sub></td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="left">FP1,AF3,F7,F5,F3,F1,FT7, FC5,FC3,FC5,T7,C5,C3,C1</td>
<td valign="top" align="left">EP1,AF3,F7,F3, FC5,FC1,T7,C3</td>
<td valign="top" align="center"><inline-formula><mml:math id="INEQ6"><mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.4</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="left">FP2,AP4,F2,F4,F6,F8 FC2, FC4,FC6,FC8,FPZ,FZ,FCZ,CZ</td>
<td valign="top" align="left">FP2,AF4,F4,F8, FC2,FC6,Fz,Cz</td>
<td valign="top" align="center"><inline-formula><mml:math id="INEQ7"><mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.3</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="left">TP7,CP5,CP3,CP1,P7,P5,P3,P1, PO7,PO5,PO3,CB1,O1,CPZ,PZ,POZ,OZ</td>
<td valign="top" align="left">CP5,CP1,P7,P3, PO3,01,Pz,Oz</td>
<td valign="top" align="center"><inline-formula><mml:math id="INEQ8"><mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.2</mml:mn></mml:mrow></mml:math></inline-formula>.</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="left">CP2,CP4,CP6,TP8,P2,P4,P6,P8,PO4, PO6,PO8,CB2,O2,C2,C4,C6,C8</td>
<td valign="top" align="left">CP2,CP6,P4,P8, PO4,O2,C4,T8</td>
<td valign="top" align="center"><inline-formula><mml:math id="INEQ9"><mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:mrow></mml:math></inline-formula>.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Second, emotion is a continuous physiological and psychological process and state, and past emotional states may have an impact on the current emotions. To combine the time persistence of the emotional state and obtain the dynamic attributes of the emotional characteristics of EEG signals as much as possible, we introduced the time window variable <italic>t</italic><sub><italic>w</italic></sub> on the time axis. The moving time window method is used to intercept the sequence fragments from the time series. We calculated the energy sequence corresponding to the same time window.</p>
<p>For SEED, we intercepted the data from the 2nd min to the 3rd min, and for DEAP, we intercepted the data from the 4th to the 63rd min. The relevant data settings are shown in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<table-wrap position="float" id="T2">
<label>TABLE 2</label>
<caption><p>Data parameter setting.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Array name</td>
<td valign="top" align="center">SEED</td>
<td valign="top" align="center">DEAP</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Number of Channels</td>
<td valign="top" align="center">62</td>
<td valign="top" align="center">32</td>
</tr>
<tr>
<td valign="top" align="left">Length of time</td>
<td valign="top" align="center">60</td>
<td valign="top" align="center">60</td>
</tr>
<tr>
<td valign="top" align="left">Time window width</td>
<td valign="top" align="center">4s</td>
<td valign="top" align="center">4s</td>
</tr>
<tr>
<td valign="top" align="left">Time window move step</td>
<td valign="top" align="center">2s</td>
<td valign="top" align="center">2s</td>
</tr>
<tr>
<td valign="top" align="left">Number of time windows</td>
<td valign="top" align="center">29</td>
<td valign="top" align="center">29</td>
</tr>
<tr>
<td valign="top" align="left">Number of sample points in time window</td>
<td valign="top" align="center">800</td>
<td valign="top" align="center">512</td>
</tr>
<tr>
<td valign="top" align="left">Label type</td>
<td valign="top" align="center">2/3</td>
<td valign="top" align="center">2</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="S2.SS3">
<title>Dynamic Energy Feature Set</title>
<p>Based on the dynamic energy sequence, we extracted different types of features from each energy time sequence and then form the feature set according to the time sequence. The feature set formed by different types of features extracted from the dynamic energy sequence is a time-domain profile of multicomponent features, which can reflect the time-domain dynamic characteristics of EEG emotional signals and the complexity of the multicomponent structure. The pseudocode of the dynamic energy characteristic calculation is shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption><p>Pseudocode for computing dynamic energy feature set.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g002.tif"/>
</fig>
<p>In this study, seven kinds of time-domain features, three kinds of frequency-domain features, and three kinds of dynamical features are extracted.</p>
<sec id="S2.SS3.SSS1">
<title>Time-Domain Features</title>
<p>The EEG signal is a discrete sequence obtained by sampling a continuous signal according to a certain sampling frequency through an EEG device. Suppose that <italic>s</italic>(<italic>n</italic>) represents the EEG signal value obtained by sampling a certain electrode, <italic>n</italic> = 1, 2, 3 &#x2026; , <italic>N</italic>. <italic>N</italic> represents the total number of samples, &#x03BC;<sub><italic>s</italic></sub> represents the average value, and &#x03C3;<sub><italic>s</italic></sub> represents the SD.</p>
<list list-type="simple">
<list-item>
<label>(1)</label>
<p>The average value is calculated as follows:</p>
</list-item>
</list>
<disp-formula id="S2.Ex10"><mml:math id="M9"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(2)</label>
<p>The SD is calculated as follows:</p>
</list-item>
</list>
<disp-formula id="S2.Ex11"><mml:math id="M10"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:msqrt></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(3)</label>
<p>The first-order differential is calculated as follows:</p>
</list-item>
</list>
<disp-formula id="S2.Ex12"><mml:math id="M11"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The normalized first-order differential (<xref ref-type="bibr" rid="B34">Yao, 2015</xref>) is calculated as follows:</p>
<disp-formula id="S2.Ex13"><mml:math id="M12"><mml:mrow><mml:mover accent="true"><mml:msub><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mfrac></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(4)</label>
<p>The second-order differential is calculated as follows:</p>
</list-item>
</list>
<disp-formula id="S2.Ex14"><mml:math id="M13"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The normalized second-order differential is calculated as follows:</p>
<disp-formula id="S2.Ex15"><mml:math id="M14"><mml:mrow><mml:mover accent="true"><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>&#x00AF;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mfrac></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(5)</label>
<p>The instability index (<xref ref-type="bibr" rid="B16">Kroupi et al., 2011</xref>) is calculated as follows:</p>
</list-item>
</list>
<p><italic>s</italic>(<italic>n</italic>) is divided into <italic>M</italic> segments, and the mean value of each segment is calculated. The SD of these <italic>M</italic> mean values is defined as NSI.</p>
<list list-type="simple">
<list-item>
<label>(6)</label>
<p>The energy is calculated as follows:</p>
</list-item>
</list>
<disp-formula id="S2.Ex16"><mml:math id="M15"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msup><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(7)</label>
<p>The fractal dimension (<xref ref-type="bibr" rid="B1">Ansari-Asl et al., 2007</xref>) is calculated as follows:</p>
</list-item>
</list>
<p>We can express <italic>s</italic>(<italic>n</italic>) and <italic>n</italic> = 1, 2, 3 &#x2026; , <italic>N</italic> as <inline-formula><mml:math id="INEQ15"><mml:mrow><mml:mo stretchy="false">&#x007B;</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:mfrac><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula>, where <italic>m</italic> = 1, 2, 3 &#x2026; , <italic>k</italic> is the start time and <italic>k</italic> is the time interval, which can be seen as follows:</p>
<disp-formula id="S2.Ex17"><mml:math id="M16"><mml:mrow><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mi>k</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:mfrac><mml:mo>]</mml:mo></mml:mrow></mml:munderover><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="INEQ17"><mml:mover accent="true"><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula> denotes the mean of <italic>H</italic><sub><italic>m</italic></sub>(<italic>k</italic>).</p>
</sec>
<sec id="S2.SS3.SSS2">
<title>Frequency Domain Features</title>
<list list-type="simple">
<list-item>
<label>(1)</label>
<p>Hjorth parameters (<xref ref-type="bibr" rid="B4">Bo, 1970</xref>):</p>
</list-item>
</list>
<p>First, the EEG signal is transformed by a discrete Fourier transform (DFT). Then, the Hjorth parameters are calculated in theta (4&#x2013;7 Hz), alpha (8&#x2013;13 Hz), beta (14&#x2013;30 Hz), gamma (31&#x2013;50 Hz), and the full band.</p>
<p>The DFT is calculated as follows:</p>
<disp-formula id="S2.Ex19"><mml:math id="M17"><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mi>F</mml:mi><mml:mi>T</mml:mi><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:mfrac><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The activity is as follows:</p>
<disp-formula id="S2.Ex20"><mml:math id="M18"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The mobility is as follows:</p>
<disp-formula id="S2.Ex21"><mml:math id="M19"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:msqrt></mml:mrow></mml:math></disp-formula>
<p>The complexity is as follows:</p>
<disp-formula id="S2.Ex22"><mml:math id="M20"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(2)</label>
<p>Power spectrum and power spectral density:</p>
</list-item>
</list>
<p>In this study, the autoregressive model (AR mode) is used to estimate the power spectrum of EEG signals, and the process is as follows:</p>
<p><italic>s</italic>(<italic>n</italic>)is expressed by the difference equation as <inline-formula><mml:math id="INEQ20"><mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>,</p>
<p>where &#x03C9;(<italic>n</italic>)represents the white noise sequence with zero mean and <inline-formula><mml:math id="INEQ22"><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:math></inline-formula> variance. <italic>k</italic>represents the order of the AR model.</p>
<p>The transfer function of the AR model is as follows:</p>
<disp-formula id="S2.Ex23"><mml:math id="M21"><mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>The power spectrum is as follows:</p>
<disp-formula id="S2.Ex24"><mml:math id="M22"><mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:msup><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi mathvariant="normal">&#x03C9;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:msup><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mi mathvariant="normal">&#x03C9;</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow><mml:mo>&#x007C;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mfrac></mml:mrow></mml:math></disp-formula>
</sec>
<sec id="S2.SS3.SSS3">
<title>Dynamical Features</title>
<list list-type="simple">
<list-item>
<label>(1)</label>
<p>Approximate entropy (<xref ref-type="bibr" rid="B23">Pincus, 1991</xref>):</p>
</list-item>
</list>
<p>Constructing the vector <inline-formula><mml:math id="INEQ23"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi mathvariant="normal">&#x22EF;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, 1 &#x2264; <italic>i</italic> &#x2264; N-m + 1, <italic>N</italic> represents the length of the time series, <italic>m</italic> represents the embedded dimension, then counts the number of vectors <italic>C<sup>m</sup></italic>(<italic>i</italic>, <italic>r</italic>) similar to vector <inline-formula><mml:math id="INEQ26"><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <italic>r</italic> is the similarity tolerance. The method is as follows:</p>
<disp-formula id="S2.Ex25"><mml:math id="M23"><mml:mrow><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mn>1</mml:mn><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi/><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mn>0</mml:mn><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi/><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex26"><mml:math id="M24"><mml:mrow><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Now the formula is defined as follows:</p>
<disp-formula id="S2.Ex27"><mml:math id="M25"><mml:mrow><mml:mrow><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:msup><mml:mi>C</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex28"><mml:math id="M26"><mml:mrow><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>We can repeat the above steps to calculate &#x03A6;<sup><italic>m</italic> + 1</sup>(<italic>r</italic>); then, the approximate entropy is as follows:</p>
<disp-formula id="S2.Ex29"><mml:math id="M27"><mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mi>p</mml:mi><mml:mi>E</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mi>m</mml:mi></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item>
<label>(2)</label>
<p>Wavelet entropy (<xref ref-type="bibr" rid="B24">Sharma et al., 2015</xref>):</p>
</list-item>
</list>
<p>In this study, the DB4 wavelet transform is used to decompose the EEG signal in six levels, and then the Shannon entropy is extracted from the approximate component and the detail component.</p>
<list list-type="simple">
<list-item>
<label>(3)</label>
<p>Differential entropy (<xref ref-type="bibr" rid="B35">Zheng and Lu, 2015</xref>):</p>
</list-item>
</list>
<disp-formula id="S2.Ex30"><mml:math id="M28"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x222B;</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup></mml:mstyle><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mpadded width="+1.7pt"><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mpadded><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:msqrt></mml:mfrac></mml:mstyle><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mstyle scriptlevel="-1"><mml:mfrac><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:mn>2</mml:mn><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mpadded width="+1.7pt"><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mpadded><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:msqrt></mml:mfrac></mml:mstyle><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mstyle scriptlevel="-1"><mml:mfrac><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:mn>2</mml:mn><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mi mathvariant="normal">&#x03C0;</mml:mi><mml:mi>e</mml:mi><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
</sec>
</sec>
<sec id="S2.SS4">
<title>Feature Dimension Reduction</title>
<p>Feature dimension reduction includes feature extraction and feature selection, which is very important for recognition and classification. The effective dimensionality reduction method can not only improve the speed of the algorithm but also filter out irrelevant attributes and reduce the interference of irrelevant information with classification to improve the accuracy of the classification and prevent overfitting.</p>
<p>The basic idea of feature dimensionality reduction is to score each feature vector according to some evaluation function, rank the feature vectors according to the score value from high to low, and take some feature vectors with a high score value as a feature set. In this study, we considered the effectiveness of a single feature label and the information redundancy between multiple features. We adopted the method of combining mutual information (<xref ref-type="bibr" rid="B10">Hossain et al., 2014</xref>) and PCA (<xref ref-type="bibr" rid="B12">Ian and Jorge, 2016</xref>) to reduce dimensionality. The process is as follows:</p>
<p>Suppose that the feature space of the sample dataset <italic>X</italic> is <italic>R</italic><sup><italic>m</italic>&#x00D7;<italic>n</italic></sup>, each row of data <italic>X</italic><sub><italic>i</italic></sub> is (<italic>x</italic><sub><italic>i</italic>1</sub>, <italic>x</italic><sub><italic>i</italic>2</sub>, <italic>x</italic><sub><italic>i</italic>3</sub>, &#x22EF; <italic>x</italic><sub><italic>in</italic></sub>), and <italic>x</italic><sub><italic>ij</italic></sub> represents the <italic>j</italic>-th feature value of the <italic>i</italic>-th sample.</p>
<p>Step 1: Calculate the proportion of the value of the <italic>i</italic>-th sample on the <italic>j</italic>-th feature to the overall value of the <italic>j</italic>-th feature as follows:</p>
<disp-formula id="S2.Ex32"><mml:math id="M29"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:msubsup><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>Step 2: Calculate the information entropy of the <italic>i</italic>-th sample as follows:</p>
<disp-formula id="S2.Ex33"><mml:math id="M30"><mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Step 3: Calculate the mutual information matrix as follows:</p>
<disp-formula id="S2.Ex34"><mml:math id="M31"><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.Ex35"><mml:math id="M32"><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:munder><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>I</mml:mi><mml:mn>11</mml:mn></mml:msub></mml:mtd><mml:mtd columnalign="center"><mml:mi mathvariant="normal">&#x22EF;</mml:mi></mml:mtd><mml:mtd columnalign="center"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mi mathvariant="normal">&#x22EE;</mml:mi></mml:mtd><mml:mtd columnalign="center"><mml:mi mathvariant="normal">&#x22F1;</mml:mi></mml:mtd><mml:mtd columnalign="center"><mml:mi mathvariant="normal">&#x22EE;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd columnalign="center"><mml:mi mathvariant="normal">&#x22EF;</mml:mi></mml:mtd><mml:mtd columnalign="center"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Step 4: The matrix decomposition is as follows:</p>
<disp-formula id="S2.Ex36"><mml:math id="M33"><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:munder><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mi>B</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mi mathvariant="normal">&#x039B;</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where &#x039B; is the diagonal matrix composed of the eigenvalues (&#x03BC;<sub>1</sub>, &#x03BC;<sub>2</sub>, &#x22EF; &#x03BC;<sub><italic>n</italic></sub>) of &#x2211;<sub><italic>I<sub>xy</sub></italic></sub> and <italic>B</italic> is a matrix composed of eigenvectors (&#x03B2;<sub>1</sub>, &#x03B2;<sub>2</sub>, &#x22EF; , &#x03B2;<sub><italic>n</italic></sub>) corresponding to the eigenvalues.</p>
<p>Step 5: Calculate the contribution rate &#x03C3;<sub><italic>k</italic></sub> and the cumulative contribution rate &#x03B4;<sub><italic>k</italic></sub> as follows:</p>
<disp-formula id="S2.Ex37"><mml:math id="M34"><mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msub><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Step 6: Select new features.</p>
<p>The eigenvectors (&#x03B2;<sub>1</sub>, &#x03B2;<sub>2</sub>, &#x22EF; , &#x03B2;<sub><italic>l</italic></sub>) corresponding to the first <italic>k</italic> eigenvalues with 85&#x2013;95% contribution rates are selected as the principal component decision matrix. The new feature matrix is as follows:</p>
<disp-formula id="S2.Ex38"><mml:math id="M35"><mml:mrow><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:mrow></mml:math></disp-formula>
</sec>
<sec id="S2.SS5">
<title>The Network Structure</title>
<p>The network structure used in this study is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. The architecture consists of a Bi-LSTM network, a dropout layer, an LSTM network, and a full connection layer output.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption><p>Schematic diagram of network structure.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g003.tif"/>
</fig>
<sec id="S2.SS5.SSS1">
<title>Bidirectional Long Short-Term Memory</title>
<p>Bidirectional LSTM (Bi-LSTM) is based on LSTM (<xref ref-type="bibr" rid="B9">Hochreiter and Schmidhuber, 1997</xref>), which combines the information of the input sequence in both the forward and backward directions. In this study, the vector outputs by the two LSTM layers are connected and sent to the next layer. The Bi-LSTM is selected for the following reasons. First, mental emotion is a continuous physiological and psychological process and state. EEG signals are time-dependent. Therefore, emotion recognition of EEG signals may require the information of the whole input sequence, and the Bi-LSTM can better capture the context information in the sequence. Second, manual feature extraction is when the signal extracted from the EEG time series signals uses a sliding time window, which still belongs to a time series and can be modeled by the Bi-LSTM. Finally, for EEG signal recognition, the number of samples is small. Even when using data enhancement, it is difficult to train a good depth network model, and the Bi-LSTM is suitable for small datasets.</p>
</sec>
<sec id="S2.SS5.SSS2">
<title>Dropout</title>
<p>To prevent overfitting, the dropout layer (<xref ref-type="bibr" rid="B8">Hinton et al., 2012</xref>) is linked after the Bi-LSTM layer. In each iteration, the neuron is randomly output to zero according to the specified proportion.</p>
</sec>
<sec id="S2.SS5.SSS3">
<title>Long Short-Term Memory</title>
<p>To further extract features, the output data of the dropout layer is sent to the LSTM.</p>
<p>Parameter settings of the model are shown in <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<table-wrap position="float" id="T3">
<label>TABLE 3</label>
<caption><p>Model parameter setting.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Array name</td>
<td valign="top" align="center">SEED</td>
<td valign="top" align="center">DEAP</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Input_size</td>
<td valign="top" align="center">17</td>
<td valign="top" align="center">19</td>
</tr>
<tr>
<td valign="top" align="left">Bi-LSTM</td>
<td valign="top" align="center">128</td>
<td valign="top" align="center">128</td>
</tr>
<tr>
<td valign="top" align="left">Drop out</td>
<td valign="top" align="center">0.3</td>
<td valign="top" align="center">0.3</td>
</tr>
<tr>
<td valign="top" align="left">LSTM</td>
<td valign="top" align="center">64</td>
<td valign="top" align="center">64</td>
</tr>
<tr>
<td valign="top" align="left">Dense 1</td>
<td valign="top" align="center">128</td>
<td valign="top" align="center">128</td>
</tr>
<tr>
<td valign="top" align="left">Dense 2</td>
<td valign="top" align="center">3/2</td>
<td valign="top" align="center">3</td>
</tr>
<tr>
<td valign="top" align="left">Optimizer</td>
<td valign="top" align="center">RMSprop</td>
<td valign="top" align="center">RMSprop</td>
</tr>
<tr>
<td valign="top" align="left">Learning rate</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.001</td>
</tr>
<tr>
<td valign="top" align="left">Epochs</td>
<td valign="top" align="center">46</td>
<td valign="top" align="center">55</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="S3" sec-type="results">
<title>Results</title>
<p>To verify the feasibility and effectiveness of the proposed method, we performed four groups of experiments: comparison with traditional methods, feature type selection, individual emotion recognition, and comparison with other methods.</p>
<list list-type="simple">
<list-item>
<label>(1)</label>
<p>Comparison with traditional methods:</p>
</list-item>
</list>
<p>The experiment is carried out by using the feature extraction method proposed in this study. The contrast method is the traditional method of extracting features from a single-channel signal. The methods are as follows: extracting features from signals in each channel, then using PCA for dimension reduction, and finally using SVM for recognition. To input the features into the SVM model, the feature vectors are composed of the mean value of the corresponding eigenvalues in the time window. In this way, the time-domain dynamics are considered to a certain extent. The relevant parameters of SVM are as follows: the type is C-SVC, the kernel function is RBF, and the setting method of penalty coefficient is Scan the parameter space 2<sup>[&#x2013;3:8]</sup> in step 1 to search for the best value.</p>
<p>The experimental dataset is SEED, and positive and negative emotions are identified. The results are shown in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption><p>Comparison of recognition rates between proposed and traditional methods.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g004.tif"/>
</fig>
<p>In this study, we first obtained the energy sequence of each channel and then extracted features from the energy sequence. Therefore, the feature dimension of the energy sequence is 1/62 of that of the single channel. As seen in <xref ref-type="fig" rid="F4">Figure 4</xref>, the recognition rate of the proposed method is 72.5% and that of the traditional method is 72.2%, which shows that the proposed dynamic energy sequence can retain the characteristics of each channel of the EEG signal and effectively reduce the feature dimension.</p>
<list list-type="simple">
<list-item>
<label>(2)</label>
<p>Feature type selection:</p>
</list-item>
</list>
<p>In this study, the data of 6 subjects in the seed dataset are randomly selected. According to the feature extraction method in the &#x201C;Dynamic energy feature set&#x201D; section, 49 types of features are extracted. Then, the MIPCA method is used to analyze the feature set <italic>F</italic><sup>270&#x00D7;49</sup>. The cumulative contribution rate of the principal components is shown in <xref ref-type="fig" rid="F5">Figure 5</xref>. In <xref ref-type="fig" rid="F5">Figure 5</xref>, the <italic>x</italic>-axis represents the principal component serial number, and the <italic>y</italic>-axis represents the cumulative contribution rate. The <italic>y</italic>-axis red mark indicates that the cumulative contribution rate has reached 94.65, and the <italic>x</italic>-axis red mark indicates that the number of principal components when the cumulative contribution rate is 94.65. In our experiment, the principal components whose cumulative contribution rate is before 95% are selected to determine the final feature set. Considering that different subjects may have different suitable features, we conducted three experiments at random and conducted statistical analysis on the results. The final features are shown in <xref ref-type="table" rid="T4">Table 4</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption><p>Cumulative contribution rate of principal components.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g005.tif"/>
</fig>
<table-wrap position="float" id="T4">
<label>TABLE 4</label>
<caption><p>Top features contributing to the prediction of emotion using the MIPCA method for SEED.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Feature type</td>
<td valign="top" align="left">SEED</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Time domain features</td>
<td valign="top" align="left">1. The first-order differential, 2. The normalized first-order differential, 3. The second-order differential, 4. The normalized second-order differential, 5. Instability index, 6. Fractal dimension, 7. Hjorth-mobility, and 8. Hjorth-complexity</td>
</tr>
<tr>
<td valign="top" align="left">Frequency domain features</td>
<td valign="top" align="left">1. Hjorth-mobility (beta), 2. Hjorth-mobility (all), 3. Hjorth-complexity (beta), 4. Hjorth-complexity (all), 5. Maximum power spectrum (beta) frequency, and 6. Maximum power spectrum (all) frequency</td>
</tr>
<tr>
<td valign="top" align="left">Dynamical features</td>
<td valign="top" align="left">1. De-gamma, 2. De-all, and 3. Wavelet entropy (all)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen from <xref ref-type="table" rid="T4">Table 4</xref> that among the selected features, there are 8 time-domain features with the largest number. This shows that the time-domain features have a strong resolution. In the frequency domain, the features in beta, gamma, and all bands are better than those in other bands. This is consistent with the conclusion in the study by <xref ref-type="bibr" rid="B20">Li et al. (2018)</xref>. For the DEAP dataset, in addition to the features in <xref ref-type="table" rid="T4">Table 4</xref>, we added the wavelet entropy (gamma) and the power spectrum sum (all).</p>
<list list-type="simple">
<list-item>
<label>(3)</label>
<p>Emotion recognition:</p>
</list-item>
</list>
<p>In this study, we adopted two verification strategies, namely, leave one subject out (LOSO) and 10-fold cross validation (CV). For SEED, we classified two-dimensional emotions and three-dimensional emotions, and for DEAP, we identified the accuracy of arousal and valence. The results of SEED are shown in <xref ref-type="fig" rid="F6">Figure 6</xref>. <xref ref-type="fig" rid="F6">Figure 6A</xref> shows the recognition accuracy of two-dimensional emotion under the LOSO strategy. The average value of accuracy is 83.87%. <xref ref-type="fig" rid="F6">Figure 6B</xref> shows the recognition accuracy of three-dimensional emotion under the LOSO strategy. The average value of accuracy is 69.76%. <xref ref-type="fig" rid="F6">Figure 6C</xref> shows the recognition accuracy of two-dimensional emotion under the 10-fold CV strategy. <xref ref-type="fig" rid="F6">Figure 6D</xref> shows the recognition accuracy of three-dimensional emotion under the 10-fold CV strategy.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption><p>The results of the SEED datasets: <bold>(A)</bold> leave one subject out (LOSO) for the 2-classification. <bold>(B)</bold> LOSO for the 3-classification classes. <bold>(C)</bold> 10-fold CV for the 2-classification. <bold>(D)</bold> 10-fold CV for the 3-classification.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g006.tif"/>
</fig>
<p>The DEAP results are shown in <xref ref-type="fig" rid="F7">Figure 7</xref>. <xref ref-type="fig" rid="F7">Figure 7A</xref> shows the accuracy of arousal and valence under the LOSO strategy. The average value of arousal was 63.35% and the valence was 61.39%. <xref ref-type="fig" rid="F7">Figure 7B</xref> shows that the accuracy of arousal and valence is under the 10-fold CV strategy. The average value of arousal is 77.3%, and the valence is 75.7%. The results of <xref ref-type="fig" rid="F6">Figures 6</xref>, <xref ref-type="fig" rid="F7">7</xref> verify the effectiveness of our method.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption><p>The results of the DEAP dataset: <bold>(A)</bold> the result of LOSO and <bold>(B)</bold> the result of 10-fold CV.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-15-741086-g007.tif"/>
</fig>
<list list-type="simple">
<list-item>
<label>(4)</label>
<p>Comparison with other methods:</p>
</list-item>
</list>
<p>We compared the results obtained by the proposed method with other methods that adopt the same dataset and adopt the same verification strategy. The comparison results are shown in <xref ref-type="table" rid="T5">Table 5</xref>.</p>
<table-wrap position="float" id="T5">
<label>TABLE 5</label>
<caption><p>Comparison results.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Dataset</td>
<td valign="top" align="left">Method</td>
<td valign="top" align="center">No. of classes</td>
<td valign="top" align="center">Validation strategy</td>
<td valign="top" align="center">Accuracy</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">SEED</td>
<td valign="top" align="left">ApEn, PerEn, ShEn, etc. +SVM (<xref ref-type="bibr" rid="B20">Li et al., 2018</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">83.33%</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">ST-SBSSVM (<xref ref-type="bibr" rid="B32">Yang et al., 2019</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">89%</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Holo-FM/CNN + SVM (<xref ref-type="bibr" rid="B29">Topic and Russo, 2021</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">88.45%</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Differential entropy (<xref ref-type="bibr" rid="B36">Zheng et al., 2019</xref>)</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">60.93</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Our method</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">89.42%</td>
</tr>
<tr>
<td/>
<td valign="top" align="center"/><td valign="top" align="center">3</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">81.23%</td>
</tr>
<tr>
<td/>
<td valign="top" align="center"/><td valign="top" align="center">2</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">83.87</td>
</tr>
<tr>
<td/>
<td valign="top" align="center"/><td valign="top" align="center">3</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">69.76</td>
</tr>
<tr>
<td valign="top" align="left">DEAP</td>
<td valign="top" align="left">Holo-FM/CNN + SVM (<xref ref-type="bibr" rid="B29">Topic and Russo, 2021</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">V:76.61%<break/> A:77.72%</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">RGB Heat-map/CNN + ELM (S. <xref ref-type="bibr" rid="B26">Siddharth et al., 2019</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">V:71.09%<break/> A:72.58%</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">ApEn, PerEn, ShEn, etc. +SVM (<xref ref-type="bibr" rid="B20">Li et al., 2018</xref>)</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">59.06</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Our method</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">10-fold CV</td>
<td valign="top" align="center">V:75.78%<break/> A:77.34%</td>
</tr>
<tr>
<td/>
<td valign="top" align="center"/><td valign="top" align="center">2</td>
<td valign="top" align="center">LOSO</td>
<td valign="top" align="center">V:61.39%<break/> A:63.35%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="S4" sec-type="discussion">
<title>Discussion</title>
<p>In this study, we proposed the concept of an energy sequence to reduce the influence of noise caused by feature extraction and then construct a dynamic energy feature set including time-domain features, frequency domain features, and non-linear features. The network model adopts fully connected layers and LSTM networks, which are suitable for small datasets. In <xref ref-type="fig" rid="F1">Figure 1</xref>, for the dynamic energy sequence feature set + SVM, the recognition rate is 72.5%. For the traditional feature set + SVM, the recognition rate is 72.2%, which shows that the dynamic energy sequence can preserve the features of the EEG signal and effectively reduce the feature dimension. To further extract effective features, this study comprehensively considers the effectiveness of a single feature for labeling and the information redundancy between multiple features. Through the feature type selection experiment, 17 kinds of feature vectors were selected from the SEED dataset, and 19 kinds of feature vectors were selected from the DEAP dataset. Finally, to verify the feasibility of our method and to facilitate the comparison with advanced methods, this study selects two verification strategies, namely, LOSO and 10-fold CV. For the SEED dataset, with 2-classification with LOSO, in the study by <xref ref-type="bibr" rid="B20">Li et al. (2018)</xref>, the accuracy is 83.33%; in the study by <xref ref-type="bibr" rid="B32">Yang et al. (2019)</xref>, it is 89%; and in our method, it is 83.87%. For the 3-classification problem, in the study by <xref ref-type="bibr" rid="B36">Zheng et al. (2019)</xref>, the accuracy is 60.93%, and in our method, it is 69.76%. For the 2-classification with a 10-fold CV, in the study by <xref ref-type="bibr" rid="B29">Topic and Russo (2021)</xref>, the accuracy is 88.45%, and in our method, it is 89.42%. For the DEAP dataset, with 2-classification with LOSO, in the study by <xref ref-type="bibr" rid="B20">Li et al. (2018)</xref>, the average accuracy is 59.06%; for our method V, the average accuracy is 61.39%, and for A, it is 63.35%. With a 10-fold CV, the result of our method (V: 75.78%, A: 77.34%) is better than the result (V: 71.09%, A: 72.58%) in the study by <xref ref-type="bibr" rid="B26">Siddharth et al. (2019)</xref> and close to the result (V: 76.61%, A: 77.72%) in the study by <xref ref-type="bibr" rid="B29">Topic and Russo (2021)</xref>. Therefore, our method is effective. Emotion is a physiological and psychological activity state induced by internal or external stimuli. Although different scalp regions are affected by emotion, when emotion changes, EEG signals will change harmoniously as a whole. Therefore, this study analyses the synchronization of signals in different regions as a whole, which is consistent with the phenomenon that emotional changes will lead to the overall change of EEG signals. The limitation of this study is that taking all channel signals as a whole cannot verify the relationship between different regions and different emotions. In the future study, we will continue to study the noise problem in EEG signal analysis and processing, as well as the relationship between different regions and emotions.</p>
</sec>
<sec id="S5" sec-type="conclusion">
<title>Conclusion</title>
<p>In this study, the concept of an energy sequence is proposed, and it is verified through theory and experiment that an emotional recognition method based on an energy sequence can reduce the influence of noise and improve accuracy. In addition, due to the small size of the EEG dataset, this study uses the combination of traditional features and a Bi-LSTM deep network. Compared with other traditional methods and CNN deep neural models, this method can achieve higher average accuracy.</p>
</sec>
<sec id="S6" sec-type="data-availability">
<title>Data Availability Statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: <ext-link ext-link-type="uri" xlink:href="https://bcmi.sjtu.edu.cn/home/seed/downloads.html">https://bcmi.sjtu.edu.cn/home/seed/downloads.html</ext-link> and <ext-link ext-link-type="uri" xlink:href="http://www.eecs.qmul.ac.uk/mmv/datasets/deap/readme.html">http://www.eecs.qmul.ac.uk/mmv/datasets/deap/readme.html</ext-link>.</p>
</sec>
<sec id="S7">
<title>Author Contributions</title>
<p>MZ developed the method based on dynamic energy features, performed all the data analysis, and wrote the manuscript. QW advised data analysis and edited the manuscript. JL supervised and led the planning and implementation of research activities and revised the manuscript. All authors contributed to the article and approved the submitted version.</p>
</sec>
<sec id="conf1" sec-type="COI-statement">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="pudiscl1" sec-type="disclaimer">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
</body>
<back>
<sec id="S8" sec-type="funding-information">
<title>Funding</title>
<p>This study was supported by the Jilin Science and Technology Development Plan Project (Grant No. 20210201129GX) and the Young Academic Backbone Program Jilin Animation Institute.</p>
</sec>
<ack><p>The authors thank the editor and the reviewers for their useful feedback that improved this manuscript.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ansari-Asl</surname> <given-names>K.</given-names></name> <name><surname>Chanel</surname> <given-names>G.</given-names></name> <name><surname>Pun</surname> <given-names>T.</given-names></name></person-group> (<year>2007</year>). <source><italic>A channel selection method for EEG classification in emotion assessment based on synchronization likelihood.</italic></source> <publisher-loc>Kos island</publisher-loc>: <publisher-name>European Signal Processing Conference</publisher-name>.</citation></ref>
<ref id="B2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Atkinson</surname> <given-names>J.</given-names></name> <name><surname>Campos</surname> <given-names>D.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x201C;Improving BCI-based emotion recognition by combining EEG feature selection and kernel classifiers&#x201D;.</article-title> <source><italic>Expert Syst. With Applic.</italic></source> <volume>47</volume> <fpage>35</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2015.10.049</pub-id></citation></ref>
<ref id="B3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Banee</surname> <given-names>B. D.</given-names></name> <name><surname>Pradeep</surname> <given-names>K.</given-names></name> <name><surname>Debakanta</surname> <given-names>K.</given-names></name> <name><surname>Saswat</surname> <given-names>K. R.</given-names></name> <name><surname>Korra</surname> <given-names>S. B.</given-names></name> <name><surname>Ramesh</surname> <given-names>K. M.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x201C;A spatio-temporal model for EEG-based person identification&#x201D;.</article-title> <source><italic>Multimed. Tools Applic.</italic></source> <volume>78</volume> <fpage>28157</fpage>&#x2013;<lpage>28177</lpage>.</citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bo</surname> <given-names>H.</given-names></name></person-group> (<year>1970</year>). <article-title>&#x201C;EEG analysis based on time domain properties&#x201D;.</article-title> <source><italic>Electroencephalogr. Clin. Neurophysiol.</italic></source> <volume>29</volume> <fpage>306</fpage>&#x2013;<lpage>310</lpage>.</citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>W.</given-names></name> <name><surname>Chen</surname> <given-names>L. L.</given-names></name> <name><surname>Song</surname> <given-names>Z. Z.</given-names></name> <name><surname>Lou</surname> <given-names>X. G.</given-names></name> <name><surname>Li</surname> <given-names>D. D.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x201C;EEG-based emotion recognition using simple recurrent units network and ensemble learning&#x201D;.</article-title> <source><italic>Biomed. Signal Proc. Control</italic></source> <volume>58</volume>:<fpage>101756</fpage>. <pub-id pub-id-type="doi">10.1186/s12868-016-0283-6</pub-id> <pub-id pub-id-type="pmid">27534393</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Duan</surname> <given-names>R. N.</given-names></name> <name><surname>Zhu</surname> <given-names>J. Y.</given-names></name> <name><surname>Lu</surname> <given-names>B. L.</given-names></name></person-group> (<year>2013</year>). &#x201C;<article-title>Differential entropy feature for EEG-based emotion classification</article-title>,&#x201D; in <source><italic>International IEEE/EMBS Conference on Neural Engineering</italic></source> (<publisher-loc>New Jersey, NJ</publisher-loc>: <publisher-name>IEEE</publisher-name>).</citation></ref>
<ref id="B7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Golyandina</surname> <given-names>N.</given-names></name> <name><surname>Nekrutkin</surname> <given-names>V. V.</given-names></name> <name><surname>Zhigljavsky</surname> <given-names>A. A.</given-names></name></person-group> (<year>2001</year>). <source><italic>Analysis of Time Series Structure: SSA and related techniques.</italic></source> <publisher-loc>Boca Raton, FL</publisher-loc>: <publisher-name>CRC</publisher-name>.</citation></ref>
<ref id="B8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hinton</surname> <given-names>G. E.</given-names></name> <name><surname>Srivastava</surname> <given-names>N.</given-names></name> <name><surname>Krizhevsky</surname> <given-names>A.</given-names></name> <name><surname>Sutskever</surname> <given-names>I.</given-names></name> <name><surname>Salakhutdinov</surname> <given-names>R.</given-names></name></person-group> (<year>2012</year>). <article-title>&#x201C;Improving neural networks by preventing co-adaptation of feature detectors&#x201D;.</article-title> <source><italic>Comp. Sci.</italic></source> <volume>3</volume> <fpage>12</fpage>&#x2013;<lpage>223</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2017.2750679</pub-id> <pub-id pub-id-type="pmid">28981433</pub-id></citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hochreiter</surname> <given-names>S.</given-names></name> <name><surname>Schmidhuber</surname> <given-names>J.</given-names></name></person-group> (<year>1997</year>). <article-title>&#x201C;Long short-term memory&#x201D;.</article-title> <source><italic>Neural Comput.</italic></source> <volume>9</volume> <fpage>1735</fpage>&#x2013;<lpage>1780</lpage>.</citation></ref>
<ref id="B10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hossain</surname> <given-names>M. A.</given-names></name> <name><surname>Jia</surname> <given-names>X. P.</given-names></name> <name><surname>Pickering</surname> <given-names>M. R.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x201C;Subspace Detection Using a Mutual Information Measure for Hyperspectral Image Classification&#x201D;.</article-title> <source><italic>IEEE Geosci. Rem. Sens. Lett.</italic></source> <volume>11</volume> <fpage>424</fpage>&#x2013;<lpage>428</lpage>. <pub-id pub-id-type="doi">10.1109/lgrs.2013.2264471</pub-id></citation></ref>
<ref id="B11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hwang</surname> <given-names>S.</given-names></name> <name><surname>Hong</surname> <given-names>K.</given-names></name> <name><surname>Son</surname> <given-names>G. Y.</given-names></name> <name><surname>Byun</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x201C;Learning CNN features from DE features for EEG-based emotion recognition&#x201D;.</article-title> <source><italic>Pattern Anal. Applicat.</italic></source> <volume>23</volume> <fpage>1323</fpage>&#x2013;<lpage>1335</lpage>.</citation></ref>
<ref id="B12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ian</surname> <given-names>T. J.</given-names></name> <name><surname>Jorge</surname> <given-names>C.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x201C;Principal component analysis: a review and recent developments&#x201D;.</article-title> <source><italic>Philosop. Transac. R. Soc. A</italic></source> <volume>374</volume> <fpage>20150202</fpage>&#x2013;<lpage>20150202</lpage>. <pub-id pub-id-type="doi">10.1098/rsta.2015.0202</pub-id> <pub-id pub-id-type="pmid">26953178</pub-id></citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Isaac</surname> <given-names>F. V.</given-names></name> <name><surname>Elena</surname> <given-names>H. P.</given-names></name> <name><surname>Diego</surname> <given-names>A. E.</given-names></name> <name><surname>Vicente</surname> <given-names>M. B.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x201C;Combining machine learning models for the automatic detection of EEG arousals&#x201D;.</article-title> <source><italic>Neurocomputing</italic></source> <volume>268</volume> <fpage>100</fpage>&#x2013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2021.621493</pub-id> <pub-id pub-id-type="pmid">33679348</pub-id></citation></ref>
<ref id="B14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Klepl</surname> <given-names>D.</given-names></name> <name><surname>He</surname> <given-names>F.</given-names></name> <name><surname>Wu</surname> <given-names>M.</given-names></name> <name><surname>Marco</surname> <given-names>M. D.</given-names></name> <name><surname>Blackburn</surname> <given-names>D.</given-names></name> <name><surname>Sarrigiannis</surname> <given-names>P. G.</given-names></name></person-group> (<year>2021</year>). <article-title>Characterising Alzheimer&#x2019;s Disease with EEG-based Energy Landscape Analysis.</article-title> <source><italic>IEEE J. Biomed. Health Informat.</italic></source> <volume>2021</volume> <fpage>1</fpage>&#x2013;<lpage>1</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2021.3105397</pub-id> <pub-id pub-id-type="pmid">34406951</pub-id></citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Koelstra</surname> <given-names>S.</given-names></name> <name><surname>M&#x00FC;hl</surname> <given-names>C.</given-names></name> <name><surname>Soleymani</surname> <given-names>M.</given-names></name> <name><surname>Lee</surname> <given-names>J. S.</given-names></name> <name><surname>Yazdani</surname> <given-names>A.</given-names></name> <name><surname>Ebrahimi</surname> <given-names>T.</given-names></name><etal/></person-group> (<year>2012</year>). <article-title>&#x201C;DEAP: A Database for Emotion Analysis;Using Physiological Signals&#x201D;.</article-title> <source><italic>IEEE Transact. Affect. Comput.</italic></source> <volume>3</volume> <fpage>18</fpage>&#x2013;<lpage>31</lpage>.</citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kroupi</surname> <given-names>E.</given-names></name> <name><surname>Yazdani</surname> <given-names>A.</given-names></name> <name><surname>Ebrahimi</surname> <given-names>T.</given-names></name></person-group> (<year>2011</year>). &#x201C;<article-title>EEG correlates of different emotional states elicited during watching music videos</article-title>,&#x201D; in <source><italic>Affective Computing and Intelligent Interaction</italic></source> (<publisher-loc>Memphis, TN</publisher-loc>: <publisher-name>ACII</publisher-name>).</citation></ref>
<ref id="B17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krzemi&#x0144;ski</surname> <given-names>D.</given-names></name> <name><surname>Masuda</surname> <given-names>N.</given-names></name> <name><surname>Hamandi</surname> <given-names>K.</given-names></name> <name><surname>Singh</surname> <given-names>K. D.</given-names></name> <name><surname>Routley</surname> <given-names>B. C.</given-names></name> <name><surname>Zhang</surname> <given-names>J. X.</given-names></name></person-group> (<year>2020</year>). <article-title>Energy landscape of resting magnetoencephalography reveals fronto-parietal network impairments in epilepsy.</article-title> <source><italic>Network Neurosci.</italic></source> <volume>4</volume> <fpage>1</fpage>&#x2013;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.1162/netn_a_00125</pub-id></citation></ref>
<ref id="B18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>H. S.</given-names></name></person-group> (<year>2017</year>). <source><italic>Psychology of consciousness.</italic></source> <publisher-loc>Beijing</publisher-loc>: <publisher-name>China legal publishing house</publisher-name>.</citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Song</surname> <given-names>D. W.</given-names></name> <name><surname>Zhang</surname> <given-names>P.</given-names></name> <name><surname>Hou</surname> <given-names>Y. X.</given-names></name> <name><surname>Hu</surname> <given-names>B.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x201C;Deep fusion of multi-channel neurophysiological signal for emotion recognition and monitoring&#x201D;.</article-title> <source><italic>Int. J. Data Mining Bioinform.</italic></source> <volume>18</volume> <fpage>1</fpage>&#x2013;<lpage>27</lpage>.</citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Song</surname> <given-names>D. W.</given-names></name> <name><surname>Zhang</surname> <given-names>P.</given-names></name> <name><surname>Zhang</surname> <given-names>Y. Z.</given-names></name> <name><surname>Hou</surname> <given-names>Y. X.</given-names></name> <name><surname>Hu</surname> <given-names>B.</given-names></name></person-group> (<year>2018</year>). <article-title>Exploring EEG Features in Cross-Subject Emotion Recognition.</article-title> <source><italic>Front. Neurosci.</italic></source> <volume>12</volume> <fpage>162</fpage>&#x2013;<lpage>162</lpage>. <pub-id pub-id-type="doi">10.3389/fnins.2018.00162</pub-id> <pub-id pub-id-type="pmid">29615853</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohammadi</surname> <given-names>Z.</given-names></name> <name><surname>Frounchi</surname> <given-names>J.</given-names></name> <name><surname>Amiri</surname> <given-names>M.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x201C;Wavelet-based emotion recognition system using EEG signal&#x201D;.</article-title> <source><italic>Neural Comput. Applicat.</italic></source> <volume>28</volume> <fpage>1985</fpage>&#x2013;<lpage>1990</lpage>. <pub-id pub-id-type="doi">10.1109/EMBC46164.2021.9630188</pub-id> <pub-id pub-id-type="pmid">34891341</pub-id></citation></ref>
<ref id="B22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>K. S.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x201C;fNIRS-based brain-computer interfaces: a review&#x201D;.</article-title> <source><italic>Front. Hum. Neurosci.</italic></source> <volume>9</volume> <fpage>3</fpage>&#x2013;<lpage>3</lpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2015.00003</pub-id> <pub-id pub-id-type="pmid">25674060</pub-id></citation></ref>
<ref id="B23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pincus</surname> <given-names>S. M.</given-names></name></person-group> (<year>1991</year>). <article-title>&#x201C;Approximate entropy as a measure of system complexity&#x201D;.</article-title> <source><italic>Proc. Natl. Acad. Sci. U S A.</italic></source> <volume>88</volume> <fpage>2297</fpage>&#x2013;<lpage>2301</lpage>.</citation></ref>
<ref id="B24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R.</given-names></name> <name><surname>Pachori</surname> <given-names>R. B.</given-names></name> <name><surname>Acharya</surname> <given-names>U.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x201C;An Integrated Index for the Identification of Focal Electroencephalogram Signals Using Discrete Wavelet Transform and Entropy Measures&#x201D;.</article-title> <source><italic>Entropy</italic></source> <volume>17</volume> <fpage>5218</fpage>&#x2013;<lpage>5240</lpage>.</citation></ref>
<ref id="B25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shawky</surname> <given-names>E.</given-names></name> <name><surname>El-Khoribi</surname> <given-names>R.</given-names></name> <name><surname>Shoman</surname> <given-names>M. A. I.</given-names></name></person-group> (<year>2018</year>). <article-title>EEG-Based Emotion Recognition using 3D Convolutional Neural Networks.</article-title> <source><italic>Int. J. Adv. Comp. Sci. Applicat.</italic></source> <volume>9</volume>:<fpage>329</fpage>.</citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siddharth</surname> <given-names>S.</given-names></name> <name><surname>Jung</surname> <given-names>T. P.</given-names></name> <name><surname>Sejnowski</surname> <given-names>T. J.</given-names></name></person-group> (<year>2019</year>). <article-title>Utilizing Deep Learning Towards Multi-modal Bio-sensing and Vision-based Affective Computing.</article-title> <source><italic>IEEE Transact. Affect. Comput.</italic></source> <volume>2019</volume> <fpage>1</fpage>&#x2013;<lpage>1</lpage>.</citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taran</surname> <given-names>S.</given-names></name> <name><surname>Bajaj</surname> <given-names>V.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x201C;Emotion recognition from single-channel EEG signals using a two-stage correlation and instantaneous frequency-based filtering method&#x201D;.</article-title> <source><italic>Comp. Methods Prog. Biomed.</italic></source> <volume>173</volume> <fpage>157</fpage>&#x2013;<lpage>165</lpage>. <pub-id pub-id-type="doi">10.1016/j.cmpb.2019.03.015</pub-id> <pub-id pub-id-type="pmid">31046991</pub-id></citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tiwari</surname> <given-names>A.</given-names></name> <name><surname>Falk</surname> <given-names>T. H.</given-names></name></person-group> (<year>2019</year>). <article-title>Fusion of Motif- and Spectrum-Related Features for Improved EEG-Based Emotion Recognition.</article-title> <source><italic>Computat. Intellig. Neurosci.</italic></source> <volume>2019</volume>:<fpage>3076324</fpage>. <pub-id pub-id-type="doi">10.1155/2019/3076324</pub-id> <pub-id pub-id-type="pmid">30800157</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Topic</surname> <given-names>A.</given-names></name> <name><surname>Russo</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>Emotion recognition based on EEG feature maps through deep learning network.</article-title> <source><italic>Engine. Sci. Technol. Int. J.</italic></source> <volume>24</volume>:<fpage>12</fpage>.</citation></ref>
<ref id="B30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ullsperger</surname> <given-names>M.</given-names></name> <name><surname>Fischer</surname> <given-names>A. G.</given-names></name> <name><surname>Nigbur</surname> <given-names>R.</given-names></name> <name><surname>Endrass</surname> <given-names>T.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x201C;Neural mechanisms and temporal dynamics of performance monitoring&#x201D;.</article-title> <source><italic>Trends Cognit. Sci.</italic></source> <volume>18</volume> <fpage>259</fpage>&#x2013;<lpage>267</lpage>. <pub-id pub-id-type="doi">10.1016/j.tics.2014.02.009</pub-id> <pub-id pub-id-type="pmid">24656460</pub-id></citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>D.</given-names></name> <name><surname>Shang</surname> <given-names>Y.</given-names></name></person-group> (<year>2013</year>). <article-title>&#x201C;Modeling Physiological Data with Deep Belief Networks&#x201D;.</article-title> <source><italic>Int. J. Informat. Educ. Technol.</italic></source> <volume>3</volume> <fpage>505</fpage>&#x2013;<lpage>511</lpage>. <pub-id pub-id-type="doi">10.7763/IJIET.2013.V3.326</pub-id> <pub-id pub-id-type="pmid">25165501</pub-id></citation></ref>
<ref id="B32"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>F.</given-names></name> <name><surname>Zhao</surname> <given-names>X. C.</given-names></name> <name><surname>Jiang</surname> <given-names>W. G.</given-names></name> <name><surname>Gao</surname> <given-names>P. F.</given-names></name> <name><surname>Liu</surname> <given-names>G. Y.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x201C;Multi-method Fusion of Cross-Subject Emotion Recognition Based on High-Dimensional EEG Features&#x201D;.</article-title> <source><italic>Front. Computat. Neurosci.</italic></source> <volume>13</volume>:<fpage>53</fpage>. <pub-id pub-id-type="doi">10.3389/fncom.2019.00053</pub-id> <pub-id pub-id-type="pmid">31507396</pub-id></citation></ref>
<ref id="B33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>Y. L.</given-names></name> <name><surname>Wu</surname> <given-names>Q. F.</given-names></name> <name><surname>Qiu</surname> <given-names>M.</given-names></name> <name><surname>Wang</surname> <given-names>Y. D.</given-names></name> <name><surname>Chen</surname> <given-names>X. W.</given-names></name></person-group> (<year>2018</year>). <article-title>Emotion Recognition from Multi-Channel EEG through Parallel Convolutional Recurrent Neural Network.</article-title> <source><italic>Int. Joint Confer. Neural Netw.</italic></source> <volume>2018</volume>:<fpage>8489331</fpage>.</citation></ref>
<ref id="B34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yao</surname> <given-names>Z. P.</given-names></name></person-group> (<year>2015</year>). <source><italic>Calculus.</italic></source> <publisher-loc>Huazhong</publisher-loc>: <publisher-name>Huazhong Normal University press</publisher-name>.</citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zheng</surname> <given-names>W. L.</given-names></name> <name><surname>Lu</surname> <given-names>B. L.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x201C;Investigating Critical Frequency Bands and Channels for EEG-Based Emotion Recognition with Deep Neural Networks&#x201D;.</article-title> <source><italic>IEEE Transact. Autonom. Mental Dev.</italic></source> <volume>7</volume> <fpage>162</fpage>&#x2013;<lpage>175</lpage>.</citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zheng</surname> <given-names>W. L.</given-names></name> <name><surname>Zhu</surname> <given-names>J. Y.</given-names></name> <name><surname>Lu</surname> <given-names>B. L.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x201C;Identifying Stable Patterns over Time for Emotion Recognition from EEG&#x201D;.</article-title> <source><italic>IEEE Transact. Affect. Comp.</italic></source> <volume>10</volume> <fpage>417</fpage>&#x2013;<lpage>429</lpage>.</citation></ref>
</ref-list>
</back>
</article>
