Sentiment Analysis using Multi Head Self-Attention Mechanism Based Bidirectional Gated Recurrent Unit

Sentiment Analysis plays a vital role in Natural Language Processing (NLP) which aims to discern opinions and emotions expressed in text. However, the data sparsity and disambiguation of natural languages make it challenging for the existing approaches to provide accurate extraction and classification when subjected to text data. Hence, this research proposes Multihead Self-Attention Mechanism based Bidirectional Gated Recurrent Unit (MSA-BiGRU) approach for the classification of sentiment data into multi-classes. The MSA allows the BiGRU to consider various parts of the sequence, capturing long-term dependencies and relationships within the text. Initially, three standard datasets namely, Internet Movie Database (IMDB), Sentiment140 and World Cup Soccer are utilized to estimate the effectiveness of the MSA-BiGRU method. The Word-2-Vector (Word2Vec) is utilized for the feature extraction process and Analysis of Variance (ANOVA) is utilized for the selection of features. The performance metrices: accuracy, precision, recall and F1-score are utilized to validate the model’s effectiveness. The experimental results show that the MSA-BiGRU method attains a better accuracy of 98.91% on sentiment140 dataset as compared to Automated Sentiment Analysis in social media based on Harris Hawks Optimization with Deep Learning (ASASM-HHODL) and Gated Attention Mechanism and Recurrent Neural Network (GARN).

Authors

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/iacis61494.2024.10721765
Citations
2
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
3.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sentiment Analysis using Multi Head Self-Attention Mechanism Based Bidirectional Gated Recurrent Unit

Neethu Subash, Bikku Ramavath, Srikanth Kadainti
2 citations
Advanced Computing and Algorithms
3.92
article

Sentiment Analysis using Multi Head Self-Attention Mechanism Based Bidirectional Gated Recurrent Unit

Neethu Subash, Bikku Ramavath, Srikanth Kadainti
article en
2 citations

Abstract

Sentiment Analysis plays a vital role in Natural Language Processing (NLP) which aims to discern opinions and emotions expressed in text. However, the data sparsity and disambiguation of natural languages make it challenging for the existing approaches to provide accurate extraction and classification when subjected to text data. Hence, this research proposes Multihead Self-Attention Mechanism based Bidirectional Gated Recurrent Unit (MSA-BiGRU) approach for the classification of sentiment data into multi-classes. The MSA allows the BiGRU to consider various parts of the sequence, capturing long-term dependencies and relationships within the text. Initially, three standard datasets namely, Internet Movie Database (IMDB), Sentiment140 and World Cup Soccer are utilized to estimate the effectiveness of the MSA-BiGRU method. The Word-2-Vector (Word2Vec) is utilized for the feature extraction process and Analysis of Variance (ANOVA) is utilized for the selection of features. The performance metrices: accuracy, precision, recall and F1-score are utilized to validate the model’s effectiveness. The experimental results show that the MSA-BiGRU method attains a better accuracy of 98.91% on sentiment140 dataset as compared to Automated Sentiment Analysis in social media based on Harris Hawks Optimization with Deep Learning (ASASM-HHODL) and Gated Attention Mechanism and Recurrent Neural Network (GARN).

Reduced inequalities
Openalex Percentile: Top 6%
Advanced Computing and Algorithms
3.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.