A Novel Exploitative and Explorative GWO-SVM Algorithm for Smart Emotion Recognition
Abstract
Emotion recognition or detection is broadly utilized in patient-doctor interactions for diseases such as schizophrenia and autism and the most typical techniques are speech detection and facial recognition. However, features extracted from these behavior-based emotion recognitions are not reliable since humans can disguise their emotions. Recording voices or tracking facial expressions for a long term is also not efficient. Therefore, our aim is to find a reliable and efficient emotion recognition scheme, which can be used for non-behavior-based emotion recognition in real-time. This can be solved by implementing a single-channel electrocardiogram (ECG) based emotion recognition scheme in a lightweight embedded system. However, existing schemes have relatively low accuracy. For instance, the accuracy is about 82.78% by using a least squares support vector machine (SVM). Therefore, we propose a reliable and efficient emotion recognition scheme—exploitative and explorative grey wolf optimizer based SVM (X-GWO-SVM) for ECG-based emotion recognition. Two datasets, one raw self-collected iRealcare dataset, and the widely-used benchmark WESAD dataset are used in the X-GWO-SVM algorithm for emotion recognition. Leave-single-subject-out cross-validation yields a mean accuracy of 93.37% for the iRealcare dataset and a mean accuracy of 95.93% for the WESAD dataset. This work demonstrates that the X-GWO-SVM algorithm can be used for emotion recognition and the algorithm exhibits superior performance in reliability compared to the use of other supervised machine learning methods in earlier works. It can be implemented in a lightweight embedded system, which is much more efficient than existing solutions based on deep neural networks.
Index Terms:
Emotion recognition, IoT, Smart health, ECG signals, GWO, SVM.I Introduction
The use of the Internet of Things (IoT) is growing steadily over the years. It is expected that by 2025, there will be approximately 27 billion connected IoT devices [1]. At present, the IoT is one of the main promoters of technological innovation and one of the areas with greater potential for social and economic transformation [2, 3, 4]. Through a network of sensors and actuators connected to a wireless network [5, 6, 7, 8, 9, 10, 11, 12, 13, 14], the operator has the power to remotely gather data. Alternatively, actuators could be programmed to actuate automatically according to values reported by the sensor.
Emotion recognition or detection based on IoT wireless sensing and networking has gained lots of attention since it can be broadly utilized in interfaces between humans and computers and patient-doctor interactions for diseases such as schizophrenia and autism. Most emotion detection methods are based on behaviors such as speech detection and face recognition [15, 16]. However, features extracted from the abovementioned behavior-based emotion recognition are not adequate for identifying emotions, because the behavior induced by emotion can be disguised by artifacts of human social masking [17]. For example, emotion recognition based on facial expressions can be easily misled by a poker face. Using physiological signals, such as electroencephalograms (EEGs) [18, 19, 20], electromyograms (EMGs), and electrocardiograms (ECGs) [21], is an alternative to identify emotions since physiological signals are one of the most notable means to manifest the central nervous system in which emotions are processed [22].
Using physiological cues for emotion identification has two advantages over prior approaches to emotion recognition. The first is that physiological signals generated from automatic reactions are difficult to disguise. The second is that wearable emotion monitoring can continually record physiological information. This differs from the instance of voice recognition where data may only be recorded when individuals are speaking. However, using multi-channel biosignals to recognize human emotions is not suitable for practical applications because subjects may be hindered during daily life activities [23]. It has been proved that ECG signals are a suitable physiological channel with acceptable recognition abilities [17].
However, according to [24, 25, 26, 27], the accuracy of emotion detection based on a single ECG channel fluctuates a lot for various datasets compared to that of other approaches such as facial emotion recognition. On the one hand, recent efforts in emotion recognition using ECG signals have largely relied on relatively simple supervised learning techniques [28], such as random forest (RF), support vector machine (SVM), K-nearest neighbor (K-NN), etc. However, these methods have relatively low accuracy (for instance, the accuracy is about 82.78% [17] by using least squares SVM). On the other hand, the current maximum level of single ECG channel-based emotion recognition accuracy reaches 96.9% [29] for Wearable Stress and Affect Detection (WESAD) database and 88.2% [29] for a dataset for multi-modal research of affect, personality traits, and mood in individuals and groups (AMIGOS) [27], which utilizes self-supervised convolutional neural network (CNN) model. Facial emotion recognition accuracy achieves 92.07% [30] for MMI Facial Expression Database and 94.91% [30] for the Japanese Female Facial Expression Database, which uses CNN embedded with recurrent neural network (RNN) [26]. Nevertheless, these deep neural network-based techniques, e.g., CNN, RNN, etc, tend to achieve high accuracy but are complex with low computation efficiency, which cannot be implemented in a lightweight embedded system operating in real-time. Therefore, seeking a simple supervised learning scheme to accurately, stably, and efficiently recognize emotions based on a single ECG channel in a lightweight embedded system is necessary.
Towards this objective, this paper aims to develop a novel exploitative and explorative GWO-SVM (X-GWO-SVM) for ECG-based emotion recognition. The goal is to achieve good classification accuracy (as high as utilizing complex neural networks) while simultaneously reducing computation so that it can be implemented in a lightweight embedded system. The idea is motivated from the fact that the SVM algorithm can be used to solve single-channel ECG-based emotion recognition issue with lightweight embedded system implementation. However, the existing SVM works do not offer a good classification accuracy performance for ECG-based recognition due to difficulties in finding appropriate hyper-parameters while preventing overfitting of the training data.
In general, the selection of hyperparameters is a non-convex optimization issue. Therefore, many heuristic algorithms such as genetic algorithm (GA), particle swarm optimization (PSO), and grey wolf optimizer (GWO) [31, 32, 33, 34] are introduced to tackle it. Compared with PSO and a set of search algorithms, GWO provides better performance in computation reduction (e.g., in feature subset selection [35]). Moreover, the GWO approach has been demonstrated to be more stable against initialization than PSO and GA [35]. However, as discussed in [36], conventional GWO-based SVM (GWO-SVM) techniques are still easy to fall into local solutions.
In this work, an improved method, the X-GWO-SVM method, is proposed. The proposed X-GWO-SVM method is the first to apply GWO-SVM idea to solve ECG-based recognition, and as shown in this paper, this method has higher recognition accuracy than existing SVM and PSO-SVM techniques for ECG emotion recognition use. It can effectively avoid the algorithm falling into a local solution by increasing the exploration ability, and speed up the convergence by increasing the exploitation ability. In this paper, two datasets, one raw self-collected iRealcare dataset, and the widely used benchmark WESAD dataset are used in the X-GWO-SVM algorithm for emotion recognition. Leave-single-subject-out cross-validation yields a mean accuracy of 93.37% and an F1-score of 93.38% for the iRealcare dataset and a mean accuracy of 95.93% and an F1-score of 95.56% for the WESAD dataset.
The main contributions of this paper are summarized as follows:
-
1.
We use a self-built wearable IoT ECG patch with only one ECG channel to collect four emotions, i.e., happiness, tension, peacefulness and excitement, by playing different videos.
-
2.
We designed a novel X-GWO-SVM algorithm to internally learn hyperparameters on SVM. It can effectively avoid the algorithm falling into a local solution by increasing the exploration ability, and speed up the convergence by increasing the exploitation ability.
-
3.
This novel X-GWO-SVM algorithm can accurately and efficiently recognize emotions for single-channel ECG-based signals and be implemented in a lightweight embedded system operating in real-time. It improves accuracy compared to existing simple machine learning methods and dramatically reduces complexity compared to some novel deep neural networks. Thus, the efficiency is also increased compared to other time-consuming emotion recognition methods.
The outline of the rest of the paper is given below. Section II introduces our database and an expanded dataset. Our model formulation is described in Section III. In Sections IV and SectionV, we present results and discussions, respectively, before concluding with a discussion of potential future directions in Section VI.
II Dataset
ECG signals are composed of the P wave, T wave, and QRS complex, which represent the three phases of an ECG pulse. In atrial systole, the P wave is the contraction pulse. The QRS complex signifies ventricular depolarization. The T wave represents ventricular re-polarization [37]. An ECG device records the electrical changes caused by the activities of the heart, which are collected by electrodes over the skin for a period of time. It has been proved that ECG signals are a suitable physiological channel with acceptable recognition abilities [17] to identify emotions. Therefore, single-channel ECG signals are used in this study. In order to verify the general representation ability of X-GWO-SVM, two datasets of ECG signals are used, one raw self-collected iRealcare dataset with 5 subjects and the other widely-used benchmark WESAD dataset with 15 subjects.
II-A Description of iRealcare dataset
Data collection is one of the most important steps for emotion detection. The definition of different emotions must be explicit in this phase. If the definition is not clear, confusion may occur among different emotions in the classification phase and the classification performance will be influenced negatively. However, emotions normally instantaneously occur and hold for a short period. The longer the period is, the more irrelevant data is included in ECG signals. Thus, it is hard to properly label the corresponding emotion class.
To avoid the aforementioned issue, we self-collect a dataset with high quality and a short period for each emotion, making sure accurate data collection and labeling processes. The ECG signals are recorded by a low-cost wearable IoT ECG patch, called iRealcare [38, 39, 40, 41, 42] with 128 Hz sampling rates. The data collected by the iRealcare IoT ECG sensor can be transmitted to a smartphone application (APP) via Bluetooth Low Energy (BLE) and then to a cloud. From the cloud, we can acquire the raw ECG signals. Signals are recorded for four emotions including happiness, tension, peacefulness, and excitement. Except for peacefulness, each emotion is generated based on an external environmental stimulus, which is similar to the published datasets stimulating subjects through audio or video [43]. The peacefulness describes the normal state, for which the ECG signals are recorded without any external stimulus. Signals for happiness, tension, and excitement are recorded when subjects watch comedies, watch thriller movies and do exercises, respectively. Generally, the record duration should be short as we discussed before. Therefore, the record time is in a range of 3.22-6.16 minutes for each emotion.
It should be noticed that we only record the period that subjects are actually in that emotion condition and ignore the transition period. Clearly, the definition of different emotions under this external stimulus setting is clear and subjects are easy to get into a specific emotion. Taking into account differences among different subjects, 5 subjects are involved and each subject is recorded with four emotion types. For each subject, there are 192-229 samples for peacefulness, 99-141 samples for excitement, 156-236 samples for happiness and 166-205 samples for tension. More information on the iRealcare database is shown in Table I and segmentation details are described in Section III-A2.
ID Peacefulness duration/min Excitement duration/min Happiness duration/min Tension duration/min Total duration/min (Segment number) (Segment number) (Segment number) (Segment number) (Segment number) 1 5 ( 192 ) 3.22 ( 123 ) 6.16 ( 236 ) 4.33 ( 166 ) 18.71 ( 717 ) 2 5.23 ( 200 ) 3.63 ( 139 ) 5.42 ( 208 ) 4.48 ( 172 ) 18.76 ( 719 ) 3 5.37 ( 206 ) 3.69 ( 141 ) 4.91 ( 188 ) 5.35 ( 205 ) 19.32 ( 740 ) 4 5.98 ( 229 ) 3.65 ( 140 ) 4.51 ( 173 ) 4.7 ( 180 ) 18.84 ( 722 ) 5 5.06 ( 194 ) 2.59 ( 99 ) 4.07 ( 156 ) 4.66 ( 178 ) 16.39 ( 627 ) Sum 26.63 ( 1021 ) 16.78 ( 642 ) 25.08 ( 961 ) 23.52 ( 901 ) 92.01 ( 3525 )
II-B Description of WESAD dataset
The dataset, accessible in [43], is comprised of recordings of 15 subjects (aged 24–35) watching video clips and doing public speaking and mental arithmetic tasks. The dataset is recorded with a wrist-based device (including the following sensors: photoplethysmography, accelerometer, electrodermal activity, and body temperature) and a chest-based device (including the following sensors: ECG, accelerometer, electromyogram, respiration, and body temperature). This dataset offers a fusion of physiological parameters to efficiently identify human emotions, as these represent the body’s instinctive reactions. However, it is not suitable for practical applications, and it may hinder subjects during daily life activities [23]. Therefore, in this paper, we only study single ECG channel signals for this dataset. The ECG signal is acquired from a RespiBAN Professional using a three-lead configuration with 700 sampling rates. Three types of emotions (baseline, stress and amusement) are annotated by subjects [43]. Amusement condition signals are collected when subjects watch funny video clips. Stress condition signals are collected when subjects are asked to provide public speaking. Baseline condition signals are collected when subjects sit/stand at a table and read magazines. For each subject, there are 9 samples for amusement, 15-18 samples for stress, and 28-29 samples for baseline. The segmentation details are described in Section III-A2.
III Method
III-A Preprocessing
Normally, ECG signals are non-linear with low signal amplitudes. The frequency range of ECG signals is from 0.05 to 100 and the dynamic range is below 4 [44]. Thus, the collected ECG signals are susceptible to being disturbed by external factors such as interference. To acquire ECG signals with low interference, we conduct the pre-processing of the raw ECG signals. During the data collection and transmission stage, ECG signals are mainly affected by baseline drift, power line interference, and electrode contact noise. The baseline drift is caused by body movement and breathing. It can make the entire ECG signal shift down or up at the horizontal axis. The frequency of baseline drift is around 0.5 and it will influence the analysis of ECG signals. The power-line interference is characterized by 50 or 60, which can be caused by the electromagnetic field of nearby facilities and electromagnetic interference of the power lines. Since the iRealcare sensor used BLE instead of cables, the power-line interference will not affect the collected ECG signals from the sensor. The electrode contact noise is caused by the variance of impedance when the skin is stretched. This frequency is typically between 1 and 10 [45].
III-A1 Filtering
The finite impulse response (FIR) filter is used to filter the aforementioned noises. It is a reliable and simple filter. Moreover, the output of a FIR filter is not distorted because it is a linear filter [46]. FIR filters are created utilizing window-based techniques, such as the Hamming window, Rectangular window, Hanning window, and the Blackman window. These different windows are used to design the low pass filter and high pass filter with cut-off frequencies. For our band-pass FIR filter, the cut-off frequencies are set to 3 and 100, respectively.
III-A2 Segmentation and splitting
For the iRealcare dataset, the aforementioned 20 groups are denoised, non-overlapping segmented with 200 data points (1.56s), and then split into training and test sets. Non-overlapping is designated between segments to avoid any potential data leakage between training and test data. It should be noticed that the selection of the window size (200 data points) is empirical. Prior research employing these datasets utilized a broad variety of window sizes. For instance, [43] has chosen 5-second windows for WESAD whereas [47] has used 1-second windows for the same dataset. Specifically, the training set consists of 16 groups, each of which has four emotions, whereas the test set consists of 4 groups. Similar to the iRealcare dataset, the WESAD dataset is also filtered by a FIR filter, non-overlapping segmented with 14000 data points (20s), and then 12 subjects are treated as a training set while the rest 3 subjects form a test set.
Fig. 1 depicts four emotion segments with 200 randomly chosen ECG signal data samples from the iRealcare dataset. We can see that for the emotion of peacefulness, the subject’s heart rate is comparatively sluggish. However, it is hard to identify the other three emotions based on the original ECG signals. As a result, the design of an efficient feature extraction approach is necessitated.
III-A3 Discrete cosine transform (DCT)
In this paper, we use the DCT methods to extract the main information of ECG signals in the frequency domain [48]. It is computed for a compressed version of input ECG signals containing significant information, and only a small subset of the coefficients is maintained as a feature vector. The main merit of the DCT is its high computational speed which is suitable for data compression [49]. To improve performance, the -score normalization technique is invoked prior to recognition to account for small perturbations in motion artifacts caused by electrodes’ movement on the skin surface.

