EEG Data Analytics to Distinguish Happy and Sad Emotions Based on Statistical Features

Yuri Pamungkas, A. Wibawa, M. Purnomo
{"title":"EEG Data Analytics to Distinguish Happy and Sad Emotions Based on Statistical Features","authors":"Yuri Pamungkas, A. Wibawa, M. Purnomo","doi":"10.1109/ISRITI54043.2021.9702766","DOIUrl":null,"url":null,"abstract":"Affective computing is part of the important study of Human-Computer Interaction. Currently, EEG-based affective computing (emotion recognition) has become an interesting issue to be studied further. Emotions are not only closely related to aspects of HCI but also affect human health. Meanwhile, EEG is also considered a transparent tool in objectively revealing human emotions because the brain naturally produces EEG signals. This study focuses on comparing and classifying human emotions (happy and sad) based on EEG data. The channels used for recording EEG data are F7, F8, FP1, and FP2. Data preprocessing such as signal filtering, Independent Component Analysis, and Band Decomposition aims to clean the raw signal from artifacts and separate the signals according to specific frequency bands (Alpha, Beta, and Gamma). Then, statistical feature extraction is performed in the time domain to obtain the Mean values, Mean Absolute Value (MAV), and Standard Deviation values for further data analysis. The results show that emotion of happy has a higher feature value compared to emotion of sad. In the classification of happy and sad emotions using several algorithms, Random Forest signifies the highest classification accuracy (88.90%), compared to other algorithms such as SVM (86.70%), K-NN (88.87%), and Naive Bayes (86.63%).","PeriodicalId":156265,"journal":{"name":"2021 4th International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISRITI54043.2021.9702766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Affective computing is part of the important study of Human-Computer Interaction. Currently, EEG-based affective computing (emotion recognition) has become an interesting issue to be studied further. Emotions are not only closely related to aspects of HCI but also affect human health. Meanwhile, EEG is also considered a transparent tool in objectively revealing human emotions because the brain naturally produces EEG signals. This study focuses on comparing and classifying human emotions (happy and sad) based on EEG data. The channels used for recording EEG data are F7, F8, FP1, and FP2. Data preprocessing such as signal filtering, Independent Component Analysis, and Band Decomposition aims to clean the raw signal from artifacts and separate the signals according to specific frequency bands (Alpha, Beta, and Gamma). Then, statistical feature extraction is performed in the time domain to obtain the Mean values, Mean Absolute Value (MAV), and Standard Deviation values for further data analysis. The results show that emotion of happy has a higher feature value compared to emotion of sad. In the classification of happy and sad emotions using several algorithms, Random Forest signifies the highest classification accuracy (88.90%), compared to other algorithms such as SVM (86.70%), K-NN (88.87%), and Naive Bayes (86.63%).
基于统计特征的脑电数据分析识别快乐和悲伤情绪
情感计算是人机交互研究的重要组成部分。目前,基于脑电图的情感计算(情感识别)已成为一个值得进一步研究的问题。情绪不仅与HCI的各个方面密切相关,而且影响着人类的健康。同时,脑电图也被认为是客观揭示人类情绪的透明工具,因为大脑会自然产生脑电图信号。本研究的重点是基于脑电图数据对人类情绪(快乐和悲伤)进行比较和分类。记录EEG数据的通道为F7、F8、FP1、FP2。数据预处理,如信号滤波、独立分量分析和频带分解,旨在清除原始信号中的伪影,并根据特定的频带(Alpha、Beta和Gamma)分离信号。然后,在时域进行统计特征提取,得到均值、均值绝对值(Mean Absolute Value, MAV)和标准差值,用于进一步的数据分析。结果表明,快乐情绪比悲伤情绪具有更高的特征值。在几种算法对快乐和悲伤情绪的分类中,与SVM(86.70%)、K-NN(88.87%)和朴素贝叶斯(86.63%)等算法相比,Random Forest的分类准确率最高(88.90%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信