Computer Systems Science & Engineering DOI:10.32604/csse.2023.034519 | [picture]
Article |

Battle Royale Optimization with Fuzzy Deep Learning for Arabic Sentiment Classification

Manar Ahmed Hamza¹,*, Hala J. Alshahrani², Jaber S. Alzahrani³, Heba Mohsen⁴, Mohamed I. Eldesouki⁵ and Mohammed Rizwanullah¹

1 Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam bin Abdulaziz University, AlKharj, Saudi Arabia
2 Department of Applied Linguistics, College of Languages, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh, 11671, Saudi Arabia
3 Department of Industrial Engineering, College of Engineering at Alqunfudah, Umm Al-Qura University, Makkah 24211, Saudi Arabia
4 Department of Computer Science, Faculty of Computers and Information Technology, Future University in Egypt, New Cairo, 11835, Egypt
5 Department of Information System, College of Computer Engineering and Sciences, Prince Sattam bin Abdulaziz University, AlKharj, Saudi Arabia
Corresponding Author: Manar Ahmed Hamza. Email: ma.hamza@psau.edu.sa
Received: 19 July 2022; Accepted: 14 September 2022

Abstract: Aspect-Based Sentiment Analysis (ABSA) on Arabic corpus has become an active research topic in recent days. ABSA refers to a fine-grained Sentiment Analysis (SA) task that focuses on the extraction of the conferred aspects and the identification of respective sentiment polarity from the provided text. Most of the prevailing Arabic ABSA techniques heavily depend upon dreary feature-engineering and pre-processing tasks and utilize external sources such as lexicons. In literature, concerning the Arabic language text analysis, the authors made use of regular Machine Learning (ML) techniques that rely on a group of rare sources and tools. These sources were used for processing and analyzing the Arabic language content like lexicons. However, an important challenge in this domain is the unavailability of sufficient and reliable resources. In this background, the current study introduces a new Battle Royale Optimization with Fuzzy Deep Learning for Arabic Aspect Based Sentiment Classification (BROFDL-AASC) technique. The aim of the presented BROFDL-AASC model is to detect and classify the sentiments in the Arabic language. In the presented BROFDL-AASC model, data pre-processing is performed at first to convert the input data into a useful format. Besides, the BROFDL-AASC model includes Discriminative Fuzzy-based Restricted Boltzmann Machine (DFRBM) model for the identification and categorization of sentiments. Furthermore, the BRO algorithm is exploited for optimal fine-tuning of the hyperparameters related to the FBRBM model. This scenario establishes the novelty of current study. The performance of the proposed BROFDL-AASC model was validated and the outcomes demonstrate the supremacy of BROFDL-AASC model over other existing models.

Keywords: Arabic corpus; aspect based sentiment analysis; arabic language; deep learning; battle royale optimization; natural language processing

1  Introduction

The advancements in web technologies have provided novel opportunities for the communication of user-generated content such as website reviews, blogs, forums, social networking sites and so on [1]. The extraordinary increase in the generation of data and the process of dealing with intricate unstructured text in natural language involve both organizations and persons in the domain of data mining. Sentiment Analysis (SA) (emotional analysis or opinion mining) can be defined as a computer-generated analytical procedure to assess different types of emotions, opinions and moods of the human beings [2]. It is helpful in deciding the attitude of a researcher, about a particular piece of content, on the basis of the subject of interest [3]. SA results categorizes the opinions and polarities of the text corpus (i.e., news, review, or tweet) as neutral, positive and negative. For Arabic SA, three techniques are used in general such as hybrid-based, corpus-based, lexicon-based and hybrid-based techniques (in which both corpus and lexicon techniques are combined) [4,5].