The DCT uses a sum of cosine functions at different frequencies to express finite data samples. It converts temporal signals into spectral signals. Eq. (1) defines the DCT formula for a data sequence , which is a Fourier transform without the conjugate portion.
(1) | |||
where
(2) |
and is the length of the data sequence [50].
During DCT, data samples from each ECG segment are translated into the frequency domain, generating a series of DCT coefficients with length . Then, the generated DCT coefficients are arranged in a decreasing order based on their absolute values. DCT coefficients with larger absolute values are treated as significant features which will be fed into the proposed X-GWO-SVM scheme. Descending DCT coefficients with dimension () can be selected as the extracted features. The determination of a proper dimension of extracted features will be discussed in Section IV by comparing classification performances at different values. Fig. 2 shows corresponding extracted features with dimension , i.e., coefficients with the largest 95 absolute values, from the aforementioned ECG segments (plotted in Fig. 1). It should be noticed that the first coefficient takes the highest energy (highlighted with red color), which stores the most significant features. To observe details on the rest coefficients, we zoom in the rest of coefficients (the to coefficients) for each emotion. Compared to the original ECG signals, the four emotions are clearly differentiated between segments following feature extraction.

III-B Exploitative and explorative grey wolf optimizer based support vector machine

For the first time, the X-GWO-SVM approach is proposed for ECG emotion identification in this work. The hyperparameter-free property of the proposed method provides a new way for radial basis function-based SVM (RBF-SVM) learning. In general, classifying the non-linearly separable data with RBF-SVM requires two hyperparameter which are considered—a penalty coefficient and a spacial parameter . The objective function of RBF-SVM with and introduced is expressed in Eqs. (3) and (4):
(3) | |||
(4) |
where is the number of training samples; is a slack variable which is added to relax the constraints of linear SVM; is the decision function; is the class label; is the sample; is the penalty parameter and it controls the trade-off between the size of the margin and the slack variable penalty; is a spacial parameter which controls data distribution in a new feature space [51, 52]. Obviously, hyperparameter ( and ) tuning for RBF-SVM is necessary but complex. Thus, the proposed method can internally learn hyperparameters by emphasizing the importance of the wolf and non-linearly updating coefficient vectors used in GWO. Moreover, this method has higher recognition accuracy than the existing GWO-SVM and PSO-SVM techniques for ECG emotion recognition use, and it can effectively avoid the algorithm falling into a local solution by increasing the exploration ability and speed up the convergence ability by increasing the exploitation ability.
Fig. 3 demonstrates our X-GWO-SVM method, which is inspired by the activity of grey wolves. There are 4 types of grey wolves, named alpha (), beta (), delta (), and omega (), simulating the leadership hierarchy. These wolves continuously search for prey, the optimal solution in our case, and hunting (optimization) is guided by the fittest solution, second and third best solutions, , and , respectively. The wolves follow these three wolves. A total number of search agents (wolves) is represented by . and are two elements of the searched optimal solution . The X-GWO-SVM method has 10 steps as described below.
-
1.
The X-GWO-SVM related parameters are initialized, i.e., maximum iteration ; the number of search agents ; positions of (), () and (); positions of search agents (wolves) . and are -dimensional vectors. In this case, is equal to , representing two optimal hyperparameters ( and ) required for search.
-
2.
If the current iteration time is less than the maximum iteration , go to the subsequent steps; otherwise, proceed directly to step 9).
-
3.
For each agent, train RBF-SVM with current position elements .
-
4.
Predict trained RBF-SVM with the test set for each agent and output its loss as a fitness value based on Eq. (5):
(5) where is the number of test samples and represents the predicted value for the test sample.
-
5.
Sort all fitness values in ascending order and assign positions which have the corresponding top three fitness values as , and , respectively. The mathematical expressions are
(6) (7) (8) -
6.
Update exploration-exploitation regulation function based on Eq. (9):
(9) -
7.
For each search agent, update its position based on following equations:
(10) (11) where and represent Hadamard product operation and element wise absolute value operations, respectively; is the iteration number; and its elements are all ones; and are coefficient vectors. The coefficients and are random vectors, where elements are in the range 0 to 1.
-
8.
Accumulate iterative time and go back to step 2).
-
9.
Output the optimal parameters and the trained SVM model.
-
10.
Calculate the classification accuracy of the model based on the test set and end the X-GWO-SVM algorithm.
We demonstrate improvements of the proposed X-GWO-SVM algorithm with respect to its exploration and exploitation ability in following two subsections.
III-B1 Exploration
Conventionally, components of are linearly decreased from 2 to 0 over the course of iterations [53], which models wolves approaching the prey. In our design, we set components of non-linearly decrease from 2 to 0 with slower declining rate near 2 and faster declining rate near 0 (referring to Eq. (9)). Fig. 4 (a) demonstrates the components of linearly (blue stars) and non-linearly (black circles) decreased from 2 to 0 over the course of iterations when the maximum iteration time is set to 100. Clearly, for the designed nonlinear decreasing method, we can observe that there is slow declining at the left side of the black dash line (iteration time = ), aiming to explore a larger range and increase exploration compared to the conventional linear way.
As discussed in [53], with random values greater than 1 or less than -1 is used to oblige the search agent to diverge from the prey, which emphasizes exploration and allows the X-GWO-SVM algorithm to search globally. It should be noticed that the fluctuation range of is also decreased under an effect of . Components of are random values in the interval , where components of are non-linearly decreased from 2 to 0 over the course of iterations [53]. Fig. 4 (b) shows a variation of when linear and nonlinear are applied. The blue and grey shadows indicate variation trends for when linear and nonlinear are applied, respectively. Obviously, the value of (black circles) for nonlinear applied has a larger range compared with the value of (blue stars) for linear at the left side of the black dash line, i.e., . In other words, the next search range for the fittest position in the nonlinear case smoothly attenuates before iteration reaches a threshold—94 in this figure, making sure a large exploration range.


