Analysis of Fluctuation Patterns in Emotional States Using Electrodermal Activity Signals and Improved Symbolic Aggregate Approximation

Author(s):  
Yedukondala Rao Veeranki ◽  
Nagarajan Ganapathy ◽  
Ramakrishnan Swaminathan

Analysis of fluctuations in electrodermal activity (EDA) signals is widely preferred for emotion recognition. In this work, an attempt has been made to determine the patterns of fluctuations in EDA signals for various emotional states using improved symbolic aggregate approximation. For this, the EDA is obtained from a publicly available online database. The EDA is decomposed into phasic components and divided into equal segments. Each segment is transformed into a piecewise aggregate approximation (PAA). These approximations are discretized using 11 time-domain features to obtain symbolic sequences. Shannon entropy is extracted from each PAA-based symbolic sequence using varied symbol size [Formula: see text] and window length [Formula: see text]. Three machine-learning algorithms, namely Naive Bayes, support vector machine and rotation forest, are used for the classification. The results show that the proposed approach is able to determine the patterns of fluctuations for various emotional states in EDA signals. PAA features, namely maximum amplitude and chaos, significantly identify the subtle fluctuations in EDA and transforms them in symbolic sequences. The optimal values of [Formula: see text] and [Formula: see text] yield the highest performance. The rotation forest is accurate (F-[Formula: see text] and 60.02% for arousal and valence dimensions) in classifying various emotional states. The proposed approach can capture the patterns of fluctuations for varied-length signals. Particularly, the support vector machine yields the highest performance for a lower length of signals. Thus, it appears that the proposed method might be utilized to analyze various emotional states in both normal and clinical settings.

Electronics ◽  
2021 ◽  
Vol 10 (17) ◽  
pp. 2159
Author(s):  
Angelica Poli ◽  
Veronica Gabrielli ◽  
Lucio Ciabattoni ◽  
Susanna Spinsante

Performing regular physical activity positively affects individuals’ quality of life in both the short- and long-term and also contributes to the prevention of chronic diseases. However, exerted effort is subjectively perceived from different individuals. Therefore, this work explores an out-of-laboratory approach using a wrist-worn device to classify the perceived intensity of physical effort based on quantitative measured data. First, the exerted intensity is classified by two machine learning algorithms, namely the Support Vector Machine and the Bagged Tree, fed with features computed on heart-related parameters, skin temperature, and wrist acceleration. Then, the outcomes of the classification are exploited to validate the use of the Electrodermal Activity signal alone to rate the perceived effort. The results show that the Support Vector Machine algorithm applied on physiological and acceleration data effectively predicted the relative physical activity intensities, while the Bagged Tree performed best when the Electrodermal Activity data were the only data used.


2021 ◽  
Vol 7 (2) ◽  
pp. 863-866
Author(s):  
Yedukondala Rao Veeranki ◽  
Nagarajan Ganapathy ◽  
Ramakrishnan Swaminathan

Abstract In this work, the feasibility of time-frequency methods, namely short-time Fourier transform, Choi Williams distribution, and smoothed pseudo-Wigner-Ville distribution in the classification of happy and sad emotional states using Electrodermal activity signals have been explored. For this, the annotated happy and sad signals are obtained from an online public database and decomposed into phasic components. The time-frequency analysis has been performed on the phasic components using three different methods. Four statistical features, namely mean, variance, kurtosis, and skewness are extracted from each method. Four classifiers, namely logistic regression, Naive Bayes, random forest, and support vector machine, have been used for the classification. The combination of the smoothed pseudo-Wigner-Ville distribution and random forest yields the highest F-measure of 68.74% for classifying happy and sad emotional states. Thus, it appears that the suggested technique could be helpful in the diagnosis of clinical conditions linked to happy and sad emotional states.


2021 ◽  
Vol 186 (Supplement_1) ◽  
pp. 445-451
Author(s):  
Yifei Sun ◽  
Navid Rashedi ◽  
Vikrant Vaze ◽  
Parikshit Shah ◽  
Ryan Halter ◽  
...  

ABSTRACT Introduction Early prediction of the acute hypotensive episode (AHE) in critically ill patients has the potential to improve outcomes. In this study, we apply different machine learning algorithms to the MIMIC III Physionet dataset, containing more than 60,000 real-world intensive care unit records, to test commonly used machine learning technologies and compare their performances. Materials and Methods Five classification methods including K-nearest neighbor, logistic regression, support vector machine, random forest, and a deep learning method called long short-term memory are applied to predict an AHE 30 minutes in advance. An analysis comparing model performance when including versus excluding invasive features was conducted. To further study the pattern of the underlying mean arterial pressure (MAP), we apply a regression method to predict the continuous MAP values using linear regression over the next 60 minutes. Results Support vector machine yields the best performance in terms of recall (84%). Including the invasive features in the classification improves the performance significantly with both recall and precision increasing by more than 20 percentage points. We were able to predict the MAP with a root mean square error (a frequently used measure of the differences between the predicted values and the observed values) of 10 mmHg 60 minutes in the future. After converting continuous MAP predictions into AHE binary predictions, we achieve a 91% recall and 68% precision. In addition to predicting AHE, the MAP predictions provide clinically useful information regarding the timing and severity of the AHE occurrence. Conclusion We were able to predict AHE with precision and recall above 80% 30 minutes in advance with the large real-world dataset. The prediction of regression model can provide a more fine-grained, interpretable signal to practitioners. Model performance is improved by the inclusion of invasive features in predicting AHE, when compared to predicting the AHE based on only the available, restricted set of noninvasive technologies. This demonstrates the importance of exploring more noninvasive technologies for AHE prediction.


