<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">30170</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.030170</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Artificial Fish Swarm Optimization with Deep Learning Enabled Opinion Mining Approach</article-title><alt-title alt-title-type="left-running-head">Artificial Fish Swarm Optimization with Deep Learning Enabled Opinion Mining Approach</alt-title><alt-title alt-title-type="right-running-head">Artificial Fish Swarm Optimization with Deep Learning Enabled Opinion Mining Approach</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Alotaibi</surname><given-names>Saud S.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Alabdulkreem</surname><given-names>Eatedal</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Althahabi</surname><given-names>Sami</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hamza</surname><given-names>Manar Ahmed</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref><email>ma.hamza@psau.edu.sa</email>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Rizwanullah</surname><given-names>Mohammed</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Zamani</surname><given-names>Abu Sarwar</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Motwakel</surname><given-names>Abdelwahed</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Marzouk</surname><given-names>Radwa</given-names></name>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Information Systems, College of Computing and Information System, Umm Al-Qura University</institution>, <addr-line>Mecca, 24382</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, College of Science &#x0026; Art at Mahayil, King Khalid University</institution>, <addr-line>Abha, 62529</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam bin Abdulaziz University</institution>, <addr-line>Al-Kharj, 16278</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Mathematics, Faculty of Science, Cairo University</institution>, <addr-line>Giza, 12613</addr-line>, <country>Egypt</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Manar Ahmed Hamza. Email: <email>ma.hamza@psau.edu.sa</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-04"><day>04</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>45</volume>
<issue>1</issue>
<fpage>737</fpage>
<lpage>751</lpage>
<history>
<date date-type="received"><day>20</day><month>3</month><year>2022</year></date>
<date date-type="accepted"><day>26</day><month>4</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Alotaibi et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Alotaibi et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_30170.pdf"></self-uri>
<abstract>
<p>Sentiment analysis or opinion mining (OM) concepts become familiar due to advances in networking technologies and social media. Recently, massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult. Since OM find useful in business sectors to improve the quality of the product as well as services, machine learning (ML) and deep learning (DL) models can be considered into account. Besides, the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process. Therefore, in this paper, a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory (AFSO-BLSTM) model has been developed for OM process. The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data. In addition, the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process. Besides, BLSTM model is employed for the effectual detection and classification of opinions. Finally, the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model, shows the novelty of the work. A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Sentiment analysis</kwd>
<kwd>opinion mining</kwd>
<kwd>natural language processing</kwd>
<kwd>artificial fish swarm algorithm</kwd>
<kwd>deep learning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>With recent advancements of the Internet, people groups, social networks, the ascent in their applications, and number of clients of interpersonal organizations, the volume of information produced has expanded [<xref ref-type="bibr" rid="ref-1">1</xref>]. In this way, it makes significant data extraction really testing. Then again, individuals are eager and glad to share their lives, information, and experience, and the immense measure of data has turned into an alluring asset for associations to screen the opinions of clients, and interpersonal organizations have been a suitable system for offering clients&#x2019; viewpoints and thoughts in different applied fields and a rich asset for clients&#x2019; opinions mining (OM) and sentiment analysis (SA) [<xref ref-type="bibr" rid="ref-2">2</xref>]. Thus, mining such information helps extricate pragmatic examples which are valuable for business, applications, and shoppers [<xref ref-type="bibr" rid="ref-3">3</xref>].</p>
<p>Since the world has been immersed with the rising measure of traveller information, the travel industry associations and businesses should keep side by side about vacationer experience and perspectives about the business, item, and administration [<xref ref-type="bibr" rid="ref-4">4</xref>]. Acquiring bits of knowledge into these fields can work with the improvement of the power system that can upgrade traveller experience and further lift vacationer dedication and suggestions. Generally, businesses depend on the organized quantitative methodology, for instance, rating vacationer fulfilment level in view of the Likert Scale [<xref ref-type="bibr" rid="ref-5">5</xref>]. Albeit this approach is viable to demonstrate or negate existing speculation, the shut finished questions can&#x2019;t uncover accurate traveller experience and sensations of the items or administrations, which hampers acquiring bits of knowledge from sightseers. All things considered, businesses have previously applied complex and progressed approaches, for example, text mining and SA, to unveil the examples taken cover behind the information and the primary subjects [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>OM is an exploration field that arrangements with data recovery and information location from the text utilizing information mining and regular language handling strategies [<xref ref-type="bibr" rid="ref-7">7</xref>]. Information mining is an interaction that utilizes information examination apparatuses to reveal and observe examples and connections among information that might prompt extraction of new data from an enormous data set. The motivation behind OM is research on opinions and contemplations, recognizable proof of arising social polarities in light of the perspectives, sentiments, states of mind, mentalities, and assumptions for the recipient gatherings or most individuals. By and large, the goal is to perceive clients&#x2019; mentalities involving investigation of their sentences in substance shipped off networks [<xref ref-type="bibr" rid="ref-8">8</xref>]. The mentalities are grouped by their polarities, in particular sure, unbiased and negative. Programmed help from the investigation interaction is vital, and because of the great volume of data, this sort of help is one of the fundamental difficulties. OM can be considered as a programmed information location whose objective is to track down secret examples in numerous thoughts, web journals, and tweets [<xref ref-type="bibr" rid="ref-9">9</xref>]. Lately, many examinations have been acted in various fields of OM in interpersonal organizations. By researching the techniques proposed in this space was defined that the principal challenges are maximum preparation cost in light of time or memory utilized, absence of advanced dictionaries, maximum elements of highlights&#x2019; space, and vagueness in sure or negative discovery of certain sentences in these strategies [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Zervoudakis et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] propose OpinionMine, a Bayesian based structure for OM, developing Twitter Data. Primarily, the structure imports Tweets extremely by utilizing Twitter application programming interface (API). Afterward, the import Tweet is more managed automatically to construct the group of untrained rules and arbitrary variables. Next, the training method is utilized to estimate of novel Tweet. At last, the created method is retraining incrementally, so developing further robust. In [<xref ref-type="bibr" rid="ref-12">12</xref>], analysis of many tweets compared with the no plastic campaign has been executed for predicting the degree of polarity and subjectivity of tweets. The analysis was separated as to stages namely removing data, pre-processed, cleaning, eliminating stop word, and computation of sentiment score. The Machine Learning (ML) technique was executed on data set compared with the no plastic campaign and analysis was completed.</p>
<p>Yadav et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] purposes for predicting the outcome of vote from Haryana in the tweet written in the English language. It can be utilized the Twitter Archiving Google Sheet (TAGS) tool and Twitter API utilizing R for obtaining the tweet. R is an extremely strong programming language and is satisfyingly employed from data interpretation and SA. Eshmawi et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] concentrate on the scheme of automated OM method utilizing deer hunting optimization algorithm (DHOA) with fuzzy neural network (FNN), named as DHOA-FNN technique. The presented DHOA-FNN approach contains 4 various phases pre-processed, feature extracting, classifier, and parameter tuning procedures. Also, the DHOA-FNN approach contains 2 phases of feature extracting like Glove and N-gram techniques. Furthermore, the FNN system was employed as a classifier method, and parameter optimized procedure occurs by GTOA.</p>
<p>In this paper, a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory (AFSO-BLSTM) model has been developed for OM process. The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data. In addition, the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process. Besides, BLSTM model is employed for the effectual detection and classification of opinions. Finally, the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model. A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Working of AFSO-BLSTM Model</title>
<p>In this article, a novel AFSO-BLSTM model has been developed for OM process. The AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process. Moreover, BLSTM model is employed for the effectual detection and classification of opinions. Then, the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the block diagram of proposed AFSO-BLSTM technique.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Block diagram of AFSO-BLSTM technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-1.png"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Pre-processing and TF-IDF Model</title>
<p>At the initial stage, the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process [<xref ref-type="bibr" rid="ref-15">15</xref>]. TF-IDF is most generally employed feature extracting manner on text analysis. Amongst the 2 important tasks of index and weighted to text analysis, TF-IDF controls the weighting. It defines the weighted of offered term <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mi>t</mml:mi></mml:math>
</inline-formula> in the given document <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>D</mml:mi></mml:math>
</inline-formula>. The TF-IDF was established in TF and IDF that were various terms and is computed as [<xref ref-type="bibr" rid="ref-15">15</xref>]:</p>
<p><disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi>T</mml:mi><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>d</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>whereas <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math>
</inline-formula> <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mi>d</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:math>
</inline-formula> refer the total count of <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mi>t</mml:mi></mml:math>
</inline-formula> occurrence from the document <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mi>D</mml:mi></mml:math>
</inline-formula>, whole count of documents, and the count of documents that include term <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mi>t</mml:mi><mml:mo>.</mml:mo></mml:math>
</inline-formula></p>
<p>The weighted of every term employing the TF-IDF is calculated by:</p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>In which <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>T</mml:mi><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>, signifies the frequency of term <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mi>t</mml:mi></mml:math>
</inline-formula> in the document <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mi>d</mml:mi></mml:math>
</inline-formula> and count of documents that comprise <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:mi>t</mml:mi><mml:mo>.</mml:mo></mml:math>
</inline-formula></p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Process Involved in BLSTM Model</title>
<p>Next to feature extraction, the BLSTM model is employed for the effectual detection and classification of opinions [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>]. The BLSTM approach receives the feature is input for recognizing the class label of activities. The LSTM improves Memory Cell infrastructures from the neural nodes of hidden layer of RNN to store the previous data and added 3 gate infrastructures such as Forget, Output, and Input gates, to handle the procedure of previous data [<xref ref-type="bibr" rid="ref-16">16</xref>]. LSTM is transfer useful information from the subsequent time computation. The <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> refers the existing state and <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math>
</inline-formula> refers the temporary state. <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo></mml:math>
</inline-formula> <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:mrow><mml:msub><mml:mn>0</mml:mn><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> correspondingly defines the forget, output, and input gates, <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> refers the hidden state of previous time and <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> implies the existing input.</p>
<p>The calculation equation is provided from the subsequent formulas:</p>
<p><disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>o</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mn>0</mml:mn><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>&#x03C4;</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2299;</mml:mo><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mi>&#x03C7;</mml:mi></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mi>&#x03C7;</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>In which <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> &#x0026; <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> signifies the weighted of 3 gates connection correspondingly, <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:mi>b</mml:mi></mml:math>
</inline-formula> stands for the offset, <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:mi>&#x03C3;</mml:mi></mml:math>
</inline-formula> and<inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:math>
</inline-formula> implies the activation function. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts the framework of BLSTM.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Framework of BiLSTM</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-2.png"/>
</fig>
<p>Long short term memory (LSTM) is only learned from the abovementioned data of time sequence, BLSTM generates a more increase dependent upon LSTM, for instance, developed up of reverse as well as forward LSTM network, offering the context data of time sequence. At this point, <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi>&#x03C7;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C7;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C7;</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> signifies the input sequence, <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> &#x0026; <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula> refers the forward as well as reverse output calculated at every moment correspondingly, and then the reverse as well as forward outputs were estimated to reach the final result <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. Proceeds the forward output <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> at time <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:mi>t</mml:mi></mml:math>
</inline-formula> as sample, the calculation equation of backward as well as forward ways were consistent with LSTM, for instance, by &#x201C;(1)&#x201D; to &#x201C;(8)&#x201D;, the reverse as well as forward temporary cell states <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:mover><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> &#x0026; <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:mover><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula>, input gates <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:mover><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> &#x0026; <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:mover><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula>, forget gates <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mover><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> &#x0026; <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:mover><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mo>,</mml:mo></mml:math>
</inline-formula> output gates <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:mover><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> and <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:mover><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula> are measured correspondingly.</p>
<p>The final outcome <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> at time <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:mi>t</mml:mi></mml:math>
</inline-formula> is:</p>
<p><disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>In the abovementioned formulas, it calculates the outcome at every moment, and later reach the final output <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo></mml:math>
</inline-formula> <inline-formula id="ieqn-43">
<mml:math id="mml-ieqn-43"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math>
</inline-formula></p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Process Involved in AFSO Based Parameter Optimization</title>
<p>At the final stage of OM, the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model [<xref ref-type="bibr" rid="ref-17">17</xref>]. AFSO algorithm is a type of SI technique depending upon the performance of animals. Is baseline being the stimulation of clustering, collision, and foraging behaviors of fish and the cooperative provision in a fish swarm to understand a global optimal point. The maximum distance passed by the artificial fish technique is defined as <italic>Step</italic>, the obvious distance passes by the artificial fish is defined as <italic>Visual</italic>, the repeat quantity signifies the <inline-formula id="ieqn-44">
<mml:math id="mml-ieqn-44"><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow></mml:math>
</inline-formula><italic>Number</italic> the factor of crowd total characterize <inline-formula id="ieqn-45">
<mml:math id="mml-ieqn-45"><mml:mi>&#x03B7;</mml:mi></mml:math>
</inline-formula>. The place of ingle artificial fish can be described as the resultant vector <inline-formula id="ieqn-46">
<mml:math id="mml-ieqn-46"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula>, and the distance amongst artificial fishes <inline-formula id="ieqn-47">
<mml:math id="mml-ieqn-47"><mml:mi>i</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-48">
<mml:math id="mml-ieqn-48"><mml:mi>j</mml:mi></mml:math>
</inline-formula> represents <inline-formula id="ieqn-49">
<mml:math id="mml-ieqn-49"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math>
</inline-formula>. Consider that the fish observes the food through the eye, the existing position is <inline-formula id="ieqn-50">
<mml:math id="mml-ieqn-50"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, along with a subjectively designated place is <inline-formula id="ieqn-51">
<mml:math id="mml-ieqn-51"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> with the perception,</p>
<p><disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x223C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>while <italic>rand</italic> (0&#x2013;1) characterizes an arbitrary value amongst zero &#x0026; one. After <inline-formula id="ieqn-52">
<mml:math id="mml-ieqn-52"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&gt;</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, the fish moves in that path. Otherwise, the technique subjectively chooses a novel place <inline-formula id="ieqn-53">
<mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> for arbitrating it accomplishes the moving conditions:</p>
<p><disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup></mml:mrow><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x223C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>After it does not <inline-formula id="ieqn-54">
<mml:math id="mml-ieqn-54"><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow></mml:math>
</inline-formula><italic>Number</italic> times, an arbitrary motion is created as:</p>
<p><disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x223C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>To avoid over-crowding, an artificial current place <inline-formula id="ieqn-55">
<mml:math id="mml-ieqn-55"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> is set. Following, the sum of fish in its <inline-formula id="ieqn-56">
<mml:math id="mml-ieqn-56"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> firm and <inline-formula id="ieqn-57">
<mml:math id="mml-ieqn-57"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> center in the area <inline-formula id="ieqn-58">
<mml:math id="mml-ieqn-58"><mml:mo stretchy="false">(</mml:mo></mml:math>
</inline-formula>viz., <inline-formula id="ieqn-59">
<mml:math id="mml-ieqn-59"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&lt;</mml:mo><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> are described. Once <inline-formula id="ieqn-60">
<mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow><mml:mo>&lt;</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, the place of companion characterizes an ideal quantity of food and lesser crowd. Next, the fish move towards the companion centre:</p>
<p><disp-formula id="eqn-16"><label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup></mml:mrow><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x223C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>Otherwise, it begins to accomplish the prey behavior.</p>
<p>The current place of artificial fish swarm is described as <inline-formula id="ieqn-61">
<mml:math id="mml-ieqn-61"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. The swarm determines foremost firm <inline-formula id="ieqn-62">
<mml:math id="mml-ieqn-62"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> as <inline-formula id="ieqn-63">
<mml:math id="mml-ieqn-63"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> in the area <inline-formula id="ieqn-64">
<mml:math id="mml-ieqn-64"><mml:mo stretchy="false">(</mml:mo></mml:math>
</inline-formula>viz. <inline-formula id="ieqn-65">
<mml:math id="mml-ieqn-65"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&lt;</mml:mo><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:math>
</inline-formula>). Once <inline-formula id="ieqn-66">
<mml:math id="mml-ieqn-66"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow><mml:mo>&lt;</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, the location of company characterizes an optimum quantity of food and slighter crowding. Then, the swarm moved to <inline-formula id="ieqn-67">
<mml:math id="mml-ieqn-67"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>:</p>
<p><disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup></mml:mrow><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x223C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>It allows artificial fish to accomplish food and company over a great region. A place is subjectively selected, along with artificial fish moved to them.</p>
<p>Through the searching region of <inline-formula id="ieqn-68">
<mml:math id="mml-ieqn-68"><mml:mi>D</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:math>
</inline-formula>, very likely distance amid 2 artificial fishes is exploited for energetically restraining the <italic>Visual</italic> &#x0026; <italic>Step</italic> of an artificial fish. It can be described as <inline-formula id="ieqn-69">
<mml:math id="mml-ieqn-69"><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>D</mml:mi></mml:math>
</inline-formula>:</p>
<p><disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>D</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>D</mml:mi></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>In which <inline-formula id="ieqn-70">
<mml:math id="mml-ieqn-70"><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-71">
<mml:math id="mml-ieqn-71"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> indicates the lower and upper boundaries of the optimization, and <inline-formula id="ieqn-72">
<mml:math id="mml-ieqn-72"><mml:mi>D</mml:mi></mml:math>
</inline-formula> designates the dimension of the searching region.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Validation</title>
<p>In this section, the performance validation of the AFSO-BLSTM model is tested using three benchmark datasets namely IMDB Dataset [<xref ref-type="bibr" rid="ref-18">18</xref>], Amazon Products Dataset [<xref ref-type="bibr" rid="ref-19">19</xref>], and Twitter Dataset [<xref ref-type="bibr" rid="ref-20">20</xref>]. All these three datasets comprises two class labels namely positive and negative.</p>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrate a comprehensive comparative study of the AFSO-BLSTM model on the test IMDB dataset [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. The outcomes indicated that the AFSO-BLSTM model has showcased enhanced performance over the other models under distinct feature extraction techniques. With unigram features, the AFSO-BLSTM model has offered <inline-formula id="ieqn-73">
<mml:math id="mml-ieqn-73"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-74">
<mml:math id="mml-ieqn-74"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-75">
<mml:math id="mml-ieqn-75"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.97%, 99.90%, 99.21%, and 99.87% respectively. In line with, with bigram features, the AFSO-BLSTM model has offered <inline-formula id="ieqn-76">
<mml:math id="mml-ieqn-76"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-77">
<mml:math id="mml-ieqn-77"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-78">
<mml:math id="mml-ieqn-78"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.68%, 99.79%, 99.22%, and 99.60% respectively. Followed by, with trigram features, the AFSO-BLSTM model has depicted <inline-formula id="ieqn-79">
<mml:math id="mml-ieqn-79"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-80">
<mml:math id="mml-ieqn-80"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-81">
<mml:math id="mml-ieqn-81"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.53%, 99.65%, 99.54%, and 99.48% respectively. At last, with TF-IDF features, the AFSO-BLSTM model has provided <inline-formula id="ieqn-82">
<mml:math id="mml-ieqn-82"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-83">
<mml:math id="mml-ieqn-83"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-84">
<mml:math id="mml-ieqn-84"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.61%, 99.17%, 98.95%, and 99.53% respectively.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Comparison study of AFSO-BLSTM model on IMDB dataset</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead valign="top">
<tr>
<th rowspan="2">Methods</th>
<th rowspan="2">Measures</th>
<th colspan="4" align="center">Feature extraction techniques</th>
</tr>
<tr>
<th>Unigram</th>
<th>Bigram</th>
<th>Trigram</th>
<th>TF-IDF</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="4">A-boost algorithm    </td>
<td>Accuracy</td>
<td>80.21</td>
<td>65.90</td>
<td>58.34</td>
<td>81.88</td>
</tr>
<tr>
<td>Precision</td>
<td>80.67</td>
<td>72.00</td>
<td>68.05</td>
<td>82.67</td>
</tr>
<tr>
<td>Recall</td>
<td>79.71</td>
<td>64.43</td>
<td>57.31</td>
<td>82.11</td>
</tr>
<tr>
<td>F-score</td>
<td>79.92</td>
<td>69.61</td>
<td>62.72</td>
<td>82.40</td>
</tr>
<tr>
<td rowspan="4">Support Vector Machine (SVM) algorithm</td>
<td>Accuracy</td>
<td>86.70</td>
<td>85.84</td>
<td>72.49</td>
<td>87.15</td>
</tr>
<tr>
<td>Precision</td>
<td>85.25</td>
<td>84.77</td>
<td>75.31</td>
<td>88.28</td>
</tr>
<tr>
<td>Recall</td>
<td>85.12</td>
<td>86.15</td>
<td>72.57</td>
<td>87.91</td>
</tr>
<tr>
<td>F-score</td>
<td>86.43</td>
<td>86.24</td>
<td>73.66</td>
<td>87.91</td>
</tr>
<tr>
<td rowspan="4">Logistic Regression (LOR) algorithm</td>
<td>Accuracy</td>
<td>87.12</td>
<td>85.60</td>
<td>72.67</td>
<td>89.03</td>
</tr>
<tr>
<td>Precision</td>
<td>88.18</td>
<td>84.42</td>
<td>73.73</td>
<td>87.56</td>
</tr>
<tr>
<td>Recall</td>
<td>87.70</td>
<td>85.79</td>
<td>72.99</td>
<td>89.26</td>
</tr>
<tr>
<td>F-score</td>
<td>87.74</td>
<td>85.62</td>
<td>72.11</td>
<td>87.51</td>
</tr>
<tr>
<td rowspan="4">DH-FNN</td>
<td>Accuracy</td>
<td>98.82</td>
<td>99.60</td>
<td>99.41</td>
<td>99.85</td>
</tr>
<tr>
<td>Precision</td>
<td>99.49</td>
<td>99.63</td>
<td>99.28</td>
<td>99.50</td>
</tr>
<tr>
<td>Recall</td>
<td>99.02</td>
<td>98.97</td>
<td>99.31</td>
<td>99.02</td>
</tr>
<tr>
<td>F-score</td>
<td>99.65</td>
<td>99.02</td>
<td>99.37</td>
<td>99.20</td>
</tr>
<tr>
<td rowspan="4">AFSO-BLSTM</td>
<td>Accuracy</td>
<td>99.97</td>
<td>99.68</td>
<td>99.53</td>
<td>99.61</td>
</tr>
<tr>
<td>Precision</td>
<td>99.90</td>
<td>99.79</td>
<td>99.65</td>
<td>99.17</td>
</tr>
<tr>
<td>Recall</td>
<td>99.21</td>
<td>99.22</td>
<td>99.54</td>
<td>98.95</td>
</tr>
<tr>
<td>F-score</td>
<td>99.87</td>
<td>99.60</td>
<td>99.48</td>
<td>99.53</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Comparative analysis of AFSO-BLSTM technique on IMDB dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-3.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> illustrates the training and validation accuracy inspection of the AFSO-BLSTM model on IMDB dataset. The figure conveyed that the AFSO-BLSTM model has offered maximum training/validation accuracy on classification process.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Accuracy analysis of AFSO-BLSTM technique under IMDB dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-4.png"/>
</fig>
<p>Next, <xref ref-type="fig" rid="fig-5">Fig. 5</xref> exemplifies the training and validation loss inspection of the AFSO-BLSTM model on IMDB dataset. The figure reported that the AFSO-BLSTM model has offered reduced training/accuracy loss on the classification process of test data.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Loss analysis of AFSO-BLSTM technique under IMDB dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-5.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-6">Fig. 6</xref> demonstrate a comprehensive comparative study of the AFSO-BLSTM model on the test Amazon dataset. The outcomes referred that the AFSO-BLSTM model has showcased enhanced performance over the other models under distinct feature extraction techniques. With unigram features, the AFSO-BLSTM method has offered <inline-formula id="ieqn-85">
<mml:math id="mml-ieqn-85"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-86">
<mml:math id="mml-ieqn-86"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-87">
<mml:math id="mml-ieqn-87"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.95%, 99.95%, 99.44%, and 99.78% respectively. Along with that, with bigram features, the AFSO-BLSTM system has offered <inline-formula id="ieqn-88">
<mml:math id="mml-ieqn-88"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-89">
<mml:math id="mml-ieqn-89"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-90">
<mml:math id="mml-ieqn-90"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 98.91%, 99.07%, 99.86%, and 99.77% respectively. Followed by, with trigram features, the AFSO-BLSTM approach has depicted <inline-formula id="ieqn-91">
<mml:math id="mml-ieqn-91"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-92">
<mml:math id="mml-ieqn-92"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-93">
<mml:math id="mml-ieqn-93"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 90.12%, 94.63%, 97.52%, and 96.93% correspondingly. Eventually, with TF-IDF features, the AFSO-BLSTM methodology has provided <inline-formula id="ieqn-94">
<mml:math id="mml-ieqn-94"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-95">
<mml:math id="mml-ieqn-95"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-96">
<mml:math id="mml-ieqn-96"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.09%, 99.45%, 99.34%, and 99.41% respectively.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparison study of AFSO-BLSTM model on amazon dataset</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead valign="top">
<tr>
<th rowspan="2">Methods</th>
<th rowspan="2">Measures</th>
<th colspan="4" align="center">Feature extraction techniques</th>
</tr>
<tr>
<th>Unigram</th>
<th>Bigram</th>
<th>Trigram</th>
<th>TF-IDF</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="4">A-boost algorithm    </td>
<td>Accuracy</td>
<td>84.18</td>
<td>64.26</td>
<td>55.00</td>
<td>86.36</td>
</tr>
<tr>
<td>Precision</td>
<td>85.12</td>
<td>77.37</td>
<td>75.72</td>
<td>85.63</td>
</tr>
<tr>
<td>Recall</td>
<td>84.38</td>
<td>64.92</td>
<td>54.81</td>
<td>85.27</td>
</tr>
<tr>
<td>F-Score</td>
<td>84.19</td>
<td>70.53</td>
<td>64.83</td>
<td>85.85</td>
</tr>
<tr>
<td rowspan="4">SVM Algorithm</td>
<td>Accuracy</td>
<td>78.53</td>
<td>68.14</td>
<td>52.07</td>
<td>81.31</td>
</tr>
<tr>
<td>Precision</td>
<td>78.82</td>
<td>73.40</td>
<td>64.57</td>
<td>81.02</td>
</tr>
<tr>
<td>Recall</td>
<td>80.16</td>
<td>66.75</td>
<td>52.56</td>
<td>82.16</td>
</tr>
<tr>
<td>F-score</td>
<td>78.92</td>
<td>70.83</td>
<td>56.84</td>
<td>80.11</td>
</tr>
<tr>
<td rowspan="4">LOR algorithm</td>
<td>Accuracy</td>
<td>80.95</td>
<td>66.26</td>
<td>51.33</td>
<td>83.07</td>
</tr>
<tr>
<td>Precision</td>
<td>80.83</td>
<td>73.51</td>
<td>64.97</td>
<td>84.65</td>
</tr>
<tr>
<td>Recall</td>
<td>81.11</td>
<td>66.30</td>
<td>51.03</td>
<td>81.83</td>
</tr>
<tr>
<td>F-score</td>
<td>80.47</td>
<td>69.59</td>
<td>58.17</td>
<td>82.35</td>
</tr>
<tr>
<td rowspan="4">DH-FNN</td>
<td>Accuracy</td>
<td>99.87</td>
<td>98.46</td>
<td>88.83</td>
<td>98.75</td>
</tr>
<tr>
<td>Precision</td>
<td>99.84</td>
<td>98.66</td>
<td>90.73</td>
<td>99.17</td>
</tr>
<tr>
<td>Recall</td>
<td>99.19</td>
<td>97.71</td>
<td>89.59</td>
<td>98.93</td>
</tr>
<tr>
<td>F-score</td>
<td>99.26</td>
<td>98.36</td>
<td>89.86</td>
<td>99.18</td>
</tr>
<tr>
<td rowspan="4">AFSO-BLSTM</td>
<td>Accuracy</td>
<td>99.95</td>
<td>98.91</td>
<td>90.12</td>
<td>99.09</td>
</tr>
<tr>
<td>Precision</td>
<td>99.95</td>
<td>99.07</td>
<td>94.63</td>
<td>99.45</td>
</tr>
<tr>
<td>Recall</td>
<td>99.44</td>
<td>99.86</td>
<td>97.52</td>
<td>99.34</td>
</tr>
<tr>
<td>F-score</td>
<td>99.78</td>
<td>99.77</td>
<td>96.93</td>
<td>99.41</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Comparative analysis of AFSO-BLSTM technique on Amazon dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-6.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> showcases the training and validation accuracy inspection of the AFSO-BLSTM method on Amazon dataset. The figure exposed that the AFSO-BLSTM model has offered maximum training/validation accuracy on classification process.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Accuracy analysis of AFSO-BLSTM technique under Amazon dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-7.png"/>
</fig>
<p>Afterward, <xref ref-type="fig" rid="fig-8">Fig. 8</xref> exemplifies the training and validation loss inspection of the AFSO-BLSTM technique on Amazon dataset. The figure revealed that the AFSO-BLSTM system has offered reduced training/accuracy loss on the classification process of test data.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Loss analysis of AFSO-BLSTM technique under Amazon dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-8.png"/>
</fig>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-9">Fig. 9</xref> demonstrate a comprehensive comparative study of the AFSO-BLSTM approach on the test Twitter dataset. The outcomes represented that the AFSO-BLSTM model has showcased enhanced performance over the other techniques under distinct feature extraction techniques. With unigram features, the AFSO-BLSTM model has offered <inline-formula id="ieqn-97">
<mml:math id="mml-ieqn-97"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-98">
<mml:math id="mml-ieqn-98"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-99">
<mml:math id="mml-ieqn-99"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.87%, 99.93%, 99.91%, and 99.63% correspondingly. Also, with bigram features, the AFSO-BLSTM model has offered <inline-formula id="ieqn-100">
<mml:math id="mml-ieqn-100"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-101">
<mml:math id="mml-ieqn-101"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-102">
<mml:math id="mml-ieqn-102"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.51%, 99.36%, 99.55%, and 99.54% correspondingly. Similarly, with trigram features, the AFSO-BLSTM approach has depicted <inline-formula id="ieqn-103">
<mml:math id="mml-ieqn-103"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-104">
<mml:math id="mml-ieqn-104"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-105">
<mml:math id="mml-ieqn-105"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 97.37%, 98.37%, 98.57%, and 98.29% correspondingly. At last, with TF-IDF features, the AFSO-BLSTM technique has provided <inline-formula id="ieqn-106">
<mml:math id="mml-ieqn-106"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-107">
<mml:math id="mml-ieqn-107"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>, and <inline-formula id="ieqn-108">
<mml:math id="mml-ieqn-108"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> of 99.68%, 99.74%, 99.95%, and 99.29% correspondingly.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Comparison study of AFSO-BLSTM model on twitter dataset</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead valign="top">
<tr>
<th rowspan="2">Methods</th>
<th rowspan="2">Measures</th>
<th colspan="4" align="center">Feature extraction techniques</th>
</tr>
<tr>
<th>Unigram</th>
<th>Bigram</th>
<th>Trigram</th>
<th>TF-IDF</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="4">A-boost algorithm    </td>
<td>Accuracy</td>
<td>64.77</td>
<td>51.99</td>
<td>51.31</td>
<td>68.76</td>
</tr>
<tr>
<td>Precision</td>
<td>65.62</td>
<td>67.82</td>
<td>62.97</td>
<td>71.39</td>
</tr>
<tr>
<td>Recall</td>
<td>65.26</td>
<td>52.18</td>
<td>51.74</td>
<td>66.59</td>
</tr>
<tr>
<td>F-score</td>
<td>66.74</td>
<td>59.20</td>
<td>56.17</td>
<td>68.90</td>
</tr>
<tr>
<td rowspan="4">SVM Algorithm</td>
<td>Accuracy</td>
<td>75.81</td>
<td>66.25</td>
<td>52.61</td>
<td>75.64</td>
</tr>
<tr>
<td>Precision</td>
<td>74.81</td>
<td>67.37</td>
<td>62.32</td>
<td>75.20</td>
</tr>
<tr>
<td>Recall</td>
<td>75.77</td>
<td>64.88</td>
<td>52.53</td>
<td>76.56</td>
</tr>
<tr>
<td>F-score</td>
<td>74.14</td>
<td>65.07</td>
<td>57.38</td>
<td>74.17</td>
</tr>
<tr>
<td rowspan="4">LOR algorithm</td>
<td>Accuracy</td>
<td>73.18</td>
<td>64.59</td>
<td>54.34</td>
<td>72.67</td>
</tr>
<tr>
<td>Precision</td>
<td>72.71</td>
<td>65.63</td>
<td>60.66</td>
<td>72.98</td>
</tr>
<tr>
<td>Recall</td>
<td>74.61</td>
<td>65.52</td>
<td>53.45</td>
<td>73.97</td>
</tr>
<tr>
<td>F-score</td>
<td>73.49</td>
<td>65.86</td>
<td>57.91</td>
<td>73.54</td>
</tr>
<tr>
<td rowspan="4">DH-FNN</td>
<td>Accuracy</td>
<td>93.33</td>
<td>99.41</td>
<td>96.77</td>
<td>91.48</td>
</tr>
<tr>
<td>Precision</td>
<td>93.55</td>
<td>99.10</td>
<td>97.59</td>
<td>92.98</td>
</tr>
<tr>
<td>Recall</td>
<td>94.56</td>
<td>99.21</td>
<td>97.42</td>
<td>91.97</td>
</tr>
<tr>
<td>F-score</td>
<td>93.10</td>
<td>99.38</td>
<td>96.78</td>
<td>93.46</td>
</tr>
<tr>
<td rowspan="4">AFSO-BLSTM</td>
<td>Accuracy</td>
<td>99.87</td>
<td>99.51</td>
<td>97.37</td>
<td>99.68</td>
</tr>
<tr>
<td>Precision</td>
<td>99.93</td>
<td>99.36</td>
<td>98.37</td>
<td>99.74</td>
</tr>
<tr>
<td>Recall</td>
<td>99.91</td>
<td>99.55</td>
<td>98.57</td>
<td>99.95</td>
</tr>
<tr>
<td>F-score</td>
<td>99.63</td>
<td>99.54</td>
<td>98.29</td>
<td>99.29</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Comparative analysis of AFSO-BLSTM technique on Twitter dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-9.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-10">Fig. 10</xref> depicts the training and validation accuracy inspection of the AFSO-BLSTM approach on Twitter dataset. The figure conveyed that the AFSO-BLSTM model has offered maximal training/validation accuracy on classification process.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Accuracy analysis of AFSO-BLSTM technique under Twitter dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-10.png"/>
</fig>
<p>Then, <xref ref-type="fig" rid="fig-11">Fig. 11</xref> typifies the training and validation loss inspection of the AFSO-BLSTM approach on Twitter dataset. The figure reported that the AFSO-BLSTM model has offered reduced training/accuracy loss on the classification process of test data.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Loss analysis of AFSO-BLSTM technique under Twitter dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_30170-fig-11.png"/>
</fig>
<p>The above mentioned results and discussion indicated the supremacy of the AFSO-BLSTM model on the OM tasks.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this article, a novel AFSO-BLSTM model has been developed for OM process. The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data. In addition, the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process. Besides, BLSTM model is employed for the effectual detection and classification of opinions. Finally, the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model. A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions. In future, hybrid DL models can be included to further boost the classification efficiency of the BLSTM model.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number (RGP 2/142/43).</p>
</fn>
<fn fn-type="other">
<p>Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R161), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.</p>
</fn>
<fn fn-type="other">
<p>The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: (22UQU4210118DSR08).</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Keyvanpour</surname></string-name>, <string-name><given-names>Z. K.</given-names> <surname>Zandian</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Heidarypanah</surname></string-name></person-group>, &#x201C;<article-title>OMLML: A helpful opinion mining method based on lexicon and machine learning in social networks</article-title>,&#x201D; <source>Social Network Analysis and Mining</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>10</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. L. B.</given-names> <surname>Estrada</surname></string-name>, <string-name><given-names>R. Z.</given-names> <surname>Cabada</surname></string-name>, <string-name><given-names>R. O.</given-names> <surname>Bustillos</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Graff</surname></string-name></person-group>, &#x201C;<article-title>Opinion mining and emotion recognition applied to learning environments</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>150</volume>, pp. <fpage>113265</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Alfrjani</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Osman</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Cosma</surname></string-name></person-group>, &#x201C;<article-title>A hybrid semantic knowledgebase-machine learning approach for opinion mining</article-title>,&#x201D; <source>Data &#x0026; Knowledge Engineering</source>, vol. <volume>121</volume>, no. <issue>7</issue>, pp. <fpage>88</fpage>&#x2013;<lpage>108</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Cassee</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Serebrenik</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Bavota</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Novielli</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Opinion mining for software development: A systematic literature review</article-title>,&#x201D; <source>ACM Transactions on Software Engineering and Methodology</source>, vol. <volume>31</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>41</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Cherif</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Madani</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Kissi</surname></string-name></person-group>, &#x201C;<article-title>Supervised classification by thresholds: Application to automated text categorization and opinion mining</article-title>,&#x201D; <source>Concurrency and Computation: Practice and Experience</source>, vol. <volume>34</volume>, no. <issue>4</issue>, pp. <fpage>e6613</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>S. R.</given-names> <surname>George</surname></string-name>, <string-name><given-names>P. S.</given-names> <surname>Kumar</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>George</surname></string-name></person-group>, &#x201C;<chapter-title>Conceptual framework model for opinion mining for brands in facebook engagements using machine learning tools</chapter-title>,&#x201D; in: <source>ICT Analysis and Applications, Lecture Notes in Networks and Systems Book Series</source>, vol. <volume>154</volume>, <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>115</fpage>&#x2013;<lpage>121</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Bi</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Review on video object tracking based on deep learning</article-title>,&#x201D; <source>Journal of New Media</source>, vol. <volume>1</volume>, no. <issue>2</issue>, pp. <fpage>63</fpage>&#x2013;<lpage>74</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>G. Z.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>P. S.</given-names> <surname>Chang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A multi-feature learning model with enhanced local attention for vehicle re-identification</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>69</volume>, no. <issue>3</issue>, pp. <fpage>3549</fpage>&#x2013;<lpage>3561</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Susmitha</surname></string-name> and <string-name><given-names>R. L.</given-names> <surname>Pranitha</surname></string-name></person-group>, &#x201C;<article-title>Performance assessment using supervised machine learning algorithms of opinion mining on social media dataset</article-title>,&#x201D; in <conf-name>Proc. of Second Int. Conf. on Advances in Computer Engineering and Communication Systems, Algorithms for Intelligent Systems Book Series</conf-name>, <publisher-loc>Singapore</publisher-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>419</fpage>&#x2013;<lpage>427</lpage>, <year>202</year>. </mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>M. S.</given-names> <surname>Jacobnd</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Rajendran</surname></string-name></person-group>, &#x201C;<chapter-title>Deceptive product review identification framework using opinion mining and machine learning</chapter-title>,&#x201D; in <source>Mobile Radio Communications and 5G Networks, Lecture Notes in Networks and Systems Book Series</source>, vol. <volume>339</volume>, <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>57</fpage>&#x2013;<lpage>72</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Zervoudakis</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Marakakis</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Kondylakis</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Goumas</surname></string-name></person-group>, &#x201C;<article-title>OpinionMine: A bayesian-based framework for opinion mining using twitter data</article-title>,&#x201D; <source>Machine Learning with Applications</source>, vol. <volume>3</volume>, no. <issue>3</issue>, pp. <fpage>100018</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. A.</given-names> <surname>Surabhi</surname></string-name> and <string-name><given-names>A. K.</given-names> <surname>Jain</surname></string-name></person-group>, &#x201C;<article-title>Twitter sentiment analysis on Indian Government schemes using machine learning models</article-title>,&#x201D; <source>International Journal of Swarm Intelligence</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>39</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Yadav</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sharma</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ahmad</surname></string-name> and <string-name><given-names>U.</given-names> <surname>Chandra</surname></string-name></person-group>, &#x201C;<chapter-title>Political sentiment analysis: Case study of haryana using machine learning</chapter-title>,&#x201D; in <source>Mobile Radio Communications and 5G Networks, Lecture Notes in Networks and Systems Book Series</source>, vol. <volume>339</volume>, <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>479</fpage>&#x2013;<lpage>499</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. A.</given-names> <surname>Eshmawi</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Alhumyani</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Khalek</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Saeed</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ragab</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Design of automated opinion mining model using optimized fuzzy neural network</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>2</issue>, pp. <fpage>2543</fpage>&#x2013;<lpage>2557</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Yoshida</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Tang</surname></string-name></person-group>, &#x201C;<article-title>A comparative study of TF&#x002A;IDF, LSI and multi-words for text classification</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>38</volume>, no. <issue>3</issue>, pp. <fpage>2758</fpage>&#x2013;<lpage>2765</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>He</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Improving sentiment analysis via sentence type classification using BiLSTM-CRF and CNN</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>72</volume>, no. <issue>8</issue>, pp. <fpage>221</fpage>&#x2013;<lpage>230</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Neshat</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Sepidnam</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sargolzaei</surname></string-name> and <string-name><given-names>A. N.</given-names> <surname>Toosi</surname></string-name></person-group>, &#x201C;<article-title>Artificial fish swarm algorithm: A survey of the state-of-the-art, hybridization, combinatorial and indicative applications</article-title>,&#x201D; <source>Artificial Intelligence Review</source>, vol. <volume>42</volume>, no. <issue>4</issue>, pp. <fpage>965</fpage>&#x2013;<lpage>997</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. L.</given-names> <surname>Maas</surname></string-name>, <string-name><given-names>R. E.</given-names> <surname>Daly</surname></string-name>, <string-name><given-names>P. T.</given-names> <surname>Pham</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>A. Y.</given-names> <surname>Ng</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Learning word vectors for sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</conf-name>, <publisher-loc>Portland, Oregon, USA</publisher-loc>, pp. <fpage>19</fpage>&#x2013;<lpage>24</lpage>, <year>2011</year>. </mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Kotzias</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Denil</surname></string-name>, <string-name><given-names>N.</given-names> <surname>de Freitas</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Smyth</surname></string-name></person-group>, &#x201C;<article-title>From group to individual labels using deep features</article-title>,&#x201D; in <conf-name>Proc. of the 21th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining</conf-name>, <publisher-loc>Sydney, NSW Australia</publisher-loc>, pp. <fpage>597</fpage>&#x2013;<lpage>606</lpage>, <year>2015</year>. </mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Twitter Sentiment Analysis Training Corpus (Dataset)</collab></person-group>, <uri>http://thinknook.com/twittersentiment-analysis-training-corpus-dataset-2012-09-22/</uri>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Alfrjani</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Osman</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Cosma</surname></string-name></person-group>, &#x201C;<article-title>A hybrid semantic knowledgebase-machine learning approach for opinion mining</article-title>,&#x201D; <source>Data &#x0026; Knowledge Engineering</source>, vol. <volume>121</volume>, no. <issue>7</issue>, pp. <fpage>88</fpage>&#x2013;<lpage>108</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Gamal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alfonse</surname></string-name>, <string-name><given-names>E. S. M. E.</given-names> <surname>Horbaty</surname></string-name> and <string-name><given-names>A. B. M.</given-names> <surname>Salem</surname></string-name></person-group>, &#x201C;<article-title>Analysis of machine learning algorithms for opinion mining in different domains</article-title>,&#x201D; <source>Machine Learning and Knowledge Extraction</source>, vol. <volume>1</volume>, no. <issue>1</issue>, pp. <fpage>224</fpage>&#x2013;<lpage>234</lpage>, <year>2018</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>