III-B2 Exploitation (convergence)
In [53], when updating the positions, the weights for , , and wolves are all the same. While for our proposed approach, when updating the positions, we assign more weight to the wolf (referring to Eq. (10)), which emphasizes the importance of the wolf. Consequently, the fittest solution from the previous iteration can be retained and continually influences the subsequent updating step, ensuring a faster convergence.
We can observe from Fig. 4 (a) that, for the designed nonlinear decreasing method, there is a much faster decay at the right side of the black dash line. To clearly track the convergence of , red-filled circles are utilized for the nonlinear case after the iteration. The convergence tends to speed up as the iteration continuously increases, whereas, for the conventional linear decreasing method, the components of just evenly decrease from 2 to 0.
As we discussed before, the value of is influenced by the value of . Therefore, a similar phenomenon can be observed in Fig. 4 (b), where the value of converges much faster than the linear case at the right side of the black dash line, i.e., . In other words, the next search range for the fittest position in the nonlinear case dramatically decreases after iteration time reaches 94.
To sum up, the proposed X-GWO-SVM algorithm does not require hyperparameter tuning on SVM in order to get good accuracy. Additionally, it improves the way of updating position by involving the fittest position , which emphasizes the importance of the wolf and keeps the effect of the fittest solution for the next iteration. We also enhance the ability of exploitation by nonlinearly decreasing the value of . The algorithm improves its global search ability by increasing the exploration ability and speeds up the convergence ability by increasing the exploitation ability.
III-C Measurements
The classification performance of various methods can be evaluated by standard statistical measurements: accuracy (ACC) and F1-score (F1), defined as
ACC | (12) | |||
F1 | (13) | |||
REC | (14) |
where TP (true positive) is the number of samples correctly predicted as the current class; TN (true negative) means the number of correctly predicted as other classes; FP (false positive) indicates the number of samples incorrectly detected as the current class; FN (false negative) denotes the number of samples incorrectly detected as other classes. Accuracy is the general measurement of the correctly predicted ratio of the total testing samples for each dataset, indicating the method’s capability to classify emotions correctly. The F1-score, on the other hand, more accurately captures the ideal model for the unbalanced class distribution. The goal is to maximize these two measures as representations of effective models.
IV Results
IV-A Feature dimension selection
As aforementioned in Section III-A3, determination of a proper number of extracted features is necessary. Therefore, we perform feature importance selection in the range of 20 to 135 with step size 5 under the X-GWO-SVM method for iRealcare dataset. Each simulation result is repeated 10 times for random selection of training and test samples.
Fig. 7 illustrates the accuracy versus the dimension of the feature under the X-GWO-SVM algorithm with 10-fold cross-validation for the iRealcare dataset. Clearly, the recognition accuracy displays the tendency to rise up at the beginning and decline in late. The highest mean accuracy is 93.37% located at the feature dimension equal to 95. Moreover, its corresponding box plot (filled with orange color) has relatively low variance, indicating the stability of this feature dimension. After getting the most discriminative result with feature dimension 95, we apply it to other comparison methods.