The intension of the common SA mechanism is to decide a single sentiment polarity for every review or an opinionated sentence [6]. However, this cannot be always useful or practical in nature since a sentence or a review might consist of numerous opinions covering diverse aspects of the topic under study. Moreover, such opinions may also contradict or conflict with each other [7,8]. For instance, a reviewer may simply praise the performance of a graphics card in a computer while disparage the lifetime of the battery [9]. Due to these multi-faceted opinions, there is a need exists for a fine-grained analysis of the sentiments and it is fulfilled by Aspect-Based or feature-based SA (ABSA) [10]. ABSA is an extension of SA that considers all the types of opinions in a sentence or a review with entities and aspects under target along with its sentiment polarity values [11]. ABSA is highly helpful at instances as discussed above. Owing to its significance, ABSA was highly focused at workshops like SemEval and high-profile Natural Language Processing (NLP) conferences [12]. SemEval is an annual NLP workshop that provides several insights to the scientific community in terms of testing SA mechanisms [13]. DL is a highly-recommended method in ML technique to handle several NLP complexities like SA machine translation called speech recognition and entity recognition [14]. Apart from its prodigious performance, DL has an additional advantage i.e., it does not depend on external resources or hand-crafted features.

Bensoltane et al. [15] attempted to overcome such limitations by offering Transfer Learning (TL) techniques with the help of pre-trained language methods. This was accomplished to perform two Aspect-Based Sentiment Analysis (ABSA) errands in the Arabic language like Aspect Category Detection (ACD) and Aspect Term Extraction (ATE). The presented methods were constructed based on the Arabic version (AraBERT) of the BERT method. The study compared diverse executions of the BERT method such as feature-oriented and fine-tuning approaches. The primary finding of this study was that fine-tuning is highly appropriate in low-resource backgrounds. Then, if the downstream layers are modelled in a customized manner, it enhances the outcomes of the default finely-tuned BERT method. Kumar et al. [16] recommended an effective technique for SA by efficiently merging three processes into one. The first process was the formation of ontology to extract the semantic features. The second process utilized Word2vec to transform the processed corpus and at last, CNN was utilized for the purpose of opinion mining. In order to fine-tune the CNN parameters, a multi-objective function was resolved for non-dominant Pareto front optimum values, utilizing PSO. Alshammari et al. [17] conducted a survey of the research works conducted earlier upon SA that utilized ML, DL and lexicon-related approaches in English and Arabic language tweets. The authors reported the outcomes for both DL as well as ML-SA methods on Arabic tweets for the extraction of sentiments of Saudi telecommunication firms’ customers. The author evaluated the impact of Word Embedding and Part of Speech (POS) methods upon the performances of DL approaches.

Ishaq et al. [18] granted a real technique for sentiment analysis. In this technique, three functions were compiled such as the implementation of CNN, mining of the semantic features and the transformation of the derived corpus with the help of Word2vec for opinion mining. GA was used to fine-tune the CNN hyper-parameters. Ma et al. [19] offered an effective solution for battered aspect-related SA, particularly paying attention to the application of common-sense knowledge in deep neural series method. In order to derive the implications of the dependent sentiment, the authors augmented LSTM with a stacked attention system that comprises of attention methods for sentence- and target-levels. For a precise compilation of the implicit and explicit knowledges, the authors offered an extension of LSTM in the name of Sentic LSTM. The protracted LSTM cell had an isolated output gate that incorporates both concept as well as input token level memory. Moreover, the author recommended an extension of Sentic LSTM by creating a hybrid of recurrent additive networks and LSTM which pretends like Sentic paradigms. Though several works are available in the literature, only a few works have concentrated on hyperparameter tuning processes with the help of optimization algorithms.

The current study introduces a new Battle Royale Optimization with Fuzzy Deep Learning for Arabic Aspect Based Sentiment Classification (BROFDL-AASC) technique. The aim of the presented BROFDL-AASC model is to detect and classify the sentiments found in the Arabic language. In the presented BROFDL-AASC model, data pre-processing is performed at the initial stage to convert the input data into a useful format. Besides, the BROFDL-AASC model performs Discriminative Fuzzy-based Restricted Boltzmann Machine (DFRBM) model for the identification and categorization of sentiments. Furthermore, the BRO algorithm is exploited for optimal fine-tuning of the hyperparameters related to the FBRBM model. The performance of the proposed BROFDL-AASC model was experimentally validated under different measures.

2  The Proposed Model

In this study, a new BROFDL-AASC technique has been developed for Arabic aspect-based sentiment classification. The presented BROFDL-AASC model detects and classifies the sentiments expressed in the Arabic language. Fig. 1 displays the block diagram of BROFDL-AASC approach.

Figure 1: Block diagram of BROFDL-AASC approach

2.1 Data Pre-Processing

