An Enhanced Emotion Classification Scheme for Twits Based on Deep Learning Approach
Bibliographic record
Abstract
Given the widespread incorporation of social media into everyday existence, platforms such as Twitter have become crucial arenas for individuals to articulate their thoughts, emotions, and viewpoints.The ability to identify emotions in these facial expressions has a wide range of practical uses, including tailored marketing strategies and research on human behaviour.Nevertheless, the language used on these platforms is frequently filled with colloquialisms and vagueness, rendering the process of detecting emotions a challenging endeavour even for individuals.The difficulties in analysing emotions on Twitter are particularly noticeable because current natural language processing (NLP) techniques have limited ability to handle slang language, and earlier classifiers that rely on slang have produced unsatisfactory results.This paper presents a new model for categorising emotions in tweets that contain slang.The model combines multiple approaches and utilises the WordNET dataset.The WordNET library is used in the proposed model to create synonymous phrases for the sentences in the text.The text data is divided into segments, reduced to their root forms, then filtered to remove often used words using natural language processing (NLP) approaches.The textual properties are described by utilising Term Frequency -Inverse Document Frequency (TF-IDF) and n-gram based similarity approaches.Emotions are classified by the utilisation of a convolutional neural network (CNN).An analysis was conducted on the performance of this model based on the metrics of classification accuracy and processing speed.The findings revealed a remarkable level of accuracy in classifying emotions in slang language using the suggested model, achieving a precise categorization rate of 89.3%.This study represents a notable advancement in the field of emotion classification in social media writing that contains slang language.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".