IV-B Exploration-exploitation regulation function selection
As we demonstrated the significance of exploration-exploitation regulation function in Section III-B, various exploration-exploitation regulation functions are used in our experiments here to demonstrate that our choice of used in the X-GWO-SVM algorithm is the best. Expressions on them are shown in Eqs. (15) to (19) and these exploration-exploitation regulation functions are plotted in Fig 6. It should be noticed that the conventional linear exploration-exploitation regulation function, a benchmark, is expressed in Eq. (15). Additionally, the one we proposed in the X-GWO-SVM in Eq. (9) is rewritten as in Eq. (18).
(15) | ||||
(16) | ||||
(17) | ||||
(18) | ||||
(19) |
Based on Fig. 6, we can observe that both and are deformed from the Sigmoid function, which dramatically decrease from 2 to 0 at the beginning and the end of the iteration, respectively. The function and function successively alleviate this decreasing trend on a basis of function and , respectively.

To evaluate the effects of exploration-exploitation regulation function, we apply 10-fold cross-validation to the proposed X-GWO-SVM, varying exploration-exploitation regulation functions based on the aforementioned five functions. The evaluated results on exploration-exploitation regulation functions are shown in Table II for iRealcare dataset and Table III for WESAD dataset. Clearly, for iRealcare dataset, X-GWO-SVM combined with has the highest accuracy (93.37%) and F1-score (93.38%) among others. Moreover, the lowest variance and pretty low training time indicate its stability with low computation time. A similar conclusion can be derived for results on the WESAD dataset, where the highest accuracy (95.93%) and F1-score (95.56%) are from the combination of X-GWO-SVM with . To this end, we have determined the optimal feature dimension—95, and exploration-exploitation regulation function—. Therefore, later evaluations of the proposed X-GWO-SVM are based on these two settings.
Exploration-exploitation regulation function Mean(ACC) Var(ACC) Mean(F1)/% Training time/s 92.90 9.66E-05 92.91 429.98 93.05 6.10E-05 93.08 402.80 83.26 1.40E-02 83.50 509.66 93.37 2.84E-05 93.38 380.16 92.93 3.31E-05 92.94 368.14
Exploration-exploitation regulation function Mean(ACC) Var(ACC) Mean(F1)/% Training time/s 95.29 1.62E-04 95.07 856.31 95.79 7.48E-05 95.44 828.31 95.29 1.62E-04 95.07 825.14 95.93 5.61E-05 95.56 813.58 95.79 7.48E-05 95.44 835.40
IV-C Classification Performance of Proposed Model
IV-C1 Classification Performance for of iRealcare dataset
One may suspect that only one of the improvements on X-GWO-SVM can achieve a considerable performance. Thus, we investigate the other three methods: 1) using the GWO-SVM method, where none of the improvement on GWO is applied; 2) using the nonlinear based grey wolf optimizer (N-GWO-SVM) method, where only the nonlinearly decreasing value of is used; 3) using PSO-SVM method, where the conventional PSO algorithm is used for searching optimal hyperparameters.
Tables IV to VII show the classification performance for the hyperparameter optimizer-based techniques stated above. The following metrics are reported: accuracy, F1-score, variation of accuracy, and training duration of the schemes. All of them are calculated from 10 repeated classification trials for each scheme (rows in Tabs. IV to VII).
Scheme Peacefulness/% Excitement/% Happiness/% Tension/% PSO-SVM 83.20 84.87 95.40 91.13 GWO-SVM 84.07 97.67 94.73 91.40 N-GWO-SVM 84.60 97.93 94.33 91.27 X-GWO-SVM 86.03 98.03 95.07 94.33
Table IV shows that GWO-SVM performs significantly better than PSO-SVM for peacefulness (84.07% vs. 83.20%), excitement (97.67% vs. 84.87%), and tension (94.73% vs. 91.13%), but N-GWO-SVM only slightly improved performance on peacefulness (84.60%) and excitement (97.93%). Except for a slightly lower performance on happiness compared to the PSO-SVM scheme (95.07% vs 95.40%), the proposed X-GWO-SVM scheme provides a significant performance boost over others. It has the highest accuracy for peacefulness, excitement, and tension of 86.03%, 98.03%, and 94.33%, respectively. Table V presents similar results for the mean F1 score. The proposed X-GWO-SVM scheme provides a significant performance boost over others.
Scheme Peacefulness/% Excitement/% Happiness/% Tension/% PSO-SVM 85.29 82.46 91.07 94.45 GWO-SVM 84.19 97.87 90.77 93.57 N-GWO-SVM 84.59 97.99 91.03 93.36 X-GWO-SVM 87.73 98.31 91.23 96.24
Scheme Peacefulness Excitement Happiness Tension PSO-SVM 6.00E-04 7.17E-02 3.00E-04 3.00E-04 GWO-SVM 5.00E-04 2.00E-04 4.00E-04 1.10E-03 N-GWO-SVM 1.60E-03 2.00E-04 1.4E-04 3.00E-04 X-GWO-SVM 6.01E-04 6.04E-05 1.38E-04 7.65E-05
The variance result in Table VI suggests a similar conclusion. Compared to the conventional PSO-SVM scheme or GWO-SVM scheme, except for the variance on peacefulness (6.01E-04 vs 6.00E-04), our proposed method also shows the lowest variance of accuracy on excitement (6.04E-05), happiness (1.38E-04) and tension (7.65E-05), indicating its stability.
Scheme Mean(ACC)/% Mean(F1)/% Mean(Var) Training time/s PSO-SVM 88.65 88.32 1.82E-02 8824.80 GWO-SVM 91.97 91.60 5.50E-04 446.24 N-GWO-SVM 92.03 91.74 5.25E-04 446.42 X-GWO-SVM 93.37 93.38 2.19E-04 380.16
Table VII shows the mean accuracy, the mean variance and the mean training time of 10-fold cross-validation results. Note that, the proposed X-GWO-SVM scheme has the highest mean of class accuracy (93.37%), the highest mean of class f1-score (93.38%), the lowest mean of class variance (2.19E-04), and the shortest hyperparameter training time (380.16s). The results demonstrated its high reliability, stability, and efficiency.
Algorithm Mean(ACC)/% Mean(F1)/% Mean(Var) RF 81.71 82.35 1.56E-04 K-NN 82.48 81.22 7.35E-04 X-GWO-SVM 93.37 93.38 2.19E-04
To demonstrate the the significance of our X-GWO-SVM scheme, we also examine other nonparametric classification methods using similar features on the iRealcare dataset, such as RF and K-NN. The results are shown in Table VIII. All of them are calculated from 10 repeated classification trials for each scheme. It is apparent from the results that the X-GWO-SVM scheme has the highest accuracy performance. Actually, RF is more stable than the X-GWO-SVM, while its accuracy and F1-score are much lower than the proposed scheme (81.71% vs 93.37%, 82.35% vs 93.38%, respectively). In addition, the X-GWO-SVM completely outperforms K-NN in terms of reliability and stability. Overall, the proposed X-GWO-SVM strategy is more stable and more effective at achieving high mean accuracy on the iRealcare dataset than the existing methods.
IV-C2 Classification Performance for WESAD dataset
To demonstrate the reliability and stability of the proposed X-GWO-SVM method, we further examine it on the WESAD dataset in terms of accuracy and F1-score, compared with other existing methods. By applying the feature dimension selection in the range of 4000 to 10000 with step size 500 under the X-GWO-SVM approach as we described in Section IV-B, the best feature dimension is found to be 5000.
Fig. 7 illustrates the accuracy versus the dimension of the feature under the X-GWO-SVM algorithm with 10-cross validation for the WESAD dataset. Clearly, the recognition accuracy has a similar pattern to Fig. 6, in which it increases initially and decreases afterwards. The highest mean accuracy is 95.93% located at the feature dimension equal to 5000. The corresponding box plot has the highest accuracy—96.30%, the lowest accuracy—94.44%, and the mean F1-score—95.56%. Moreover, its corresponding box plot also has a relatively low mean variance (5.49E-05), indicating the stability of this feature dimension. The mean training time is 113.07s, in this case.
Table IX presents a comparison between the proposed classification scheme and the state-of-the-art methods published for single channel ECG-based emotion recognition methods on the WESAD dataset. The same testing dataset ensures that the comparison is persuasive and feasible. It can be observed from Table IX that the proposed classification approach outperforms all simple machine learning methods, such as RF, K-NN, linear discriminant analysis, and decision tree. Though slightly inferior to that of self-supervised CNN, the proposed X-GWO-SVM technique exhibits comparable classification performance among deep neural networks. However, considering the computation complexity, the proposed method is much simpler and more efficient than the self-supervised CNN. Our algorithm has successfully been loaded into a lightweight embedded system with a prediction time of 2.659ms per 200-points iRealcare sample and 4.648ms per 14000-points WESAD sample. Details on these results will be discussed in Section V-C3. Overall, the proposed X-GWO-SVM method achieves comparable accuracy and F1-score (Fig. 7 and Table IX ) among neural network-based deep learning classifiers on the WESAD dataset and has an overwhelming performance on other existing techniques.