Author(s):  
Pratyush Kaware

In this paper a cost-effective sensor has been implemented to read finger bend signals, by attaching the sensor to a finger, so as to classify them based on the degree of bent as well as the joint about which the finger was being bent. This was done by testing with various machine learning algorithms to get the most accurate and consistent classifier. Finally, we found that Support Vector Machine was the best algorithm suited to classify our data, using we were able predict live state of a finger, i.e., the degree of bent and the joints involved. The live voltage values from the sensor were transmitted using a NodeMCU micro-controller which were converted to digital and uploaded on a database for analysis.


Author(s):  
Sheela Rani P ◽  
Dhivya S ◽  
Dharshini Priya M ◽  
Dharmila Chowdary A

Machine learning is a new analysis discipline that uses knowledge to boost learning, optimizing the training method and developing the atmosphere within which learning happens. There square measure 2 sorts of machine learning approaches like supervised and unsupervised approach that square measure accustomed extract the knowledge that helps the decision-makers in future to require correct intervention. This paper introduces an issue that influences students' tutorial performance prediction model that uses a supervised variety of machine learning algorithms like support vector machine , KNN(k-nearest neighbors), Naïve Bayes and supplying regression and logistic regression. The results supported by various algorithms are compared and it is shown that the support vector machine and Naïve Bayes performs well by achieving improved accuracy as compared to other algorithms. The final prediction model during this paper may have fairly high prediction accuracy .The objective is not just to predict future performance of students but also provide the best technique for finding the most impactful features that influence student’s while studying.


Author(s):  
Vidyashree M S

Abstract: Blood Cancer cells forming a tissue is called lymphoma. Thus, disease decreases the cells to fight against the infection or cancer blood cells. Blood cancer is also categorized in too many types. The two main categories of blood cancer are Acute Lymphocytic Lymphoma and Acute Myeloid Lymphoma. In this project proposes a approach that robotic detects and segments the nucleolus from white blood cells in the microscopic Blood images. Here in this project, we have used the two Machine learning algorithms that are k-means algorithm, Support vector machine algorithm. K-mean algorithm is use for segmentation and clustering. Support vector machine algorithm is used for classification. Keywords: k-means, Support vector machine, Lymphoma, Acute Lymphocytic Lymphoma, Machine Learning


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yao Huimin

With the development of cloud computing and distributed cluster technology, the concept of big data has been expanded and extended in terms of capacity and value, and machine learning technology has also received unprecedented attention in recent years. Traditional machine learning algorithms cannot solve the problem of effective parallelization, so a parallelization support vector machine based on Spark big data platform is proposed. Firstly, the big data platform is designed with Lambda architecture, which is divided into three layers: Batch Layer, Serving Layer, and Speed Layer. Secondly, in order to improve the training efficiency of support vector machines on large-scale data, when merging two support vector machines, the “special points” other than support vectors are considered, that is, the points where the nonsupport vectors in one subset violate the training results of the other subset, and a cross-validation merging algorithm is proposed. Then, a parallelized support vector machine based on cross-validation is proposed, and the parallelization process of the support vector machine is realized on the Spark platform. Finally, experiments on different datasets verify the effectiveness and stability of the proposed method. Experimental results show that the proposed parallelized support vector machine has outstanding performance in speed-up ratio, training time, and prediction accuracy.


2021 ◽  
Vol 9 (1) ◽  
pp. 215-223
Author(s):  
Prateek Mishra, Dr.Anurag Sharma, Dr. Abhishek Badholia

Adverse effects can be seen in the entire body due to the major disorders known as Diabetes. The risk of dangers like diabetic nephropathy, cardiac stroke and other disorders can increase severally because of the undiagnosed diabetes. Around the globe the people are suffering from this disease. For a healthy life early detection of this disease is very curtail. As the causes of the diabetes is increasing rapidly this disease might turn up as a reason for worldwide concern. Increasing the chances for a more accurate predictions and form experiences automatic learning by computational method may be provided by Machine Learning (ML). With the help of R data manipulation tool for trends development and with risk factor patterns detection in Pima Indian diabetes technique of machine learning is been used in the current researches. With the use of R data manipulation tool analysis and development five different predictive models is done for the categorization of patients into diabetic and non- diabetic.  supervised machine learning algorithms namely multifactor dimensionality reduction (MDR), k-nearest neighbor (k-NN), artificial neural network (ANN) radial basis function (RBF) kernel support vector machine and linear kernel support vector machine (SVM-linear) are used for this purpose.


2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Andronicus A. Akinyelu ◽  
Aderemi O. Adewumi

Support vector machine (SVM) is one of the top picks in pattern recognition and classification related tasks. It has been used successfully to classify linearly separable and nonlinearly separable data with high accuracy. However, in terms of classification speed, SVMs are outperformed by many machine learning algorithms, especially, when massive datasets are involved. SVM classification speed scales linearly with number of support vectors, and support vectors increase with increase in dataset size. Hence, SVM classification speed can be enormously reduced if it is trained on a reduced dataset. Instance selection techniques are one of the most effective techniques suitable for minimizing SVM training time. In this study, two instance selection techniques suitable for identifying relevant training instances are proposed. The techniques are evaluated on a dataset containing 4000 emails and results obtained compared to other existing techniques. Result reveals excellent improvement in SVM classification speed.


Sign in / Sign up

Export Citation Format

Share Document