Enhanced Emotion Recognition Through the Integration of Gated Recurrent Unit and Convolutional Neural Networks Using MindWave Mobile EEG Device
Bibliographic record
Abstract
Emotion recognition utilizing MindWave signals and neural networks presents a substantial challenge due to the inherent complexity of human emotions and the variability of individual brainwaves.The selection of the appropriate algorithm, dictated by the problem and available data, necessitates an understanding of each algorithm's unique strengths and weaknesses.Previous studies have predominantly focused on the classification of emotions through EEG signals employing various standalone neural network algorithms.However, our study fills a notable research gap by integrating Convolutional Neural Networks (CNN) and Gated Recurrent Units (GRU).This innovative combination yields improved testing performance and accuracy, setting a benchmark in the realm of emotion recognition.The process encompasses the collection of MindWave data, the elimination of noise through preprocessing, the extraction of features indicative of emotional states, and the training of a neural network using labeled data.Finally, the network's accuracy is evaluated on novel data.By addressing the unique challenges and complexities associated with emotion classification using EEG signals, this study provides a promising and advanced approach towards the understanding and recognition of human emotions, paving the way for potential realworld applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".