Children's Sentiment Analysis From Texts by Using Weight Updated Tuned With Random Forest Classification

被引:3
|
作者
Ahmed Bilal, Azhar [1 ,2 ]
Ayhan Erdem, O. [3 ]
Toklu, Sinan [3 ]
机构
[1] Gazi Univ, Grad Sch Nat & Appl Sci, Dept Comp Engn, TR-06560 Ankara, Turkiye
[2] Kirkuk Univ, Coll Comp Sci & Informat Technol, Kirkuk 36001, Iraq
[3] Gazi Univ, Fac Technol, Dept Comp Engn, TR-06560 Ankara, Turkiye
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Long short term memory (deep LSTM); natural language processing (NLP); principal component analysis (PCA); sentiment analysis (SA); singular value decomposition (SVD); MODEL;
D O I
10.1109/ACCESS.2024.3400992
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Sentimental Analysis is considered a computational strategy that helps in identifying and assessing the emotions of people via text documents. Tools and different methods have been adopted for determining both positive and negative emotions in the form of text data analytics by using Machine and Deep Learning techniques. Experimentally, it has been shown that the accuracy of existing text classification models such as Bi-LSTM, Decision Tree, and Ensemble Classifiers is limited by poor quality data, inappropriate hyperparameter tuning, and model-specific bias levels. Additionally, these models are prone to overfitting, high computational overhead, and longer training time. To overcome these limitations, we proposed a hybrid binary classification framework by combining Deep sequential features with the Random Forest (RF) technique. The approach is implemented in four phases: Initially, data preprocessing is performed by employing a Vader sentiment package. In the second step, the deep Long Short Term Memory (LSTM) model was employed to extract deep sequential features corresponding to sad and happy emotions. In the third phase, a bi-orthogonalization algorithm with principal component Analysis (PCA) and Singular Value Decomposition (SVD) was employed to minimize the redundancy and maximize the relevance of extracted features. Finally, a five-fold cross-validation technique was implemented to discriminate sad and happy emotions using the Random Forest (RF) algorithm. Eventually, a grid search approach was implemented for hyperparameter tuning and results were compared with five baseline algorithms (Vanilla LSTM (VLSTM), Support Vector Machine (SVM), Gradient Boosting Machine (GBM), Naive Bayes (NB), Ada Boost Algorithm (ABA). The experimental outcomes revealed that the proposed model achieved an accuracy rate of 99.631% on the 4000 stories dataset which was superior to all five state-of-the-art methods with a margin of 4.63%, 10.7%, 19.44%, 21%, and 56.5%, respectively. Interestingly, the proposed model realized improved results in terms of other conventional performance metrics also such as precision, recall, specificity, and time complexity. Overall, the proposed model has great potential in educational institutions, child psychology research, and child-friendly content moderation, generally helping in the understanding of the emotions and experiences of children in the digital realm.
引用
收藏
页码:70089 / 70104
页数:16
相关论文
共 50 条
  • [1] An Approach for Sentiment Analysis Using Gini Index with Random Forest Classification
    Kaur, Manpreet
    COMPUTATIONAL VISION AND BIO-INSPIRED COMPUTING, 2020, 1108 : 541 - 554
  • [2] Predictive classification of ICU readmission using weight decay random forest
    Wang, Bin
    Ding, Shuai
    Liu, Xiao
    Li, X.
    Li, Gang
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2021, 124 : 351 - 360
  • [3] Thermal analysis of Alzheimer's disease prediction using random forest classification model
    Parameswari, A.
    Kumar, K. Vinoth
    Gopinath, S.
    MATERIALS TODAY-PROCEEDINGS, 2022, 66 : 815 - 821
  • [4] Retraction Note: Sentiment classification using harmony random forest and harmony gradient boosting machine
    K. Sridharan
    G. Komarasamy
    Soft Computing, 2023, 27 : 1217 - 1217
  • [5] RETRACTED ARTICLE: Sentiment classification using harmony random forest and harmony gradient boosting machine
    K. Sridharan
    G. Komarasamy
    Soft Computing, 2020, 24 : 7451 - 7458
  • [6] Multimodal sentiment analysis using reliefF feature selection and random forest classifier
    Angadi S.
    Reddy V.S.
    International Journal of Computers and Applications, 2021, 43 (09) : 931 - 939
  • [7] Sentiment Analysis using Random Forest Ensemble for Mobile Product Reviews in Kannada
    Hegde, Yashaswini
    Padma, S. K.
    2017 7TH IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2017, : 777 - 782
  • [8] Automatic habitat classification using image analysis and random forest
    Torres, Mercedes
    Qiu, Guoping
    ECOLOGICAL INFORMATICS, 2014, 23 : 126 - 136
  • [9] Sentiment Analysis of Short Texts Using SVMs and VSMs-Based Multiclass Semantic Classification
    Kumar, K. Suresh
    Mani, A. S. Radha
    Kumar, T. Ananth
    Jalili, Ahmad
    Gheisari, Mehdi
    Malik, Yasir
    Chen, Hsing-Chung
    Moshayedi, Ata Jahangir
    APPLIED ARTIFICIAL INTELLIGENCE, 2024, 38 (01)
  • [10] Raman spectroscopy based analysis of milk using random forest classification
    Amjad, Arslan
    Ullah, Rahat
    Khan, Saranjam
    Bilal, Muhammad
    Khan, Asifullah
    VIBRATIONAL SPECTROSCOPY, 2018, 99 : 124 - 129