<?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">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">21502</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.021502</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Artificial Intelligence Based Sentiment Analysis for Health Crisis Management in Smart Cities</article-title>
<alt-title alt-title-type="left-running-head">Artificial Intelligence Based Sentiment Analysis for Health Crisis Management in Smart Cities</alt-title>
<alt-title alt-title-type="right-running-head">Artificial Intelligence Based Sentiment Analysis for Health Crisis Management in Smart Cities</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author"><name name-style="western"><surname>Hilal</surname><given-names>Anwer Mustafa</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>Alfurhood</surname><given-names>Badria Sulaiman</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>Al-Wesabi</surname><given-names>Fahd N.</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><xref ref-type="aff" rid="aff-4">4</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-1">1</xref><email>ma.hamza@psau.edu.sa</email>
</contrib>
<contrib id="author-5" contrib-type="author"><name name-style="western"><surname>Duhayyim</surname><given-names>Mesfer Al</given-names></name><xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<contrib id="author-6" contrib-type="author"><name name-style="western"><surname>Iskandar</surname><given-names>Huda G.</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><xref ref-type="aff" rid="aff-6">6</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam Bin Abdulaziz University</institution>, <addr-line>Alkharj</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, King Khalid University</institution>, <addr-line>Muhayel Aseer</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Faculty of Computer and IT, Sana&#x0027;a University</institution>, <addr-line>Sana&#x0027;a</addr-line>, <country>Yemen</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Natural and Applied Sciences, College of Community-Aflaj, Prince Sattam Bin Abdulaziz University</institution>, <country>Saudi Arabia</country></aff>
<aff id="aff-6"><label>6</label><institution>School of Computing, Faculty of Engineering, Universiti Teknologi Malaysia</institution>, <country>Malaysia</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="2021-10-18"><day>18</day>
<month>10</month>
<year>2021</year></pub-date>
<volume>71</volume>
<issue>1</issue>
<fpage>143</fpage>
<lpage>157</lpage>
<history>
<date date-type="received"><day>05</day><month>7</month><year>2021</year></date>
<date date-type="accepted"><day>07</day><month>8</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Hilal et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Hilal 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_CMC_21502.pdf"></self-uri>
<abstract>
<p>Smart city promotes the unification of conventional urban infrastructure and information technology (IT) to improve the quality of living and sustainable urban services in the city. To accomplish this, smart cities necessitate collaboration among the public as well as private sectors to install IT platforms to collect and examine massive quantities of data. At the same time, it is essential to design effective artificial intelligence (AI) based tools to handle healthcare crisis situations in smart cities. To offer proficient services to people during healthcare crisis time, the authorities need to look closer towards them. Sentiment analysis (SA) in social networking can provide valuable information regarding public opinion towards government actions. With this motivation, this paper presents a new AI based SA tool for healthcare crisis management (AISA-HCM) in smart cities. The AISA-HCM technique aims to determine the emotions of the people during the healthcare crisis time, such as COVID-19. The proposed AISA-HCM technique involves distinct operations such as pre-processing, feature extraction, and classification. Besides, brain storm optimization (BSO) with deep belief network (DBN), called BSO-DBN model is employed for feature extraction. Moreover, beetle antenna search with extreme learning machine (BAS-ELM) method was utilized for classifying the sentiments as to various classes. The use of BSO and BAS algorithms helps to effectively modify the parameters involved in the DBN and ELM models respectively. The performance validation of the AISA-HCM technique takes place using Twitter data and the outcomes are examined with respect to various measures. The experimental outcomes highlighted the enhanced performance of the AISA-HCM technique over the recent state of art SA approaches with the maximum precision of 0.89, recall of 0.88, F-measure of 0.89, and accuracy of 0.94.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Smart city</kwd>
<kwd>sentiment analysis</kwd>
<kwd>artificial intelligence</kwd>
<kwd>healthcare management</kwd>
<kwd>metaheuristics</kwd>
<kwd>deep learning</kwd>
<kwd>parameter tuning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>In recent times, Smart Cities is dynamically giving support for quick response in healthcare crisis management. The Integrated Command and Control Centers (ICCC) system under the mission in several Smart Cities comprising Pune, Bangalore, Vadodara, and Agra have been converted to war rooms for effective management and real-world monitoring of the epidemic using technologies [<xref ref-type="bibr" rid="ref-1">1</xref>]. This mission gathered optimal practices through Smart Cities in struggling healthcare crises, like COVID-19. Such practices are collecting data, active management, rapid communication of COVID diseased people and areas, and take preventive steps in evading spread of the disease [<xref ref-type="bibr" rid="ref-2">2</xref>]. This has been shared and documented with every Smart Municipal Commissioner and City CEO and could be repeated in other cities. Smart city projects have gathered data on shelter and food provision with contact details and locations of shelter homes, kitchens and food distribution that newly started/exist through the Smart Cities. This data has been shared through the city stakeholders and is available through Google maps. COVID Response in Smart Cities could be categorized into 4 parts, i.e., Communication, Information, Preparedness, and Management.</p>
<p>The epidemic of COVID-19 has caused an extraordinary loss of human lives worldwide and presented a sensational problem to food systems, work universe, and global health [<xref ref-type="bibr" rid="ref-3">3</xref>]. The social disturbance and monetary is demolished by this epidemic. A lot of people are at risk of undernourishment, and it can be increased up to 132 million by the end of 2020 [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. The dynamics of COVID-19, comprising contagion factors, mortality, initial deaths, and time of country virus, have been introduced by the responsive variances among financial markets and social media results in serious disease spread [<xref ref-type="bibr" rid="ref-6">6</xref>]. The world that we know till now has been transformed and now we are living in a novel scenario in endless change progress, where how we speak, live, and relate with other people is changed forever. In this certain situation, disease threat is supposing a great work while diverting, educating, and sending the progression of data in the public domain [<xref ref-type="bibr" rid="ref-7">7</xref>]. The current disaster is because COVID19 is generating a socially innovative scenario which is sensational for healthcare communities [<xref ref-type="bibr" rid="ref-8">8</xref>]. They live in an exceedingly globalized world, in which free travel among nations, relocation adaptability, utilization of Information and Communication Technologies (ICTs), and the turn of events are significantly evolved. They must feature the emerging connections among the world economies that are reflected in the individual knowledge and financial progress [<xref ref-type="bibr" rid="ref-9">9</xref>]. Also, due to this disease outbreak, large number of criticism on movements and fake news constantly appears on social media sites.</p>
<p>The first lockdown in India started on March 22, 2020, and was extended from April 15 to May 3, making it the longest lockdown in the country. As of April 22, India has reported 18,985 confirmed cases and 603 deaths from COVID-19 in its 31 states and associated domains since its first reported case on January 30. India rushed to close its borders and upheld a quick lockdown, which the World Health Organization lauded as &#x201C;extreme and convenient.&#x201D; The lockdown has likewise given the public authority time to plan for a potential worsening of situations when the pandemic is estimated to peak in the coming weeks. India&#x0027;s population has reached 1.3 billion, and well-being imbalances, extending monetary and social inconsistencies, and social hygiene issues present novel challenges. Readiness and response to COVID-19 have contrasted at the state level. Kerala has drawn on its involvement in the Nipah virus infection in 2018 to utilize comprehensive testing, contact tracing, and network preparation to contain the infection and maintain a low death rate. It has likewise set up a vast number of small safe houses for transient specialists. Odisha&#x0027;s introduction to past cataclysmic events implied that emergency safety measures were at that point set up and have been repurposed. Maharashtra has utilized robots for cleaning during the lockdown and applied a group of control methodologies: if at least three patients are analyzed, then all houses inside the 3&#x2005;km radius are examined to detect other cases, trace contacts, and determining possible cases. However, whether this procedure is useful is still unclear at present. The reason depends on the presence of network transmission, and there is a risk of slander and compulsion. Nevertheless, states merit a large part of the credit for India&#x0027;s COVID-19 response. As India is the second most highly populated country after China, it is necessary to examine the spread and impacts of COVID-19 (&#x201C;India Likely to Surpass China as World&#x0027;s Most Populous Country in the Next 8 Years: U.N.,&#x201D; 2019). Microblog writing, particularly Twitter, has been considered to help express individuals&#x2019; emotions in India. However, a few occurrences of disgust, sadness, and anger were reported in Indians during the main lockdown.</p>
<p>In recent times, particularly in the latter half of May, when this worldwide outbreak has continually affected the lives of millions of people in many nations, and they have no other solution however to resort to overall lockdowns [<xref ref-type="bibr" rid="ref-10">10</xref>]. Such tweets create an easy way for the user to exchange and share their ideas, opinions, and points of view regarding a provided topic. Alternatively, sentiment analysis (SA) is the process of classifying and recognizing a certain text polarity regarding phrase, document, and sentence [<xref ref-type="bibr" rid="ref-11">11</xref>]. A lot of people have utilized social networks like Twitter for expressing their attitudes and opinions toward COVID19 and share their proficiencies in confronting this disease [<xref ref-type="bibr" rid="ref-12">12</xref>]. Thus, the significance of Twitter has improved ever more, and SA for Twitter data becomes hot research in data science research. Consequently, Twitter has to turn into a rich amount of data or information regarding people&#x0027;s opinions on COVID19 that has managed few investigators for using this data to carry out their research experiments and studies regarding COVID19. Few scientists have employed SA to study people&#x0027;s opinions regarding COVID19.</p>
<p>Gulati et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] presented relative analyses of common ML based classifications. They have created investigations with the tweet datasets interrelated to the COVID19 pandemic. They have utilized 7 ML based classifications. Such classifications are employed to over 72,000 tweets interrelated to COVID19. They have executed research utilizing 3 manners i.e., Trigram, Unigram, and Bigram. According to the outcomes, Perceptron, Linear SVC, LR, and Passive Aggressive Classifier can attain the highest accuracy score in classification (trigram, unigram, bigram) and are closer to one another regarding their efficiency. Satu et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] intended for designing a smart clustering based classification and topic removing module called TClustVID that analyses COVID19 interrelated public tweets for extracting substantial sentiments with higher accuracy.</p>
<p>Garcia et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] presented a topic detection and SA for exploring a huge amount of tweets in both nations with a huge amount of mortalities and spreading by COVID-19, USA, and Brazil. In Shah et al. [<xref ref-type="bibr" rid="ref-16">16</xref>], text data have been gathered, comprising 55,612 PORs of 3430 physicians from 3 standard PRWs in the US (Vitals, RateMDs, and HealthGrades) from 01-03-2020 to 27-06-2020. An enhanced LDA based TCLDA, SA, and manual annotation tools have been employed for extracting an appropriate amount of topics, create respective keywords, allocate topic name, and define trend in the extracted topics and certain sentiments.</p>
<p>This paper presents a new AI based SA tool for healthcare crisis management (AISA-HCM) in smart cities. The AISA-HCM technique aims to determine the emotions of the people during the healthcare crisis time, such as COVID-19. Besides, brain storm optimization (BSO) with deep belief network (DBN), called BSO-DBN model is employed for feature extraction. Moreover, beetle antenna search with extreme learning machine (BAS-ELM) technique was utilized for classifying the sentiments as to many classes. The use of BSO and BAS algorithms helps to effectively modify the parameters involved in the DBN and ELM models respectively. The performance validation of the AISA-HCM technique takes place using Twitter data and the outcomes are examined with respect to different measures.</p>
<p>In short, the paper contributions can be listed as follows.
<list list-type="bullet">
<list-item><p> Designs a new AI based SA tool for healthcare crisis management (AISA-HCM) in smart cities.</p></list-item>
<list-item><p> Employs preprocessing in different levels such as noise removal, stemming, normalization, and tokenization.</p></list-item>
<list-item><p> Aims to determine the emotions of the people during the healthcare crisis time, such as COVID-19.</p></list-item>
<list-item><p> Proposes BSO-DBN model by the hyperparameter tuning of DBN model using BSO algorithm for feature extraction.</p></list-item>
<list-item><p> Employs a BAS-ELM based classifier model to allocate the proper class labels of the people sentiments.</p></list-item>
<list-item><p> Validate the performance of the proposed model on benchmark dataset and examine the results interms of different performance measures.</p></list-item>
</list></p>
<p>The rest of the paper is organized as follows.</p>
<p>This paper is structured as follows: Section 1 describes the introduction of the sentiment analysis and followed by the literature review. Next, the materials and method of our approach focus on finding the sentiments are given in Section 2. The results and discussion present the data used, and the obtained results is given in Section 3 and concluded in Section 4.</p>
</sec>
<sec id="s2"><label>2</label><title>The Proposed Healthcare Crisis Management Model</title>
<p>In this study, a new AISA-HCM technique is designed to analyse people sentiments using Twitter data in the aspect of healthcare management. The working principle of the AISA-HCM technique is clearly demonstrated in <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The proposed AISA-HCM technique involves distinct operations such as pre-processing, BSO-DBN based feature extraction, and BAS-ELM based classification. The detailed working of every module is offered in the succeeding sections.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Overall process of proposed method</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21502-fig-1.png"/></fig>
<sec id="s2_1"><label>2.1</label><title>Data Pre-Processing</title>
<p>Data pre-processing is vital in some social networks based analyses scheme (for instance, SA of issuing Twitter data) as it immediately affects the efficacy of SA because of data&#x0027;s difficulty. Based on this work, but Twitter is regarded as gold mine of data, it can be considered as noisiest data as it has several links like hashtags, special symbols, emoji, etc. Hence, the gathered Twitter data is pre-processed utilizing the following steps: noise elimination, tokenization, normalization, and stem that are explained as follows:</p>
<p><italic>Noise Removal</italic></p>
<p>In this stage, the inadequate data is eliminated in the following phases:</p>
<p><italic>Lower Case</italic></p>
<p>The lowercase is one of the effectual methods of text pre-processing that assurances correlation within the features set and sparsity problem. For instance, CovId and CovID should be transformed to COVID-19.</p>
<p><italic>Remove URL</italic></p>
<p>During this stage, it can be eliminated unrelated connects embedding as to Twitter posts.</p>
<p><italic>Remove Special Symbols</italic></p>
<p>During this phase, it can be eliminated special symbol as punctuation.</p>
<p><italic>Remove Hashtag</italic></p>
<p>The Twitter hashtag is utilized for index keywords or topics on Twitter, expressed as &#x0023;symbol. During this case, the important hashtags &#x0023;COVID-19 and &#x0023;Coronavirus are eliminated.</p>
<p><italic>Remove Stop Word</italic></p>
<p>The stop words are irrelevant words in language and inadequate in SA that are utilized to language grammar framework. It can be filtered out these stop words are containing article, conjunction, preposition, any pronoun, and common word like the, a, an, about, by, from, to, etc.</p>
<p><italic>Tokenization</italic></p>
<p>It is used for breaking extended strings of text as tokens (for instance, smaller pieces). These tokens are paragraphs which is more split as to shorter sentences that are, in turn, separated as to words. For instance, regarded as this sentence before tokenization: &#x201C;hard work pays off.&#x201D;</p>
<p><italic>Normalization</italic></p>
<p>It is used for changing a text as to typical procedure for increasing the uniformity of text pre-processing. It contains the change of every text it also upper/lower cases.</p>
<p><italic>Stemming</italic></p>
<p>Afterward the tokenization phase, the next phase is stemming. The stemming step was altering the word as to its original procedure (for instance, the root process for decreasing the amount of word kinds/classes in data). For sample, the expressed &#x201C;Walking,&#x201D; &#x201C;Walked,&#x201D; and &#x201C;Walker&#x201D; are decreased to words &#x201C;walk&#x201D;.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Feature Extraction: BSO-DBN Model</title>
<p>Once the input tweets are preprocessed, they are fed into the BSO-DBN model for feature extraction purposes. DBN comes under the family of DNN with massive hidden layers and any number of hidden units in all layers. In classic DBN is similar to RBM technique that is comprised of resultant layer. Also, the DBN executes robust, greedy unsupervised learning techniques to trained RMB and supervised fine-tuned approach for changing the model by labeled data. The RBM is comprised of visible layers <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:math></inline-formula> and hidden layers <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mtext>h</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> attached as undirected weight. In order to stack RBM in DBN, hidden layers of RBM is considered as visible layers of approaching RBM. The parameter set of RMB as <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>w</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>b</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the weight amongst <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mtext>j</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are determined as bias of layers [<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
<p>The RBM explains equivalent energy as exhibited under:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>i</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>i</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>and the joint probability distribution of <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:mtext>h</mml:mtext></mml:mrow></mml:math></inline-formula> is defined as:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>
</p>
<p>But marginal probability distributions of <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:math></inline-formula> is demonstrated as:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>h</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:math></disp-formula>
</p>
<p>In order to gain optimum <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> value to single data vectors <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:math></inline-formula>, gradient of <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow></mml:math></inline-formula>-likelihood estimate is computed on the basis of implemented expression,
<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> stands for the expectations by distribution of particular subscripts. Because of the absence of connections amongst units in same layer, <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> implies the simply achieved as measuring the conditional probability distributions and signifies as:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="ueqn-3">
<mml:math id="mml-ueqn-3" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>j</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</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:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:math></disp-formula>
</p>
<p>The activation purpose is denoted as sigmoid functions [<xref ref-type="bibr" rid="ref-18">18</xref>]. In the event <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, Contrastive Divergence (CD) learning technique was utilized as redevelopment for reducing the differences of 2 Kullback-Leibler divergences (KL). Primarily, CD learning is effectual in real-time applications and restricts the processing cost if related to Gibbs sampling manner. So, the weight in DBN layers makes sure training with use of unlabeled data by fast and greedy unsupervised approach. In the event forecast, the supervised layer is contained in DBN for changing the learned feature by utilizing labeled data in the application of up-down fine-tuning technique. At this point, the FC layer performs as top layer, and sigmoid activation functions are utilized.</p>
<p>In order to fine tune the hyperparameters involved in the DBN model, the BSO algorithm is utilized. The BSO method is inspired by the concept of brainstorming, and it is a broadly utilized tool for growing creativeness in the organization that has attained wider acceptance as a means of assisting creativeness [<xref ref-type="bibr" rid="ref-19">19</xref>]. In the process of BSO, initially, <italic>N</italic> concepts are arbitrarily initiated within the solution space, and later every concept is calculated based on its fitness function. Then <italic>m</italic> point of cluster center is arbitrarily chosen and initiated as <italic>N</italic> concepts, whereas <italic>m</italic> denotes lesser compared to <italic>N</italic>. As the remaining procedure in BSO could be defined below.</p>
<p>Clustering Individuals is a procedure of sorting equivalent objects together, and, in all generations, each idea is re clustered to <italic>m</italic> clusters based on the concept (or individual) features. <italic>K</italic> means is one of the common methods utilized in clustering; here it is utilized in clustering process. The cluster center disrupting process arbitrarily selects a cluster center and substitutes by a recently created concept with a likelihood of <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>p</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula> that is also called a replacing function. The value of <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>p</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula> is used for controlling the likelihood of replacing a cluster center with an arbitrarily produced solution.</p>
<p>For maintaining the population diversity, a novel concept (individual) could be produced on the basis of one idea or 2 in 1 cluster or 2, correspondingly. Later, based on the selecting of 1 cluster or 2, the concept of cluster center or an arbitrary concept is chosen by a likelihood of <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>p</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:math></inline-formula>one_center and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>p</mml:mi></mml:math></inline-formula>_two_center. The choosing function is determined by
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</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 stretchy="false">)</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>t</mml:mi><mml:mi>w</mml:mi><mml:mi>o</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
</p>
<p>Whereas rand denotes an arbitrary value among zero and one. Afterward selecting one idea or two, the chosen idea(s) is upgraded based on
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">w</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BE;</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>
</p>
<p>Whereas <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:math></inline-formula> denotes the Gaussian random value using mean zero and variance one and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>&#x03BE;</mml:mi></mml:math></inline-formula> represents an altering factor slower the convergence speed down as the progress goes, that is given by
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>&#x03BE;</mml:mi><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0.5</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
</p>
<p>Whereas rand denotes an arbitrary value among zero and one. The current iteration and <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:math></inline-formula>iteration refers the maximal amount of iterations and present amount of iterations, correspondingly. <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi></mml:math></inline-formula> indicates the logarithmic sigmoid transfer functions, and this method is useful to global search capability at the start of development and improves local search capability once the procedure is approaching the end. <italic>k</italic> denotes a predetermined variable for changing the slope of logsig functions. The novel generated idea is calculated, and when the fitness value is greater compared to the present idea, the older idea would be substituted with the novel one. <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref> demonstrates the flowchart of BSO.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Flowchart of bso</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21502-fig-2.png"/></fig>
</sec>
<sec id="s2_3"><label>2.3</label><title>Data Classification: BAS-ELM Model</title>
<p>During the data classification process, the BAS-ELM model receives the feature vectors as input and determines the appropriate class labels of sentiments. At this point, ELM is established by G. B. Huang that is included with 3 important layers. Assume that size of trained data is <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>d</mml:mi></mml:math></inline-formula>, where <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>N</mml:mi><mml:mspace width="thickmathspace" /></mml:math></inline-formula>represents the amount of instances, and <italic>d</italic> refer the dimensional of features. Supposing <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mn>2</mml:mn><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:msup><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msubsup><mml:mi>y</mml:mi><mml:mn>1</mml:mn><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow><mml:msubsup><mml:mi>y</mml:mi><mml:mn>2</mml:mn><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> signify the <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> instance and target, where <italic>m</italic> stands for the size of target vectors. Thus the outcome, the result of <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> node from hidden layer is given in the following:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> refers the activation functions from hidden layer, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msubsup><mml:mi>W</mml:mi><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> implies <italic>d</italic> dimension input weight vector representing <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> hidden node, but <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> defines the hidden bias derives in <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> hidden node. The input weight and bias are stated arbitrarily. The <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> node of the resultant layer is determined as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:msup><mml:mi>y</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">L</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msubsup><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:msup><mml:mo stretchy="false">]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> indicates the output weight vector which connects the <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>output-node <italic>L</italic> represents the amount of hidden nodes [<xref ref-type="bibr" rid="ref-20">20</xref>]. So, the above functions are remodeled as to matrix as provided:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mi>&#x03B2;</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mi>T</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mi>T</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mi>T</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mi>T</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03B2;</mml:mi><mml:mi>L</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msup><mml:mi>y</mml:mi><mml:mn>1</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msup><mml:mi>y</mml:mi><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></p>
<p>Therefore, the resultant weight <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> is evaluated mathematical by
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>H</mml:mi><mml:mo>&#x2020;</mml:mo></mml:msup><mml:mi>Y</mml:mi></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mo>&#x2020;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> implies the Moore-Penrose (MP) opposite of hidden layer matrix <italic>H</italic>. Therefore, it can be modeled when matrix <italic>H</italic> is non-singular as
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>Y</mml:mi></mml:math></disp-formula>
</p>
<p>The adding of training ELM network uses for computing the output weight <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> with application of analytical manner. The meta-heuristic optimization technique is dependent upon the search performance of long-horned beetles. Likewise genetic algorithms (GA), particle swarm techniques, etc, Beetle Antennae Search (BAS) technique is automatically recognizing the optimized procedure without significant the particular procedure of the function and gradient data. An important benefit of BAS is the minimum difficulty contained in their design and in their capability for solving the optimized issue in minimum time as their distinct number is only one. But utilized this technique for optimization, the group of 2 models are comprised such as demonstrating the search nature and formulate the detection nature.</p>
<p>Usually, the actual ELM approach doesn&#x0027;t need training hidden layer bias and input weight. But, the ELM is able of decreasing the processing time, it restricts the consistency and working function. The location communication to different particles develops robust, and MBAS has adjustable to complex optimizing problems. It can be recognized with new kinds of ELM like MBAS-ELM. An important objective of MBAS-ELM is to elect important FF for processing the implemented process. For developing the stable networks, four approaches like <italic>RMSE,</italic> <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are taken as to account for achieving optimum outcomes. The RMSE and coefficient of resolve <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are the standard conditions implemented to the regression procedure. The RMSE is utilized for computing the distance amongst inspected value and ground-truth. When the RMSE value is lesser, afterward the efficiency develops much optimum. Therefore, the RMSE is determined as provided.
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:msqrt></mml:math></disp-formula>where <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> implies the <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> forecast of ELM, <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> signifies <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> ground-truth and <italic>N</italic> define the whole forecast. <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> indicates the utilized to calculates the appropriate degree to studied value and ground-truth. The neighboring <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> is 1, and the appropriate degree develops further unique.
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>&#x03A3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03A3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> forecast, <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mspace width="thickmathspace" /></mml:math></inline-formula>ground-truth and <inline-formula id="ieqn-1000"><mml:math id="mml-ieqn-1000"><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mspace width="thickmathspace" /></mml:math></inline-formula>i refer the mean for all ground truths.</p>
<p>Also, the norm of output weights <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and criteria values <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are important methods for ELM regression. The normalizing potential is connected with norm of last weight <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mtext>||</mml:mtext></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. When the norm value is minimum, an optimum generalization is gained. It utilizes the form value <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> for calculating the reliability of ELM. So, the global optimum solutions of form rate is one. The matrix with higher form number signifies which it can be ineffectual. Afterward, it can be determined as:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:msqrt></mml:math></disp-formula>where <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are maximal and minimal eigenvalue of matrix <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula>respectively. The FF <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>\;&#xA0;</mml:mtext></mml:mrow></mml:math></inline-formula>has involved of 4 approaches as given in the formula setup,
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> determines the scaling factors.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Performance Validation</title>
<p>The presented technique is simulated utilizing Twitter dataset. The performance of the presented techniques has been investigated under different aspects.</p>
<p><?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref> demonstrates the set of confusion matrices produced by the proposed model under distinct runs. On the execution of run-1, the proposed model has classified a set of 110 instances into fear, 95 instances into sad, 102 instances into anger, and 98 instances into joy. Likewise, on the execution of run-2, the presented technique has classified a set of 110 instances into fear, 91 instances into sad, 95 instances into anger, and 94 instances into joy. Similarity, on the execution of run-3, the projected manner has classified a set of 110 instances into fear, 93 instances into sad, 111 instances into anger, and 93 instances into joy. Eventually, on the execution of run-4, the proposed methodology has classified a set of 113 instances into fear, 115 instances into sad, 100 instances into anger, and 107 instances into joy. Meanwhile, on the execution of run-5, the presented method has classified a set of 116 instances into fear, 115 instances into sad, 101 instances into anger, and 101 instances into joy.</p>
<p><?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref> examines the classification results analysis of the AISA-HCM with existing techniques under diverse runs. From the table values, it can be evident that the proposed AISA-HCM manner has accomplished maximal classification performance under diverse runs.</p>
<p>On the execution run 1, the AISA-HCM technique has classified the instances into fear class with the prec. of 0.803, rec. of 0.859, and F1-score of 0.830. Besides, the AISA-HCM technique has classified the instances into sad class with the prec. of 0.856, rec. of 0.826, and F1-score of 0.841. Likewise, the AISA-HCM technique has classified the instances into anger class with the prec. of 0.843, rec. of 0.887, and F1-score of 0.864. At last, the AISA-HCM technique has classified the instances into joy class with the prec. of 1.000, rec. of 0.899, and F1-score of 0.947. Next to that, on the execution run 2, the AISA-HCM technique has classified the instances into fear class with the prec. of 0.733, rec. of 0.859, and F1-score of 0.791. In addition, the AISA-HCM technique has classified the instances into sad class with the prec. of 0.820, rec. of 0.791, and F1-score of 0.805. Also, the AISA-HCM technique has classified the instances into anger class with the prec. of 0.941, rec. of 0.826, and F1-score of 0.880. Finally, the AISA-HCM technique has classified the instances into joy class with the prec. of 0.895, rec. of 0.862, and F1-score of 0.879.</p>
<p>Simultaneously, on the execution run 3, the AISA-HCM technique has classified the instances into fear class with the prec. of 0.880, rec. of 0.859, and F1-score of 0.870. Additionally, the AISA-HCM technique has classified the instances into sad class with the prec. of 0.782, rec. of 0.809, and F1-score of 0.795. Furthermore, the AISA-HCM technique has classified the instances into anger class with the prec. of 0.925, rec. of 0.965, and F1-score of 0.945. At last, the AISA-HCM technique has classified the instances into joy class with the prec. of 0.903, rec. of 0.853, and F1-score of 0.877. On the execution run 4, the AISA-HCM technique has classified the instances into fear class with the prec. of 0.983, rec. of 0.883, and F1-score of 0.930. Besides, the AISA-HCM technique has classified the instances into sad class with the prec. of 0.810, rec. of 1.000, and F1-score of 0.895. Likewise, the AISA-HCM technique has classified the instances into anger class with the prec. of 0.971, rec. of 0.870, and F1-score of 0.917. At last, the AISA-HCM technique has classified the instances into joy class with the prec. of 1.000, rec. of 0.982, and F1-score of 0.991. At last, on the execution run 5, the AISA-HCM technique has classified the instances into fear class with the prec. of 1.000, rec. of 0.906, and F1-score of 0.951. Besides, the AISA-HCM technique has classified the instances into sad class with the prec. of 0.827, rec. of 1.000, and F1-score of 0.906. Likewise, the AISA-HCM technique has classified the instances into anger class with the prec. of 0.910, rec. of 0.878, and F1-score of 0.894. At last, the AISA-HCM technique has classified the instances into joy class with the prec. of 1.000, rec. of 0.928, and F1-score of 0.928.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Confusion matrix analysis of AISA-HCM model</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21502-fig-3.png"/></fig>
<p><?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref> and <?A3B2 "tbl2",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref> investigate the average classification results analysis of the AISA-HCM technique under various runs. The figure depicted that the AISA-HCM technique has gained effectual outcomes under all the runs. For instance, under run-1, the AISA-HCM technique has resulted in a maximum average acc. of 0.934, prec. of 0.875, rec. of 0.868, and F-measure of 0.871. Next to that, under run-2, the AISA-HCM approach has resulted in a maximal average acc. of 0.918, prec. of 0.847, rec. of 0.835, and F-measure of 0.839. In line with, under run-3, the AISA-HCM manner has resulted in a higher average acc. of 0.936, prec. of 0.872, rec. of 0.872, and F-measure of 0.872. Simultaneously, under run-4, the AISA-HCM method has resulted in increased average acc. of 0.966, prec. of 0.941, rec. of 0.934, and F-measure of 0.933. Concurrently, under run-5, the AISA-HCM methodology has resulted in improved average acc. of 0.964, prec. of 0.934, rec. of 0.928, and F-measure of 0.964.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Classification results analysis of AISA-HCM model under distinct runs</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">No. of runs</th>
<th align="left">Accuracy</th>
<th align="left">No. of class</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F-score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="5">Run-1</td>
<td align="left" rowspan="5">0.934</td>
<td align="left">Fear</td>
<td align="left">0.803</td>
<td align="left">0.859</td>
<td align="left">0.830</td>
</tr>
<tr>
<td align="left">Sad</td>
<td align="left">0.856</td>
<td align="left">0.826</td>
<td align="left">0.841</td>
</tr>
<tr>
<td align="left">Anger</td>
<td align="left">0.843</td>
<td align="left">0.887</td>
<td align="left">0.864</td>
</tr>
<tr>
<td align="left">Joy</td>
<td align="left">1.000</td>
<td align="left">0.899</td>
<td align="left">0.947</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">0.875</td>
<td align="left">0.868</td>
<td align="left">0.871</td>
</tr>
<tr>
<td align="left" rowspan="5">Run-2</td>
<td align="left" rowspan="5">0.918</td>
<td align="left">Fear</td>
<td align="left">0.733</td>
<td align="left">0.859</td>
<td align="left">0.791</td>
</tr>
<tr>
<td align="left">Sad</td>
<td align="left">0.820</td>
<td align="left">0.791</td>
<td align="left">0.805</td>
</tr>
<tr>
<td align="left">Anger</td>
<td align="left">0.941</td>
<td align="left">0.826</td>
<td align="left">0.880</td>
</tr>
<tr>
<td align="left">Joy</td>
<td align="left">0.895</td>
<td align="left">0.862</td>
<td align="left">0.879</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">0.847</td>
<td align="left">0.835</td>
<td align="left">0.839</td>
</tr>
<tr>
<td align="left" rowspan="5">Run-3</td>
<td align="left" rowspan="5">0.936</td>
<td align="left">Fear</td>
<td align="left">0.880</td>
<td align="left">0.859</td>
<td align="left">0.870</td>
</tr>
<tr>
<td align="left">Sad</td>
<td align="left">0.782</td>
<td align="left">0.809</td>
<td align="left">0.795</td>
</tr>
<tr>
<td align="left">Anger</td>
<td align="left">0.925</td>
<td align="left">0.965</td>
<td align="left">0.945</td>
</tr>
<tr>
<td align="left">Joy</td>
<td align="left">0.903</td>
<td align="left">0.853</td>
<td align="left">0.877</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">0.872</td>
<td align="left">0.872</td>
<td align="left">0.872</td>
</tr>
<tr>
<td align="left" rowspan="5">Run-4</td>
<td align="left" rowspan="5">0.966</td>
<td align="left">Fear</td>
<td align="left">0.983</td>
<td align="left">0.883</td>
<td align="left">0.930</td>
</tr>
<tr>
<td align="left">Sad</td>
<td align="left">0.810</td>
<td align="left">1.000</td>
<td align="left">0.895</td>
</tr>
<tr>
<td align="left">Anger</td>
<td align="left">0.971</td>
<td align="left">0.870</td>
<td align="left">0.917</td>
</tr>
<tr>
<td align="left">Joy</td>
<td align="left">1.000</td>
<td align="left">0.982</td>
<td align="left">0.991</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">0.941</td>
<td align="left">0.934</td>
<td align="left">0.933</td>
</tr>
<tr>
<td align="left" rowspan="5">Run-5</td>
<td align="left" rowspan="5">0.964</td>
<td align="left">Fear</td>
<td align="left">1.000</td>
<td align="left">0.906</td>
<td align="left">0.951</td>
</tr>
<tr>
<td align="left">Sad</td>
<td align="left">0.827</td>
<td align="left">1.000</td>
<td align="left">0.906</td>
</tr>
<tr>
<td align="left">Anger</td>
<td align="left">0.910</td>
<td align="left">0.878</td>
<td align="left">0.894</td>
</tr>
<tr>
<td align="left">Joy</td>
<td align="left">1.000</td>
<td align="left">0.927</td>
<td align="left">0.962</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">0.934</td>
<td align="left">0.928</td>
<td align="left">0.928</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In order to ensure the improved classification results analysis of the AISA-HCM technique, a detailed comparison study is made in <?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-3">Tab. 3</xref>. From the obtained values, it is evident that the DT technique has attained lower performance with the prec. of 0.84, rec. of 0.83, F-measure of 0.83, and acc. of 0.83. Followed by, the XGBoost and SVC techniques have accomplished slightly improved and identical outcomes with the prec. of 0.85, rec. of 0.85, F-measure of 0.85, and acc. of 0.85. Likewise, the RF approach has showcased moderate outcomes with the prec. of 0.88, rec. of 0.85, F-measure of 0.86, and acc. of 0.86. Next to that, the Extra TC technique has reported competitive performance with the prec. of 0.89, rec. of 0.88, F-measure of 0.88, and acc. of 0.88. However, the proposed AISA-HCM technique has surpassed all the other techniques with the maximum prec. of 0.89, rec. of 0.88, F-measure of 0.89, and acc. of 0.94.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Result analysis of AISA-HCM model</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21502-fig-4.png"/></fig>
	<table-wrap id="table-2"><label>Table 2</label><caption><title>Average results analysis of AISA-HCM technique</title></caption>
		
			
				<table frame="hsides">
					<colgroup>
						<col align="left"/>
							<col align="left"/>
								<col align="left"/>
									<col align="left"/>
										<col align="left"/>
										</colgroup>
										<thead>
											<tr>
												<th align="left">No. of runs</th>
												<th align="left">Precision</th>
												<th align="left">Recall</th>
												<th align="left">F1-score</th>
												<th align="left">Accuracy</th>
											</tr>
										</thead>
										<tbody>
											<tr>
												<td align="left">Run-1</td>
												<td align="left">0.875</td>
												<td align="left">0.868</td>
												<td align="left">0.871</td>
												<td align="left">0.934</td>
											</tr>
											<tr>
												<td align="left">Run-2</td>
												<td align="left">0.847</td>
												<td align="left">0.835</td>
												<td align="left">0.839</td>
												<td align="left">0.918</td>
											</tr>
											<tr>
												<td align="left">Run-3</td>
												<td align="left">0.872</td>
												<td align="left">0.872</td>
												<td align="left">0.872</td>
												<td align="left">0.936</td>
											</tr>
											<tr>
												<td align="left">Run-4</td>
												<td align="left">0.941</td>
												<td align="left">0.934</td>
												<td align="left">0.933</td>
												<td align="left">0.966</td>
											</tr>
											<tr>
												<td align="left">Run-5</td>
												<td align="left">0.934</td>
												<td align="left">0.928</td>
												<td align="left">0.928</td>
												<td align="left">0.964</td>
											</tr>
											<tr>
												<td align="left">Average</td>
												<td align="left">0.894</td>
												<td align="left">0.887</td>
												<td align="left">0.889</td>
												<td align="left">0.944</td>
											</tr>
										</tbody>
									</table>
								
							</table-wrap>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Comparison study of AISA-HCM technique with other techniques</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Methods</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