In the presented BROFDL-AASC model, data pre-processing is conducted at the initial stage to convert the input data into a useful format. The steps involved are given herewith [20]:

     i)  Increase a space between conjunction letters, commas and special characters with that of the subsequent word such as (عوضوملا، و يلاتلاب → عوضوملا ،يلاتلابو).

    ii)  Eliminate every diacritic i.e., ْعَّتَمَتَي→عتمتي.

   iii)  Eliminate the repeated characters, for instance (عوضوملا→عوـــــضوملا)

    iv)  Eliminate the unwanted additional spaces (صقن رارضأ صقن→رارضأ)

     v)  Eliminate unusual entries such as poems (ىَوِّللا ِطْقِسِب ِلِزْنَمو ٍبيِبَح ىَرْكِذ ْنِم ِكْبَن اَفِق ِلَمْوَحَف ِلوُخَّدلا َنْيَب),

    vi)  In this study, the BERT model is applied for word embedding process.

2.2 Sentiment Analysis Using DFRBM Model

In current study, the proposed BROFDL-AASC model makes use of the DFRBM model for identification and the categorization of the sentiments. FRBM is developed by substituting the real value parameters of RBM with symmetric triangular fuzzy numbers [21]. However, the architecture is retained similar to RBM as shown below.

F(x)=−∑j=1n⁡bj~xj−∑i=1m⁡ ln (1+eci~+Σj=1nwij~xj) (1)

In Eq. (1), the weight W~=(wij~)m×n , bias term B~=(bj~)1×n and C~=(C~i)1×m refer to the symmetric triangular fuzzy numbers. The fuzzy-free energy function can be defuzzified using the crisp possibility mean value of a fuzzy number that results in the subsequent defuzzified free energy function. Eq. (2) shows the calculation for the same.

Fp(x)=∫01⁡α(FL(α)+FR(α))dα

≈−12∑j=1n⁡bjLxj−12∑i=1m⁡ ln (1+eciL+Σj=1nwiJLxj) (2)

−12∑j=1n⁡bjRxj−12∑i=1m⁡ ln (1+eciR+Σjn wiJRxj)

≜F(x, θL)+F(x, θR)2

Here, θL=≜(WL,  bL,  cL) and θR=≜(WR,  bR,  cR) denote the left and right limits of the fuzzy parameter θ~=≜(W~, B~, C) correspondingly. FL(α) and FR(α) characterize the left and right ends of the α− cut for Fp(x) , correspondingly. F(.) denotes the free energy functions of the RBM. Next, the likelihood of FRBM is described using Eq. (3):

P(x, θ~)=e−Fp(x)Z (3)

Here, Z=∑  ⁡e−Fp(x) characterizes the partition functions. The updated equation for the FRBM parameter depends on CD approach as given below.

△WL=△WR=ϵ2({hTx}data−{hTx}model)

△bL=△bR=ϵ2({x}data−{x}model) (4)

△cL=△cR=ϵ2({h}data−{h}model)

Here, h=hL+hR2 , x=xL+xR2 and ϵ indicate the learning rate. In this study, an alternative of FRBM i.e., Discriminatory FRBM (DFRBM) has been developed using an additional set of input components that demonstrate the class label t. This component is interconnected with a hidden unit using fuzzy bias vector D~=(dk~)1×K and fuzzy weight matrix U~=(uik~)m×K . The DFRBM is well-trained to an outstanding classifier by following CD technique. Its fuzzy-free energy function is determined as follows.

F(x,  t)=−∑j=1n⁡bj~xj−∑k=1K⁡dk~tk (5)

−∑i=1m⁡ ln (+eci~+Σj=1nwij~xj+Σk=1uik~tkK).

Now, UL and UR denote the left and right limits of U~  respectively whereas dL and dR correspond to the left and the right limits of D~ and are evaluated as given herewith.

Fp(x,  t)≈FD(x, t, θL)+FD(x, t, θR)2  (6)

In Eq. (6), FD(.) refers to the free energy function of DRBM which determines the likelihood of a DRBM.

P(x,  t, θ~)=e−Fp(x,t)∑  ⁡e−Fp(x,t) (7)

where θ~=(W~, U~, B~, C~, D~) .

Besides Eq. (4), the update rule for the parameter of label unit in DFRBM is shown below.

