An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models
Some texts that are challenging to recognize on their own may become more understandable in a neighborhood of related texts with similar contexts. Motivated by this intuition, a novel deep text sentiment classification (DTSC) model is proposed to improve the model’s performance by incorporating the...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2023-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2023/1896556 |
_version_ | 1797366771595870208 |
---|---|
author | Israa K. Salman Al-Tameemi Mohammad-Reza Feizi-Derakhshi Saeed Pashazadeh Mohammad Asadpour |
author_facet | Israa K. Salman Al-Tameemi Mohammad-Reza Feizi-Derakhshi Saeed Pashazadeh Mohammad Asadpour |
author_sort | Israa K. Salman Al-Tameemi |
collection | DOAJ |
description | Some texts that are challenging to recognize on their own may become more understandable in a neighborhood of related texts with similar contexts. Motivated by this intuition, a novel deep text sentiment classification (DTSC) model is proposed to improve the model’s performance by incorporating the neighborhood of related texts. Our framework uses a nonparametric approach to construct neighborhoods of related texts based on Jaccard similarities. Then, a new deep recurrent neural network architecture is proposed, comprising two distinct modules: bidirectional long short-term memory (Bi-LSTM) and gated recurrent unit (GRU). The proposed model aims to effectively capture informative features from the input text and its neighbors. The result of each module is processed through the maximum operation, which selects the most pertinent data. Finally, the extracted features are concatenated and subjected to classification to achieve accurate sentiment prediction. Previous studies have commonly employed a parametric approach to represent textual metadata. However, our approach utilizes a nonparametric approach, enabling our model to perform strongly even when the text vocabulary varies between training and testing. The proposed DTSC model has been evaluated on five real-world sentiment datasets, achieving 99.60% accuracy on the Binary_Getty (BG) dataset, 98.32% accuracy on the Binary_iStock (BIS) dataset, 96.13% accuracy on Twitter, 82.19% accuracy on the multi-view sentiment analysis (MVSA) dataset, and 87.60% accuracy on the IMDB dataset. These findings demonstrate that the proposed model outperforms established baseline techniques in terms of model evaluation criteria for text sentiment classification. |
first_indexed | 2024-03-08T17:09:26Z |
format | Article |
id | doaj.art-029ec855f5d84de48d696f3433bc385a |
institution | Directory Open Access Journal |
issn | 1099-0526 |
language | English |
last_indexed | 2024-03-08T17:09:26Z |
publishDate | 2023-01-01 |
publisher | Hindawi-Wiley |
record_format | Article |
series | Complexity |
spelling | doaj.art-029ec855f5d84de48d696f3433bc385a2024-01-04T00:00:02ZengHindawi-WileyComplexity1099-05262023-01-01202310.1155/2023/1896556An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN ModelsIsraa K. Salman Al-Tameemi0Mohammad-Reza Feizi-Derakhshi1Saeed Pashazadeh2Mohammad Asadpour3Computerized Intelligence Systems LaboratoryComputerized Intelligence Systems LaboratoryDepartment of Computer EngineeringDepartment of Computer EngineeringSome texts that are challenging to recognize on their own may become more understandable in a neighborhood of related texts with similar contexts. Motivated by this intuition, a novel deep text sentiment classification (DTSC) model is proposed to improve the model’s performance by incorporating the neighborhood of related texts. Our framework uses a nonparametric approach to construct neighborhoods of related texts based on Jaccard similarities. Then, a new deep recurrent neural network architecture is proposed, comprising two distinct modules: bidirectional long short-term memory (Bi-LSTM) and gated recurrent unit (GRU). The proposed model aims to effectively capture informative features from the input text and its neighbors. The result of each module is processed through the maximum operation, which selects the most pertinent data. Finally, the extracted features are concatenated and subjected to classification to achieve accurate sentiment prediction. Previous studies have commonly employed a parametric approach to represent textual metadata. However, our approach utilizes a nonparametric approach, enabling our model to perform strongly even when the text vocabulary varies between training and testing. The proposed DTSC model has been evaluated on five real-world sentiment datasets, achieving 99.60% accuracy on the Binary_Getty (BG) dataset, 98.32% accuracy on the Binary_iStock (BIS) dataset, 96.13% accuracy on Twitter, 82.19% accuracy on the multi-view sentiment analysis (MVSA) dataset, and 87.60% accuracy on the IMDB dataset. These findings demonstrate that the proposed model outperforms established baseline techniques in terms of model evaluation criteria for text sentiment classification.http://dx.doi.org/10.1155/2023/1896556 |
spellingShingle | Israa K. Salman Al-Tameemi Mohammad-Reza Feizi-Derakhshi Saeed Pashazadeh Mohammad Asadpour An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models Complexity |
title | An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models |
title_full | An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models |
title_fullStr | An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models |
title_full_unstemmed | An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models |
title_short | An Efficient Sentiment Classification Method with the Help of Neighbors and a Hybrid of RNN Models |
title_sort | efficient sentiment classification method with the help of neighbors and a hybrid of rnn models |
url | http://dx.doi.org/10.1155/2023/1896556 |
work_keys_str_mv | AT israaksalmanaltameemi anefficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT mohammadrezafeiziderakhshi anefficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT saeedpashazadeh anefficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT mohammadasadpour anefficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT israaksalmanaltameemi efficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT mohammadrezafeiziderakhshi efficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT saeedpashazadeh efficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels AT mohammadasadpour efficientsentimentclassificationmethodwiththehelpofneighborsandahybridofrnnmodels |