<th align="left">Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Rand. forest</td>
<td align="left">0.88</td>
<td align="left">0.85</td>
<td align="left">0.86</td>
<td align="left">0.86</td>
</tr>
<tr>
<td align="left">XGBoost</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
</tr>
<tr>
<td align="left">SVC</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
</tr>
<tr>
<td align="left">Extra TC</td>
<td align="left">0.89</td>
<td align="left">0.88</td>
<td align="left">0.88</td>
<td align="left">0.88</td>
</tr>
<tr>
<td align="left">Decision tree</td>
<td align="left">0.84</td>
<td align="left">0.83</td>
<td align="left">0.83</td>
<td align="left">0.83</td>
</tr>
<tr>
<td align="left">AISA-HCM</td>
<td align="left">0.89</td>
<td align="left">0.88</td>
<td align="left">0.89</td>
<td align="left">0.94</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4"><label>4</label><title>Conclusion</title>
<p>This paper has developed a new AISA-HCM technique to determine the emotions of the people during the healthcare crisis time, such as COVID-19. The proposed AISA-HCM technique involves distinct operations such as pre-processing, BSO-DBN based feature extraction, and BAS-ELM based classification. Primarily, the Twitter data is pre-processed utilizing the following steps: noise elimination, tokenization, normalization, and stemming. When the input tweets are preprocessed, they are fed into the BSO-DBN model for feature extraction purposes. During the data classification process, the BAS-ELM model receives the feature vectors as input and determines the appropriate class labels of sentiments. The utilization of BSO and BAS algorithms helps to commendably modify the parameters involved in the DBN and ELM models respectively. The performance validation of the AISA-HCM technique takes place using Twitter data and the outcomes are examined with respect to different measures. The experimental outcomes highlighted the enhanced performance of AISA-HCM technique over the recent state of art SA approaches. In future, the presented model can be extended to the use of feature selection and outlier detection techniques.</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 1/147/42), Received by Fahd N. Al-Wesabi. <uri xlink:href="https://www.kku.edu.sa">www.kku.edu.sa</uri>. This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-Track Path of Research Funding Program.</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>N.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Jhunthra</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Garg</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mohan</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Prediction modelling of COVID using machine learning methods from B-cell dataset</article-title>,&#x201D; <source>Results in Physics</source>, vol. <volume>21</volume>, pp. <fpage>103813</fpage>, <year>2021</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>S. K.</given-names> <surname>Lakshmanaprabu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>R. S.</given-names> <surname>Sheeba</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Enas</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Arunkumar</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>An effect of big data technology with ant colony optimization based routing in vehicular ad hoc networks: Towards smart cities</article-title>,&#x201D; <source>Journal of Cleaner Production</source>, vol. <volume>217</volume>, pp. <fpage>584</fpage>&#x2013;<lpage>593</lpage>, <year>2019</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>S.</given-names> <surname>Chawla</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Chawla</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Goyal</surname></string-name></person-group>, &#x201C;<article-title>Corona virus - sars-cov-2: An insight to another way of natural disaster</article-title>,&#x201D; <source>EAI Endorsed Transactions on Pervasive Health and Technology</source>, vol. <volume>6</volume>, no. <issue>22</issue>, pp. <fpage>164823</fpage>, <year>2020</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>K.</given-names> <surname>Shankar</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Perumal</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Tiwari</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shorfuzzaman</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name></person-group>, &#x201C;<article-title>Deep learning and evolutionary intelligence with fusion-based feature extraction for detection of COVID-19 from chest X-ray images</article-title>,&#x201D; <source>Multimedia Systems</source>, pp. <fpage>102258</fpage>&#x2013;<lpage>102266</lpage>, <year> 2021</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>G.</given-names> <surname>Mertens</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Gerritsen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Duijndam</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Salemink</surname></string-name> and <string-name><given-names>I. M.</given-names> <surname>Engelhard</surname></string-name></person-group>, &#x201C;<article-title>Fear of the coronavirus (COVID-19): Predictors in an online study conducted in march 2020</article-title>,&#x201D; <source>Journal of Anxiety Disorders</source>, vol. <volume>74</volume>, pp. <fpage>102258</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Katariya</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mohan</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>An emotion care model using multimodal textual analysis on covid-19</article-title>,&#x201D; <source>Chaos, Solitons &#x0026; Fractals</source>, vol. <volume>144</volume>, pp. <fpage>110708</fpage>, <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>N.</given-names> <surname>Donthu</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Gustafsson</surname></string-name></person-group>, &#x201C;<article-title>Effects of COVID-19 on business and research</article-title>,&#x201D; <source>Journal of Business Research</source>, vol. <volume>117</volume>, pp. <fpage>284</fpage>&#x2013;<lpage>289</lpage>, <year>2020</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>P.</given-names> <surname>Staszkiewicz</surname></string-name>, <string-name><given-names>I. C.</given-names> <surname>Orsa</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Staszkiewicz</surname></string-name></person-group>, &#x201C;<article-title>Dynamics of the covid-19 contagion and mortality: Country factors, social media, and market response evidence from a global panel analysis</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>106009</fpage>&#x2013;<lpage>106022</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. A.</given-names> <surname>Pustokhin</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhina</surname></string-name>, <string-name><given-names>P. N.</given-names> <surname>Dinh</surname></string-name>, <string-name><given-names>S. V.</given-names> <surname>Phan</surname></string-name>, <string-name><given-names>G. N.</given-names> <surname>Nguyen</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>An effective deep residual network based class attention layer with bidirectional LSTM for diagnosis and classification of COVID-19</article-title>,&#x201D; <source>Journal of Applied Statistics</source>, vol. <volume>2020</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Shubham</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Madan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Chaudhary</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Understanding cartoon emotion using integrated deep neural network on large dataset</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>10</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>21</lpage>, <year>2021</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>K.</given-names> <surname>Shankar</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Perumal</surname></string-name></person-group>, &#x201C;<article-title>A novel hand-crafted with deep learning features based fusion model for COVID-19 diagnosis and classification using chest X-ray images</article-title>,&#x201D; <source>Complex and Intelligent Systems</source>, vol. <volume>7</volume>, no. <issue>3</issue>, pp. <fpage>1277</fpage>&#x2013;<lpage>1293</lpage>, <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. F. F.</given-names> <surname>da Silva</surname></string-name>, <string-name><given-names>L. F. S.</given-names> <surname>Coletta</surname></string-name>, <string-name><given-names>E. R.</given-names> <surname>Hruschka</surname></string-name> and <string-name><given-names>E. R.</given-names> <surname>Hruschka</surname></string-name></person-group>, &#x201C;<article-title>Using unsupervised information to improve semi-supervised tweet sentiment classification</article-title>,&#x201D; <source>Information Sciences</source>, vol. <volume>355&#x2013;356</volume>, pp. <fpage>348</fpage>&#x2013;<lpage>365</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Gulati</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>R. S. K.</given-names> <surname>Boddu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Sarvakar</surname></string-name>, <string-name><given-names>D. K.</given-names> <surname>Sharma</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Comparative analysis of machine learning-based classification models using sentiment classification of tweets related to COVID-19 pandemic</article-title>,&#x201D; <source>Materials Today: Proceedings</source>, vol. <volume>364</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>, <year>2021</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>M. S.</given-names> <surname>Satu</surname></string-name>, <string-name><given-names>M. I.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mahmud</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Uddin</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Summers</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>TClustVID: A novel machine learning classification model to investigate topics and sentiment in COVID-19 tweets</article-title>,&#x201D; <source>Knowledge-Based Systems</source>, vol. <volume>226</volume>, pp. <fpage>107126</fpage>, <year>2021</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>K.</given-names> <surname>Garcia</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Berton</surname></string-name></person-group>, &#x201C;<article-title>Topic detection and sentiment analysis in twitter content related to COVID-19 from Brazil and the USA</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>101</volume>, pp. <fpage>107057</fpage>, <year>2021</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>A. M.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Qayyum</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Naqvi</surname></string-name> and <string-name><given-names>S. J.</given-names> <surname>Shah</surname></string-name></person-group>, &#x201C;<article-title>Mining topic and sentiment dynamics in physician rating websites during the early wave of the COVID-19 pandemic: Machine learning approach</article-title>,&#x201D; <source>International Journal of Medical Informatics</source>, vol. <volume>149</volume>, pp. <fpage>104434</fpage>, <year>2021</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>J.</given-names> <surname>Yu</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Knowledge-based deep belief network for machining roughness prediction and knowledge discovery</article-title>,&#x201D; <source>Computers in Industry</source>, vol. <volume>121</volume>, pp. <fpage>103262</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Jia</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>Traffic flow prediction with rainfall impact using a deep learning method</article-title>,&#x201D; <source>Journal of Advanced Transportation</source>, vol. <volume>2017</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Hei</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Shi</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Rong</surname></string-name></person-group>, &#x201C;<article-title>An improved brain storm optimization with differential evolution strategy for applications of ANNs</article-title>,&#x201D; <source>Mathematical Problems in Engineering</source>, vol. <volume>2015</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Gu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>M. A. H.</given-names> <surname>Ardebili</surname></string-name></person-group>, &#x201C;<article-title>Prediction, monitoring, and interpretation of dam leakage flow via adaptative kernel extreme learning machine</article-title>,&#x201D; <source>Measurement</source>, vol. <volume>166</volume>, pp. <fpage>108161</fpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>