Reference Year Method ACC/% F1/% RF 82.78 79.64 K-NN 79.19 75.39 Schmidt et al. [43] 2018 Linear discriminant analysis 85.44 81.31 AdaBoost Decision Tree 83.37 80.20 Decision Tree 80.17 77.01 Lin et al. [47] 2019 CNN 83.00 81.00 Sarkar et al. [29] 2020 Self-supervised CNN 96.90 96.30 Fully-supervised CNN 93.20 91.20 Proposed work —— X-GWO-SVM 95.93 95.56
V Discussion
The X-GWO-SVM algorithm, for the first time, is proposed and also the first time used in single channel ECG-based emotion recognition. By designing a suitable exploration-exploitation regulation function and updating technique, we are able to increase the exploration ability and exploitation ability with the proposed approach. Two ECG datasets are used: one raw self-collected iRealcare dataset and one credible WESAD dataset. The X-GWO-SVM technique effectively avoids the algorithm from falling into a local solution; hence, it has a greater recognition accuracy than the existing GWO-SVM and PSO-SVM techniques for ECG emotion recognition.
The algorithm enables accurate, stable, and efficient emotion recognition based on single-channel ECG-based signals, which fills a gap for GWO-SVM research on ECG-based emotion recognition and also has the potential for clinical use.
V-A Evaluation of datasets
Despite the restricted number of subjects in the iRealcare dataset, the number of samples for each subject is sufficient since the time of data collection for each emotion is sufficient. It is true that the WESAD dataset contains a larger number of subjects; however, the sample length required for this dataset to achieve high accuracy, which is 14000, drastically reduces the actual number of samples, for example, 9 samples for each subject on amusement, 15-18 samples for each subject on stress, and 28-29 samples for each subject on the baseline. On the contrary, the sample length required for the iRealcare dataset to achieve high accuracy, which is only 200. Therefore, the number of samples for the iRealcare dataset is much larger than the one in the WESAD dataset.
The reason for the caused aforementioned situation might come from the way of giving external stimulus and recording data. For the iRealcare dataset, ECG signals for happiness, tension, and excitement are recorded when subjects watch comedies, watch thriller movies and do exercises, respectively. It should be noticed that emotions normally instantaneously occur and hold for a short period. Therefore, we only record the period that subjects are actually in that emotion condition and ignore the transition period. Clearly, the definition of different emotions under this external stimulus setting is clear and subjects are easy to get into a specific emotion. However, for the WESAD dataset, amusement condition signals are collected when subjects watch funny video clips; stress condition signals are collected when subjects are asked to provide public speaking and mental arithmetic tasks; baseline condition signals are collected when subjects sit/stand at a table and read magazines. In fact, subjects tend to take some time to transfer from one emotion condition to the other. However, such a transition period is also recorded in the WESAD dataset. Thus, the sample length need to be long enough to make sure not just the transition period is included. The shorter the time, the more probable it is that only transitional periods will be included in the sample.
To sum up, in spite of the fact that the iRealcare dataset has limited subjects, the actual number of samples is much larger than the one in the WESAD dataset. Moreover, due to the exclusive emotion transition period for the WESAD dataset, the selection of sample length for the iRealcare dataset is more flexible than the WESAD dataset. We use the widely-used WESAD dataset as a benchmark for further comparison to validate our proposed X-GWO-SVM algorithm.
V-B Evaluation of exploration-exploitation regulation function selection
We study the impact of exploration-exploitation regulation functions on emotion recognition performance. For this study, we select possible base functions that control the significance of each exploration-exploitation regulation function as listed in Eqs. (15) to (19). Table II and Table III show the emotion recognition performance for five exploration-exploitation regulation functions on the iRealcare dataset and WESAD dataset, respectively. This analysis provides in-depth insight into the effect of the exploration-exploitation regulation functions associated with the emotion recognition outcome. Furthermore, this analysis helps us narrow down the most suitable exploration-exploitation regulation function in order to achieve the best performance.
As we mentioned in Section III-B, the declining rate of the exploration-exploitation regulation function at the beginning and end with respect to the iteration time represents the exploration and exploitation ability of the proposed X-GWO-SVM. From Table II and Table III, we notice that for the exploration-exploitation regulation function , where the function is formed on a basis of the sigmoid function, the model performance on emotion recognition is poor since it is under-explored and under-exploited. However, for those exploration-exploitation regulation functions lying above the benchmark function , the model shows significantly better performance. Interestingly, the performance drops when exploration-exploitation regulation functions decline too fast () or too slow (). The function gives the highest performance for emotion recognition compared to others since it has the most suitable diverging and converging performance to the X-GWO-SVM algorithm. Moreover, the fact that outperformed other functions for both datasets is also indicative of its stability.
In summary, the analysis above shows that for all the exploration-exploitation regulation functions, when the declining rate of the function at the beginning is too large or too small, for example, or , emotion recognition accuracy drops due to the under-exploration or over-exploration. This results in the X-GWO-SVM more easily falling into local solutions. Similarly, when the declining rate of the function at the end is too large or too small, or , the performance also drops due to the under-exploitation or over-exploitation in such cases becomes too difficult for the algorithm to properly find the global solution. Hence, we conclude that there is a trade-off between exploration and exploitation for the exploration-exploitation regulation functions associated with the proposed X-GWO-SVM algorithm, for which the proper exploration-exploitation regulation function is applied resulting in avoiding falling into local solutions.
V-C Evaluation of reliability, stability and efficiency of X-GWO-SVM
This section discusses the performance of X-GWO-SVM for emotion recognition in terms of reliability, stability, and efficiency.
V-C1 Reliability
In our work, when only fusing exploration-exploitation regulation function with GWO-SVM, i.e., N-GWO-SVM, the classification accuracy and F1-score get improved (referring to Table IV, Table V and Table VII). This improvement indicates that involving a nonlinear exploration-exploitation regulation function can improve the recognition performance. Similarly, the classification accuracy and F1-score get further enhanced when the importance of the wolf is emphasized, i.e., X-GWO-SVM, which shows the equivalent importance of the improvement on the X-GWO-SVM.
The classification performance of X-GWO-SVM is superior to the classification performance of other hyperparameter optimizer-based systems, such as PSO-SVM and GWO-SVM. This indicates the high reliability of the proposed algorithm over existing common hyperparameter optimizer-based schemes. Furthermore, the X-GWO-SVM has the highest accuracy and F1-score among simple machine learning methods, such as RF, K-NN, decision tree, and linear discriminant analysis (Table VIII and Table IX). Our analysis indicates that the X-GWO-SVM is more effective than simple machine learning approaches at avoiding local solutions. For the deep learning neural networks, such as CNN, the X-GWO-SVM can still outperform them except for a more complex single—self-supervised CNN [29]. Though the accuracy and F1-score of the X-GWO-SVM are slightly lower than the one from the self-supervised CNN, considering the efficiency, which will be discussed in Section V-C3, our algorithm is still competitive.
V-C2 Stability
The variance of the proposed method and existing works is computed to evaluate the stability of the methods. All simulation results are applied with 10-fold cross-validation. Similar to the discussion in Section V-C1, the X-GWO-SVM is the most stable algorithm among existing common hyperparameter optimizer-based schemes. Besides, similar results on both the iRealcare dataset and the WESAD dataset also indicate the stability of the proposed method.
V-C3 Efficiency
Our works are implemented through both MATLAB version R2021b and Python 3.7 for feature extraction, model training, and prediction. For MATLAB, the computation is performed on a laptop with 11th Gen Intel(R) Core(TM) i7-11800H (2.2GHz and 32GB of RAM). The computation time for classifying a 200-points (1.56s) iRealcare sample and a 14000-points (20s) WESAD sample roughly spends 0.355ms and 0.778ms, respectively, using our proposed method. For Python, the computation is performed in JETSON NANO with Quad-core ARM Cortex-A57 MPCore Processor (1.43GHz and 4GB of RAM). The computation time for classifying a 200-points (1.56s) iRealcare sample and a 14000-points (20s) WESAD sample roughly spends 2.659ms and 4.648ms, respectively, using our proposed method.
Compared with the self-supervised CNN, a deep neural network, the proposed X-GWO-SVM is much simpler. The two-step self-supervised architecture involves deep convolutional blocks and several fully connected layers in [29], which may not be realized in lightweight embedded systems. Whereas, our algorithm has successfully been loaded into JETSON NANO, an embedded system-on-module and developer kit with a prediction time of 2.659ms per 200-points iRealcare sample and 4.648ms per 14000-points WESAD sample. This provides a way to embed an ECG patch with the proposed algorithm, achieving edge computing for emotion recognition on ECG signals.
Moreover, the X-GWO-SVM is the most efficient algorithm among existing common hyperparameter optimizer-based schemes, which is evaluated by the training time. The other interesting point that can be found in Table VII is that all GWO-SVM-based techniques take shorter training time than the PSO-SVM work, which is compatible with [35]’s conclusion.
V-D Limitations and future directions
The possible limitation of the current study would be that we only investigate four exploration-exploitation regulation functions, i.e., , , , and . Moreover, the dataset we collected is still insufficient and other existing published datasets, e.g., AMIGOS [27], Augsburg Biosignal Toolbox (AuBT) [54], etc., have not been verified by the proposed X-GWO-SVM algorithm. In future work, we will use other exploration-exploitation regulation functions for the proposed algorithm to explore their effectiveness in emotion recognition. Additionally, more published datasets will be examined by our method.
Besides, through the results and conclusions reported in [29], we also observed that deep learning is competitive in emotion recognition, which may further improve the performance of our proposed strategy. Thus in our future work, we will try to find an effective deep learning method and embedded GWO methods to further improve emotion recognition performance.
VI Conclusion
In this paper, we presented an X-GWO-SVM technique that improves the exploration and exploitation abilities of single channel ECG-based emotion recognition. In order to classify different emotions, this research used two reliable datasets: one trustworthy WESAD dataset and one raw self-collected iRealcare dataset. The single channel ECG signals could well be employed in the X-GWO-SVM algorithm for emotion recognition, according to 10-fold cross-validation results from 5 subjects for the iRealcare dataset and 15 subjects for the WESAD dataset. The algorithm performed better than past efforts that used various supervised machine learning techniques. It also provides a way to implement in the lightweight embedded system, which is much more efficient than existing solutions of using deep neural networks. The method has the potential to be used in clinical settings and also fills a gap in GWO-SVM research on ECG-based emotion identification. In our future work, we will apply radio sensing techniques, such as [42, 55, 56, 57, 58], instead of wearable devices for emotion recognition. We will also develop privacy preservation algorithms [59, 60, 61, 62] to protect the users’ privacy.
References
- [1] https://iot-analytics.com/number-connected-iot-devices/
- [2] J. Leng, Z. Lin and P. Wang,”An implementation of an internet of things system for smart hospitals”,2020 IEEE/ACM Fifth International Conference on Internet-of-Things Design and Implementation (IoTDI), 254–255, 2020.
- [3] D. Zhai, H. Chen, Z. Lin. Y. Li and B. Vucetic, “Accumulate Then Transmit: Multi-user Scheduling in Full-Duplex Wireless-Powered IoT Systems”, IEEE Internet of Things Journal, Volume: 5 , Issue: 4 , Aug. 2018.
- [4] J. Wang, B. Li, G. Wang, Z. Lin, H. Wang, and G. Chen, Optimal Power Splitting for MIMO SWIPT Relaying Systems with Direct Link in IoT Networks, Physical Communication, Volume 43, December 2020.
- [5] Z Lin, B Vucetic, ”Power and rate adaptation for wireless network coding with opportunistic scheduling”, 2008 IEEE International Symposium on Information Theory, 21-25
- [6] T Ding, M Ding, G Mao, Z Lin, AY Zomaya, D López-Pérez, ”Performance analysis of dense small cell networks with dynamic TDD”, IEEE Transactions on Vehicular Technology 67 (10), 9816-9830, 2018.
- [7] P Wang, G Mao, Z Lin, X Ge, BDO Anderson, ”Network coding based wireless broadcast with performance guarantee”, IEEE Transactions on Wireless Communications 14 (1), 532-544, 2014.
- [8] K Pang, Z Lin, Y Li, B Vucetic,”Distributed network-channel codes design with short cycles removal”, IEEE Wireless Communications Letters 2 (1), 62-65, 2012.
- [9] J. Yue; Z. Lin; B. Vucetic; G. Mao; M. Xiao; B. Bai; K. Pang, ”Network Code Division Multiplexing for Wireless Relay Networks,” IEEE Transactions on Wireless Communications, vol.14, no.10, pp.5736-5749, Oct. 2015.
- [10] J. Yue, Z. Lin, B. Vucetic, G. Mao, T. Aulin, ”Performance analysis of distributed raptor codes in wireless sensor networks”, IEEE Transactions on Communications 61 (10), 2013, 4357-4368
- [11] P. Wang, G. Mao, Z. Lin, M Ding, W. Liang, X. Ge, Z. Lin, ”Performance analysis of raptor codes under maximum likelihood decoding”, IEEE Transactions on Communications 64 (3), 2016, 906-917
- [12] K. Pang, Z. Lin, Y. Li, B. Vucetic, ”Joint network-channel code design for real wireless relay networks”, the 6th International Symposium on Turbo Codes & Iterative Information, 2010, 429-433.
- [13] Z. Lin, A. Svensson, ”New rate-compatible repetition convolutional codes”, IEEE Transactions on Information Theory 46 (7), 2651-2659
- [14] Z. Lin, “Design of Network Coding Schemes in Wireless Network”, CRC Press Taylor & Francis. Books, ISBN: 9781032067766, June 2022
- [15] F. Yu, E. Chang, Y.-Q. Xu, and H.-Y. Shum, “Emotion detection from speech to enrich multimedia content,” in Proceedings of the Pacific-Rim Conference on Multimedia, 2001, pp. 550–557.
- [16] L. C. De Silva, T. Miyasato, and R. Nakatsu, “Facial emotion recognition using multi-modal information,” in Proceedings of 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications, vol. 1, 1997, pp. 397–401.
- [17] Y.-L. Hsu, J.-S. Wang, W.-C. Chiang, and C.-H. Hung, “Automatic ECG-based emotion recognition in music listening,” IEEE Transactions on Affective Computing, vol. 11, no. 1, pp. 85–99, 2017.
- [18] X. Yan, D. Yang, Z. Lin, and B. Vucetic, “Significant low-dimensional spectral-temporal features for seizure detection,” IEEE Transactions on Neural Systems and Rehabilitation Engineering, vol. 30, pp. 668–677, 2022.
- [19] W. Meng, Y. Cai, L. T. Yang, and W.-Y. Chiu, “Hybrid emotion-aware monitoring system based on brainwaves for internet of medical things,” IEEE Internet of Things Journal, vol. 8, no. 21, pp. 16 014–16 022, 2021.
- [20] Y. Du, J. Liu, X. Wang, and P. Wang, “Ssvep based emotion recognition for iot via multiobjective neural architecture search,” IEEE Internet of Things Journal, pp. 1–1, 2022.
- [21] M. U. Zahid, S. Kiranyaz, T. Ince, O. C. Devecioglu, M. E. Chowdhury, A. Khandakar, A. Tahir, and M. Gabbouj, “Robust r-peak detection in low-quality holter ecgs using 1d convolutional neural network,” IEEE Transactions on Biomedical Engineering, vol. 69, no. 1, pp. 119–128, 2021.
- [22] J. T. Cacioppo, L. G. Tassinary, and G. Berntson, Handbook of Psychophysiology. Cambridge University Press, 2007.
- [23] F. Agrafioti, D. Hatzinakos, and A. K. Anderson, “ECG pattern analysis for emotion detection,” IEEE Transactions on Affective Computing, vol. 3, no. 1, pp. 102–115, 2012.
- [24] Z. Cheng, L. Shu, J. Xie, and C. P. Chen, “A novel ECG-based real-time detection method of negative emotions in wearable applications,” in Proceedings of 2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC), 2017, pp. 296–301.
- [25] D. Reney and N. Tripathi, “An efficient method to face and emotion detection,” in Proceedings of 2015 fifth International Conference on Communication Systems and Network Technologies, 2015, pp. 493–497.
- [26] B. C. Ko, “A brief review of facial emotion recognition based on visual information,” Sensors, vol. 18, pp. 401–401, 2018.
- [27] L. Shu, J. Xie, M. Yang, Z. Li, Z. Li, D. Liao, X. Xu, and X. Yang, “A review of emotion recognition using physiological signals,” Sensors, vol. 18, no. 7, pp. 2074–2074, 2018.
- [28] M. A. Hasnul, N. A. A. Aziz, S. Alelyani, M. Mohana, and A. A. Aziz, “Electrocardiogram-based emotion recognition systems and their applications in healthcare—a review,” Sensors, vol. 21, no. 15, pp. 5015–5015, 2021.
- [29] P. Sarkar and A. Etemad, “Self-supervised ECG representation learning for emotion recognition,” IEEE Transactions on Affective Computing, pp. 1–1, 2020.
- [30] N. Jain, S. Kumar, A. Kumar, P. Shamsolmoali, and M. Zareapoor, “Hybrid deep neural networks for face emotion recognition,” Pattern Recognition Letters, vol. 115, pp. 101–106, 2018.
- [31] J. Wainer and P. Fonseca, “How to tune the RBF SVM hyperparameters? an empirical evaluation of 18 search algorithms,” Artificial Intelligence Review, vol. 54, pp. 4771–4797, 2021.
- [32] J. Zhou, S. Huang, M. Wang, and Y. Qiu, “Performance evaluation of hybrid GA–SVM and GWO–SVM models to predict earthquake-induced liquefaction potential of soil: a multi-dataset investigation,” Engineering with Computers, pp. 1–19, 2021.
- [33] B. Li, C. Luo, and Z. Wang, “Application of GWO-SVM algorithm in arc detection of pantograph,” IEEE Access, vol. 8, pp. 173 865–173 873, 2020.
- [34] Y. Wei, N. Ni, D. Liu, H. Chen, M. Wang, Q. Li, X. Cui, and H. Ye, “An improved grey wolf optimization strategy enhanced SVM and its application in predicting the second major,” Mathematical Problems in Engineering, vol. 2017, pp. 1–12, 2017.
- [35] E. Emary, H. M. Zawbaa, C. Grosan, and A. E. Hassenian, “Feature subset selection approach by gray-wolf optimization,” in Proceedings of Afro-European Conference for Industrial Advancement, A. Abraham, P. Krömer, and V. Snasel, Eds. Springer International Publishing, 2015, pp. 1–13.
- [36] Z. Zhou, R. Zhang, Y. Wang, Z. Zhu, and J. Zhang, “Color difference classification based on optimization support vector machine of improved grey wolf algorithm,” Optik, vol. 170, pp. 17–29, 2018.
- [37] C. Li, C. Zheng, and C. Tai, “Detection of ECG characteristic points using wavelet transforms,” IEEE Transactions on Biomedical Engineering, vol. 42, no. 1, pp. 21–28, 1995.
- [38] L. Meng, K. Ge, Y. Song, D. Yang, and Z. Lin, “Wearable electrocardiogram signal monitoring and analysis based on convolutional neural network,” IEEE Transactions on Instrumentation and Measurement, vol. 70, pp. 1–11, 2021.
- [39] Z. Chen, Z. Lin, P. Wang, and M. Ding, “Negative-resnet: noisy ambulatory electrocardiogram signal classification scheme,” Neural Computing and Applications, vol. 33, no. 14, pp. 8857–8869, 2021.
- [40] P. Wang, Z. Lin, X. Yan, Z. Chen, M. Ding, Y. Song, and L. Meng, “A wearable ECG monitor for deep learning based real-time cardiovascular disease detection,” arXiv preprint arXiv:2201.10083, 2022.
- [41] X. Yan, Z. Lin, and P. Wang, “Wireless electrocardiograph monitoring based on wavelet convolutional neural network,” in Proceedings of 2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2020, pp. 1–6.
- [42] M. Liu, Z. Lin, P. Xiao, and W. Xiang, “Human biometric signals monitoring based on wifi channel state information using deep learning,” arXiv preprint arXiv:2203.03980, 2022.
- [43] P. Schmidt, A. Reiss, R. Duerichen, C. Marberger, and K. Van Laerhoven, “Introducing wesad, a multimodal dataset for wearable stress and affect detection,” in Proceedings of the 20th ACM International Conference on Multimodal Interaction, 2018, pp. 400–408.
- [44] A. Velayudhan and S. Peter, “Noise analysis and different denoising techniques of ECG signal-a survey,” IOSR Journal of Electronics and Communication Engineering, vol. 1, no. 1, pp. 40–44, 2016.
- [45] R. Kher, “Signal processing techniques for removing noise from ECG signals,” J. Biomed. Eng. Res, vol. 3, no. 101, pp. 1–9, 2019.
- [46] R. Pal, “Comparison of the design of fir and iir filters for a given specification and removal of phase distortion from iir filters,” in Proceedings of 2017 International Conference on Advances in Computing, Communication and Control (ICAC3), 2017, pp. 1–3.
- [47] J. Lin, S. Pan, C. S. Lee, and S. Oviatt, “An explainable deep fusion network for affect recognition using physiological signals,” in Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019, pp. 2069–2072.
- [48] A. Jain and G. Rathna, “Visual speech recognition for isolated digits using discrete cosine transform and local binary pattern features,” in Proceedings of 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2017, pp. 368–372.
- [49] M. D. Hafed, Ziad M. andLevine, “Face recognition using the discrete cosine transform,” International Journal of Computer Vision, vol. 43, pp. 167––188, 2001.
- [50] N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE transactions on Computers, vol. 100, no. 1, pp. 90–93, 1974.
- [51] Z. Qian, C. Zhou, J. Cheng, and Q. Wang, “Identification of conductive leakage signal in power cable based on multi-classification pso-svm,” in Proceedings of 2017 IEEE 5th International Symposium on Electromagnetic Compatibility (EMC-Beijing), 2017, pp. 1–4.
- [52] A. Tharwat, “Parameter investigation of support vector machine classifier with kernel functions,” Knowledge and Information Systems, vol. 61, no. 3, pp. 1269–1302, 2019.
- [53] S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014.
- [54] J. Wagner, J. Kim, and E. André, “From physiological signals to emotions: Implementing and comparing selected methods for feature extraction and classification,” in Proceedings of 2005 IEEE International Conference on Multimedia and Expo, 2005, pp. 940–943.
- [55] X. Wang and Z. Lin, “Nonrandom microwave ghost imaging,” IEEE Transactions on Geoscience and Remote Sensing, vol. 56, no. 8, pp. 4747–4764, 2018.
- [56] X. Wang and Z. Lin,, “Microwave surveillance based on ghost imaging and distributed antennas,” IEEE Antennas and Wireless Propagation Letters, vol. 15, pp. 1831–1834, 2016.
- [57] Z. Zhang, R. Luo, X. Wang, and Z. Lin, “Microwave ghost imaging via lte-dl signals,” in 2018 International Conference on Radar (RADAR), 2018, pp. 1–5
- [58] R. Luo, Z. Zhang, X. Wang, and Z. Lin, “Wi-fi based device-free microwave ghost imaging indoor surveillance system,” in 2018 28th International Telecommunication Networks and Applications Conference (ITNAC), 2018, pp. 1–6.
- [59] B. Liu, M. Ding, S. Shaham, W. Rahayu, F. Farokhi, and Z. Lin, “When Machine Learning Meets Privacy: A Survey and Outlook” ACM Computing Surveys, ACM Computing Surveys (IF10.282), Pub Date : 2021-03-05, DOI: 10.1145/3436755
- [60] S. Shaham, M. Ding, B. Liu, S. Dang Z. Lin, J. Li, “Privacy Preservation in Location-Based Services: A Novel Metric and Attack Model”, IEEE Transactions on Mobile Computing, vol. 20, no. 10, pp. 3006-3019, 1 Oct. 2021. doi: 10.1109/TMC.2020.2993599.
- [61] S. Shaham, M. Ding, B. Liu, S. Dang Z. Lin, J. Li, “Privacy-Preserving Location Data Publishing: A Machine Learning Approach”, IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 9, pp. 3270-3283, 1 Sept. 2021. doi: 10.1109/TKDE.2020.2964658.
- [62] D. Smith, P. Wang, M. Ding, J. Chan, B. Spak, X. Guan, P.Tyler, T. Rakotoarivelo, Z. Lin, T. Abbasi,”Privacy-Preserved Optimal Energy Trading, Statistics, and Forecasting for a Neighborhood Area Network” in Computer, vol. 53, no. 05, pp. 25-34, 2020. doi: 10.1109/MC.2020.2972505