Investigation Using MLP-SVM-PCA Classifiers on Speech Emotion Recognition
Bibliographic record
Abstract
Sound localization by human listeners are capable of identifying a particular speaker, by listening to the voice of the speaker over the telephone or an entrance-way out of sight. Machines are incapable of understanding and expressing emotions. Emotions play a important role in today's digital world of remote communication. Emotion recognition can be defined as an act of predicting human's emotion through their voice samples and get the accuracy of prediction thus creating a better Human-Computer Interaction (HCI). There are various states to predict human's emotion based on behaviour, expression, pitch, tone, etc. Few of the emotions are considered to recognize the emotions of a speaker behind the speech. This research was conducted to test an speech emotion recognition (SER) system based on voice samples in two-stage approach, namely feature extraction and classification engine. The first one, the key features used for classification of emotions such as extraction of Mel Frequency Cepstral Coefficients (MFCCs), Mel Spectrogram along with Chroma features. Secondly, we use the Multilayer Perceptron (MLP) classifier, elementary classifying Support Vector Machines (SVM) and dimensionality reductionPrincipal Component Analysis (PCA) as classification methods. The research work is considered on the Toronto Emotional Speech Set (TESS) dataset. The proposed approaches gives us 94.17%, 93.43% and 97.86% classification accuracy respectively.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".