△UL=△UR=ϵ2({hTt⟩data−{hTt⟩model) (8)

△dL=△dR=ϵ2({t⟩data−{t⟩model)

where t=tL+tR2; tL and tR correspond to the left and the right units sampled during the negative stages of the training procedure.

Once a novel sample x is given for classification, the subsequent two condition likelihoods are calculated.

PL(tk|x)=edkL∏i=1m⁡(+eciL+uikL+Σj=1nwiJ Lxj)∑k=1k⁡edkL∏i=1m⁡(+eciL+uikL+Σj=1nwijLxJ)

and

PR(tk|x)=edkR∏i=1m⁡(1+eciR+uikR+Σj=1nwijRxj)∑k=1k⁡edkR∏i=1m⁡(1+eciR+uikR+Σj=1nwij Rxj)

Here, dkL, ciL, uikL and wijL represent the left limits of the triangular fuzzy numbers such as dk, c~,uik∼ , and wij∼ respectively. Further, dkR , ciR , uikR and wijR denote the right limits correspondingly. Fig. 2 demonstrates the structure of DFRBM technique.

Figure 2: Structure of DFRBM

Accordingly, the label of the sample x is defined using the maximal probability

P(tk|x)=PL(tk|x)+PR(tk|x)2, k=1, 2, …,  K.  (9)

2.3 Hyperparameter Tuning Using BRO Algorithm

Finally, the BRO algorithm is exploited for optimal fine-tuning of the hyperparameters involved in FBRBM model. In a certain version of the Battle Royale game, the player starts the game by jumping from a plane and parachutes down to the map. Likewise, BRO is initiated through a random population that is distributed uniformly across the problems, like other swarm-based approaches [22]. Then, every individual (either a player or a soldier) attempts to hurt the nearby soldier by shooting them using a weapon. Therefore, a soldier in the best position causes harm to the nearby neighbours. If a soldier is hurt by others, their damage level increases by one. This interaction is arithmetically evaluated for each xi . damage =xi . damage + l in which xi . damage refers to the damage level of the ith soldier in the population. Furthermore, if a soldier immediately wants to shift the location after getting damaged, the result would be attacking the opponent from other sides. Henceforth, to emphasize the exploitation procedure, the damaged soldier is moved to the point somewhere between the preceding location and the optimal location (elite player) for which the mathematical expression is as follows.

xdam,d=xdam,d+r(xbest,d−xdam,d),   (10)

In Eq. (10), r denotes a randomly-produced value that is distributed uniformly within 0 and1 and xdam,d indicates the position of the damaged soldier in  d dimension. Furthermore, the damaged soldier tend to hurt the opponents in the following iterations whereas xi. damage is returned to 0. In order to emphasize the exploration procedure, the damage level of the soldier surpasses the pre-determined thresholding value. Hence, the soldier randomly respawns and dies from the possible problem space whereas xi. damage returns to 0. By using trial and error method, the thresholding value =3 was found to be suitable. This process not only prevents the early convergence but also offers the best exploration outcomes. The following equation mathematically expresses the procedural outcomes.

xdam,d=r(ubd−lbd)+lbd  (11)

In Eq. (11), lbd and ubd correspond to the lower and the upper limits of d dimension in search domain correspondingly. Moreover, during every Δ iteration, the possible searching space of the problem starts with the shrinking down towards the optimal solution. The primary value remains at Δ=log10( MaxCicle) later Δ=Δ+round(Δ2) . Now, MaxCicle refers to the maximal amount of generations.

This interaction contributes towards exploration and exploitation phases. Hence, the lower and the upper bounds are upgraded as given below.

lbd=xbest,d−SD(xd¯)

ubd=xbest,d+SD(xd¯)  (12)

Now, SD(x¯) indicates the standard deviation of the entire population in d dimension and xbest,d denotes the location of the optimal solution. Once lbd/ubd exceeds the actual lower or upper bounds, then it is set at the actual lbd/ubd. Moreover, to emphasize the elitism process, an optimal soldier or player who is found, during every iteration is retained and is assumed as an elite. Except the dimensions problem, the computation difficulty of this work depends on the size of population and the maximal iteration count.

3  Results and Discussion

In this section, the presented model was experimentally validated using Arabic SemEval-2016 dataset. The dataset has a total of 13,113 samples under three class labels as illustrated in Table 1. The results were examined under different aspects such as a) 80% of TR data, (b) 20% of TS data, (c) 70% of TR data, and (d) 30% of TS data.

The confusion matrices generated by the proposed BROFDL-AASC model under different aspects are illustrated in Fig. 3. On 80% of TR data, the proposed BROFDL-AASC model identified 5,934, 3,428 and 517 samples as positive, negative and neutral classes respectively. In addition to this, on 20% of TS data, the presented BROFDL-AASC method classified 1,516, 830, and 125 samples under positive, negative and neutral classes correspondingly. Moreover, on 70% of TR data, the proposed BROFDL-AASC algorithm categorized 5,228, 2975 and 395 samples under positive, negative and neutral classes correspondingly.

Figure 3: Confusion matrices of BROFDL-AASC approach (a) 80% of TR data, (b) 20% of TS data, (c) 70% of TR data, and (d) 30% of TS data

Table 2 and Fig. 4 show the analytical outcomes achieved by the proposed BROFDL-AASC model on 80% of TR data. In positive class, the presented BROFDL-AASC model attained accuy , precn , recal , specy , and Fscore values such as 95.12%, 95.08%, 96.66%, 92.94%, and 95.86% respectively. Meanwhile, in negative class, the proposed BROFDL-AASC approach gained accuy , precn , recal , specy , and Fscore values such as 95.27%, 93.05%, 93.46%, 96.25%, and 93.25% correspondingly. Along with that, on neutral class, BROFDL-AASC approach accomplished accuy , precn , recal , specy , and Fscore values such as 97.96%, 91.50%, 75.70%, 99.51%, and 82.85% correspondingly.

Figure 4: Results of the analysis of BROFDL-AASC approach under 80% of TR data

Fig. 5 presents the results of the analysis accomplished by BROFDL-AASC approach on 20% of TS data. On positive class, the proposed BROFDL-AASC approach accomplished accuy , precn , recal , specy and Fscore values such as 95.27%, 95.35%, 96.81%, 93%, and 96.07% correspondingly. Similarly, on negative class, the presented BROFDL-AASC technique attained accuy , precn , recal , specy , and Fscore values such as 95.50%, 93.26%, 93.47%, 96.54%, and 93.36% correspondingly. Moreover, on neutral class, the presented BROFDL-AASC approach obtained accuy , precn , recal , specy , and Fscore values such as 97.64%, 87.41%, 73.96%, 99.27%, and 80.13% correspondingly.

Figure 5: Results of the analysis of BROFDL-AASC approach under 20% of TS data

Table 3 and Fig. 6 display the comprehensive analytical results attained by the proposed BROFDL-AASC approach on 70% of TR data. On positive class, the presented BROFDL-AASC technique achieved accuy , precn , recal , specy and Fscore values such as 94.28%, 93.99%, 96.48%, 91.12%, and 95.22% correspondingly. Meanwhile, on negative class, the presented BROFDL-AASC technique gained accuy , precn , recal , specy and Fscore values such as 95.59%, 93.20%, 94.06%, 96.39% and 93.63% respectively. Further, on neutral class, the proposed BROFDL-AASC algorithm obtained accuy , precn , recal , specy and Fscore values such as 97.47%, 92.94%, 66.16%, 99.65%, and 77.30% correspondingly.

Figure 6: Results of the analysis of BROFDL-AASC approach under 70% of TR data

Fig. 7 portrays the analytical results attained by BROFDL-AASC approach on 30% of TS data. On positive class, the proposed BROFDL-AASC method attained accuy , precn , recal , specy and Fscore values such as 94.56%, 94.27%, 96.50%, 91.87% and 95.37% correspondingly. Similarly, on negative class, the proposed BROFDL-AASC technique acquired accuy , precn , recal , specy and Fscore values such as 95.35%, 93.28%, 93.61%, 96.30% and 93.44% correspondingly. Also, on neutral class, the presented BROFDL-AASC approach reached accuy , precn , recal , specy and Fscore values such as 97.79%, 92.86%, 71.37%, 99.62%, and 80.71% correspondingly.

Figure 7: Results of the analysis of BROFDL-AASC approach under 30% of TS data

Both Training Accuracy (TRA) and Validation Accuracy (VLA) values, attained by the proposed BROFDL-AASC methodology on test dataset, are depicted in Fig. 8. The experimental outcomes infer that the proposed BROFDL-AASC approach obtained the maximum TRA and VLA values whereas VLA values were higher than TRA.

Figure 8: TRA and VLA analyses results of BROFDL-AASC approach

Both Training Loss (TRL) and Validation Loss (VLL) values, obtained by BROFDL-AASC methodology on test dataset, are depicted in Fig. 9. The experimental outcomes imply that the proposed BROFDL-AASC approach achieved the minimal TRL and VLL values whereas VLL values were lower than TRL.

Figure 9: TRL and VLL analyses results of BROFDL-AASC approach

A clear precision-recall analysis was conducted upon BROFDL-AASC approach on test dataset and the results are displayed in Fig. 10. The figure represents that BROFDL-AASC algorithm achieved enhanced precision-recall values under all the classes.

Figure 10: Precision-recall analysis results of BROFDL-AASC approach

A brief ROC analysis was conducted upon BROFDL-AASC algorithm on test dataset and the results are portrayed in Fig. 11. The results imply that the proposed BROFDL-AASC technique exhibited its ability in categorizing the test dataset under distinct classes.

Figure 11: ROC analysis results of BROFDL-AASC approach

At last, a comparison study was conducted between BROFDL-AASC model and other recent models and the results are demonstrated in Table 4 and [7]. The experimental outcomes infer that the proposed BROFDL-AASC model outperformed other methods. With respect to accuy , BROFDL-AASC model produced a high accuy of 96.14%, whereas INSIGTH-1, UFAL, C-IndyLSTM, AB-LSTM-PC and MBRA models achieved the least accuy values such as 89.18%, 90.02%, 87.52%, 89.62% and 91.84% respectively. Further, with respect to Fscore , the proposed BROFDL-AASC algorithm obtained a high Fscore of 89.85%, whereas INSIGTH-1, UFAL, C-IndyLSTM, AB-LSTM-PC and MBRA techniques achieved low Fscore values such as 51.69%, 54.09%, 59.29%, 55.33% and 56.17% correspondingly.

4  Conclusion

In this study, a new BROFDL-AASC technique has been developed for Arabic Aspect Based Sentiment Classification. The aim of the presented BROFDL-AASC model is to detect and classify the sentiments expressed in the Arabic language. In the presented BROFDL-AASC model, data pre-processing is performed at first to convert the input data into a useful format. Besides, the BROFDL-AASC model involves DFRBM model for identification and the categorization of sentiments. Furthermore, the BRO algorithm is exploited for optimal fine-tuning of the hyperparameters related to the FBRBM model. The performance of the proposed BROFDL-AASC model was experimentally validated and the results demonstrate the supremacy of BROFDL-AASC model over other existing models. In future, the performance of the proposed BROFDL-AASC model can be improved using hybrid metaheuristics.

Funding Statement: Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2022R281), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors would like to thank the ‎Deanship of Scientific Research at Umm Al-Qura University ‎for supporting this work by Grant Code: 22UQU4340237DSR52.

Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.

References

    1. M. A. Smadi, B. Talafha, M. Al-Ayyoub and Y. Jararweh, “Using long short-term memory deep neural networks for aspect-based sentiment analysis of arabic reviews,” International Journal of Machine Learning and Cybernetics, vol. 10, no. 8, pp. 2163–2175, 2019.

    2. S. Behdenna, F. Barigou and G. Belalem, “Towards semantic aspect-based sentiment analysis for arabic reviews,” International Journal of Information Systems in the Service Sector, vol. 12, no. 4, pp. 1–13, 2020.

    3. M. A. Smadi, M. A. Ayyoub, Y. Jararweh and O. Qawasmeh, “Enhancing aspect-based sentiment analysis of arabic hotels’ reviews using morphological, syntactic and semantic features,” Information Processing & Management, vol. 56, no. 2, pp. 308–319, 2019.

    4. F. N. Al-Wesabi, “A smart English text zero-watermarking approach based on third-level order and word mechanism of markov model,” Computers, Materials & Continua, vol. 65, no. 2, pp. 1137–1156, 2020.

    5. A. Alharbi, M. Taileb and M. Kalkatawi, “Deep learning in arabic sentiment analysis: An overview,” Journal of Information Science, vol. 47, no. 1, pp. 129–140, 2019.

    6. F. N. Al-Wesabi, “Proposing high-smart approach for content authentication and tampering detection of arabic text transmitted via internet,” IEICE Transactions on Information and Systems, vol. E103.D, no. 10, pp. 2104–2112, 2020.

    7. T. Sana, B. Ines, J. Salma and Y. B. Ayed, “A hybrid method for arabic aspect-based sentiment analysis,” International Journal of Hybrid Intelligent Systems, vol. 16, no. 2, pp. 99–110, 2020.

    8. F. N. Al-Wesabi, “A hybrid intelligent approach for content authentication and tampering detection of arabic text transmitted via internet,” Computers, Materials & Continua, vol. 66, no. 1, pp. 195–211, 2021.

    9. D. K. Tayal, S. K. Yadav and D. Arora, “Personalized ranking of products using aspect-based sentiment analysis and plithogenic sets,” Multimedia Tools and Applications, pp. 1–27. https://doi.org/10.1007/s11042-022-13315-y.

  10. F. N. Al-Wesabi, “Entropy-based watermarking approach for sensitive tamper detection of arabic text,” Computers, Materials & Continua, vol. 67, no. 3, pp. 3635–3648, 2021.

  11. S. Al-Dabet, S. Tedmori and M. AL-Smadi, “Enhancing arabic aspect-based sentiment analysis using deep learning models,” Computer Speech & Language, vol. 69, pp. 101224, 2021.

  12. M. Alassaf and A. M. Qamar, “Aspect-based sentiment analysis of arabic tweets in the education sector using a hybrid feature selection method,” in 14th Int. Conf. on Innovations in Information Technology (IIT), Al Ain, United Arab Emirates, pp. 178–185, 2020.

  13. A. Alnawas and N. Arıcı, “The corpus based approach to sentiment analysis in modern standard arabic and arabic dialects: A literature review,” Journal of Polytechnic, 2018. https://doi.org/10.2339/politeknik.403975.

  14. M. Al-Smadi, O. Qawasmeh, M. Al-Ayyoub, Y. Jararweh and B. Gupta, “Deep recurrent neural network vs. support vector machine for aspect-based sentiment analysis of arabic hotels’ reviews,” Journal of Computational Science, vol. 27, pp. 386–393, 2018.

  15. R. Bensoltane and T. Zaki, “Towards arabic aspect-based sentiment analysis: A transfer learning-based approach,” Social Network Analysis and Mining, vol. 12, no. 1, pp. 1–16, 2021.

  16. R. Kumar, H. S. Pannu and A. K. Malhi, “Aspect-based sentiment analysis using deep networks and stochastic optimization,” Neural Computing and Applications, vol. 32, no. 8, pp. 3221–3235, 2020.

  17. N. F. Alshammari and A. A. AlMansour, “Aspect-based sentiment analysis for arabic content in social media,” in Int. Conf. on Electrical, Communication, and Computer Engineering (ICECCE), Istanbul, Turkey, pp. 1–6, 2020.

  18. A. Ishaq, S. Asghar and S. A. Gillani, “Aspect-based sentiment analysis using a hybridized approach based on cnn and ga,” IEEE Access, vol. 8, pp. 135499–135, 2020.

  19. Y. Ma, H. Peng, T. Khan, E. Cambria and A. Hussain, “Sentic lstm: A hybrid network for targeted aspect-based sentiment analysis,” Cognitive Computation, vol. 10, no. 4, pp. 639–650, 2018.

  20. M. Al-Maleh and S. Desouki, “Arabic text summarization using deep learning approach,” Journal of Big Data, vol. 7, no. 1, pp. 109, 2020.

  21. C. Chen and S. Feng, “Generative and discriminative fuzzy restricted boltzmann machine learning for text and image classification,” IEEE Transactions on Cybernetics, vol. 50, no. 5, pp. 2237–2248, 2020.

  22. T. R. Farshi, “Battle royale optimization algorithm,” Neural Computing and Applications, vol. 33, no. 4, pp. 1139–1157, 2021.

[picture] | This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.