<?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">28878</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.028878</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Improved Metaheuristics with Machine Learning Enabled Medical Decision Support System</article-title>
<alt-title alt-title-type="left-running-head">Improved Metaheuristics with Machine Learning Enabled Medical Decision Support System</alt-title>
<alt-title alt-title-type="right-running-head">Improved Metaheuristics with Machine Learning Enabled Medical Decision Support System</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Althubiti</surname><given-names>Sara A.</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Escorcia-Gutierrez</surname><given-names>Jos&#x00E9;</given-names>
</name><xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="aff" rid="aff-3">3</xref><email>jose.escorcia23@gmail.com</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Gamarra</surname><given-names>Margarita</given-names>
</name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Soto-Diaz</surname><given-names>Roosvel</given-names>
</name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Mansour</surname><given-names>Romany F.</given-names>
</name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Alenezi</surname><given-names>Fayadh</given-names>
</name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, College of Computer and Information Sciences, Majmaah University</institution>, <addr-line>Al-Majmaah, 11952</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Research Center - CIENS, Escuela Naval de Suboficiales A.R.C. &#x201C;Barranquilla&#x201D;</institution>, <addr-line>Barranquilla</addr-line>, <country>Colombia</country></aff>
<aff id="aff-3"><label>3</label><institution>Electronics and Telecommunications Engineering Program, Universidad Aut&#x00F3;noma del Caribe</institution>, <addr-line>Barranquilla, 080001</addr-line>, <country>Colombia</country></aff>
<aff id="aff-4"><label>4</label><institution>Departament of Computational Science and Electronic, Universidad de la Costa, CUC</institution>, <addr-line>Barranquilla, 080001</addr-line>, <country>Colombia</country></aff>
<aff id="aff-5"><label>5</label><institution>Biomedical Engineering Program, Universidad Sim&#x00F3;n Bol&#x00ED;var</institution>, <addr-line>Barranquilla, 080001</addr-line>, <country>Colombia</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Mathematics, Faculty of Science, New Valley University</institution>, <addr-line>El-Kharga 72511</addr-line>, <country>Egypt</country></aff>
<aff id="aff-7"><label>7</label><institution>Department of Electrical Engineering, College of Engineering, Jouf University</institution>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Jos&#x00E9; Escorcia-Gutierrez. Email: <email>jose.escorcia23@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-14"><day>14</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>73</volume>
<issue>2</issue>
<fpage>2423</fpage>
<lpage>2439</lpage>
<history>
<date date-type="received">
<day>20</day>
<month>2</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>02</day>
<month>4</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Althubiti et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Althubiti 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_28878.pdf"></self-uri>
<abstract>
<p>Smart healthcare has become a hot research topic due to the contemporary developments of Internet of Things (IoT), sensor technologies, cloud computing, and others. Besides, the latest advances of Artificial Intelligence (AI) tools find helpful for decision-making in innovative healthcare to diagnose several diseases. Ovarian Cancer (OC) is a kind of cancer that affects women&#x2019;s ovaries, and it is tedious to identify OC at the primary stages with a high mortality rate. The OC data produced by the Internet of Medical Things (IoMT) devices can be utilized to differentiate OC. In this aspect, this paper introduces a new quantum black widow optimization with a machine learning-enabled decision support system (QBWO-MLDSS) for smart healthcare. The primary intention of the QBWO-MLDSS technique is to detect and categorize the OC rapidly and accurately. Besides, the QBWO-MLDSS model involves a Z-score normalization approach to pre-process the data. In addition, the QBWO-MLDSS technique derives a QBWO algorithm as a feature selection to derive optimum feature subsets. Moreover, symbiotic organisms search (SOS) with extreme learning machine (ELM) model is applied as a classifier for the detection and classification of ELM model, thereby improving the overall classification performance. The design of QBWO and SOS for OC detection and classification in the smart healthcare environment shows the study&#x2019;s novelty. The experimental result analysis of the QBWO-MLDSS model is conducted using a benchmark dataset, and the comparative results reported the enhanced outcomes of the QBWO-MLDSS model over the recent approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Ovarian cancer</kwd>
<kwd>decision support system</kwd>
<kwd>smart healthcare</kwd>
<kwd>IoMT</kwd>
<kwd>deep learning</kwd>
<kwd>feature selection</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>With the expansion of smart sensorial media, things, and cloud techniques, innovative healthcare is gaining considerable interest towards the government, academia, industry, and the health care communities [<xref ref-type="bibr" rid="ref-1">1</xref>]. In recent times, the Internet of Things (IoT) has brought the vision of a smart world into reality with numerous services and a considerable volume of information [<xref ref-type="bibr" rid="ref-2">2</xref>]. Cloud computing is well suited for enabling technologies in the scenarios since it presents a flexible stack of computing, software, and storage services at a lower cost [<xref ref-type="bibr" rid="ref-3">3</xref>]. Cloud-based service could offer a higher quality of experience to clinics, caregivers, and physicians anytime and anywhere continuously. However, the cloud and the convergence of IoT could offer new opportunities for these two techniques. The IoT cloud convergence plays a significant role in smart healthcare by understanding heterogeneous healthcare contents for supporting quality and affordable healthcare [<xref ref-type="bibr" rid="ref-4">4</xref>]. The OC is the third most common gynecologic cancer worldwide after uterine and cervical cancers and has high death rates [<xref ref-type="bibr" rid="ref-5">5</xref>]. Thus, it is essential to understand more about ovarian cancer heterogeneity to choose distinct treatment responses and predict patient medical outcomes. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the smart healthcare system in IoT.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Smart healthcare system in IoT</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-1.png"/>
</fig>
<p>Even though ovarian cancer is chemo-sensitive and usually shows primary efficiency against taxane or platinum treatment, the five-year recurrence rate is 60% to 80% in those with advanced disease [<xref ref-type="bibr" rid="ref-6">6</xref>]. Hence, significant efforts have been focused on developing novel techniques for predicting disease progression and prognoses for malignancy. On the IoMT, the calculation of OC gets better by using new potential data for experimental purposes [<xref ref-type="bibr" rid="ref-7">7</xref>]. In some cases, earlier diagnosis of OC is essential. Nevertheless, earlier recognition of OC remains a challenge for each of the endeavors. There have been ongoing studies for recognizing cancer markers using proteomic design in serum [<xref ref-type="bibr" rid="ref-8">8</xref>]. The AI is considered a diagnostic approach for medicinal diagnoses. In terms of computer-aid diagnosis (CAD), the possibility of AI usage in medicine has been investigated [<xref ref-type="bibr" rid="ref-9">9</xref>&#x2013;<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>At first, AI is distinct from conventional computer programming [<xref ref-type="bibr" rid="ref-13">13</xref>]. A preceding programming approach generates output with the input data and the given rule. On the other hand, AI produces rules using the input and output data. Assumed the input and output data of the current data set, the AI approach derive patterns and rules hidden in the data. Moreover, with the recently found patterns and rules, AI could forecast the output eventually from other input data. AI prediction has been studied and applied in different scientific fields. In comparison to the conventional medical image processing method [<xref ref-type="bibr" rid="ref-14">14</xref>], deep learning includes deep belief nets (DBN), which employs image pixel value as input data rather than image feature estimated from the segmented object; therefore, manual object segmentation or feature calculation is no longer needed, that making the procedure efficient and more straightforward. After that, authors in virtually every field, including medical imaging, have actively started participating in the dynamically increasing fields of deep learning.</p>
<p>This paper introduces a new quantum black widow optimization with a machine learning-enabled decision support system (QBWO-MLDSS) for smart healthcare. The QBWO-MLDSS model primarily employs the Z-score normalization approach to pre-process the data. Besides, the QBWO-MLDSS technique designs a novel QBWO algorithm for feature selection (FS). Next, symbiotic organisms search (SOS) with extreme learning machine (ELM) model applied for OC detection and classification. The experimental result analysis of the QBWO-MLDSS model is performed using a benchmark dataset.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>Consiglio et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] related a group of fuzzy rule models and genetic algorithm (GA) for analyzing the data set collected of 21 instances and six classes, suitable for exploring expression profiles from OC, related to another ovarian disease. The presented technique has been able to execute a feature selection (FS) amongst genes the GA leads and structure a group of if-then rules that describe that class is well-known by detecting modifies from the expression of chosen genes. Bae et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a FS technique that effectively differentiates colorectal cancer patients in normal individuals utilizing K-means clustering and the altered harmony search algorithm (HSA). The presented technique has 4 phases. Primary, novel data are Z-normalizing by data pre-processing. The candidate genes are chosen to utilize the Fisher score. Afterward, one representative gene was chosen in all the clusters, then-candidate genes were clustered utilizing the K-means cluster. At last, the FS was implemented utilizing the altered HSA.</p>
<p>Sujamol et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] described a multistage FS technique for identifying critical micro-Ribonucleic acid (MiRNA) and medicinal features to enhance the accuracy of OC recurrence forecasted. The MiRNA expression profiles of OC patients and their equivalent to medicinal information are downloaded in The Cancer Genome Atlas (TCGA) cancer repository. In addition, recurrence forecast is executed utilizing the attained MiRNA expression profiles and medicinal factor selected utilizing correlation study. Paik et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] designed a novel prognostic classifier for epithelial ovarian cancer (EOC) patients utilizing gradient boosting (GB) and for comparing the accuracy of the prognostic method with convention statistical technique. A novel GB-led classifier accurately recognized the prognostic subgroups of patients with EOC and revealed superior accuracy than the convention technique.</p>
<p>The authors in [<xref ref-type="bibr" rid="ref-19">19</xref>] presented the machine learning (ML) technique such as Bagging and random forest (RF) to the classifier as to benign/malignant of OC. The bagging technique is identified for maximizing the classifier and avoiding over-fitting. Regardless, the RF generates a minimal error and is a practical approach to evaluating missing information. Elhoseny et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] employed self-organizing maps (SOM) and Optimal recurrent neural network (ORNN) for classifying OC. Likewise, a better classification named ORNN is utilized. The classifier rate of the OC detections procedure is enhanced by optimizing the weight of RNN infrastructure utilizing the Adaptive Harmony Search Optimization (AHSO) technique.</p>
<p>Manzalawy et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] presented a new structure to integrate multi-omics data utilizing multi-view FS. A novel multi-view FS technique is established, an alteration of famous Min-Redundancy and Maximum-Relevance (MRMR) single-view FS technique to multi-view setting. The outcomes suggested that multi-view techniques demonstrate both view-specific techniques (for instance, techniques training and testing utilized a single type of omics data) and techniques dependent upon two baseline data fusion techniques.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Model</title>
<p>This study has developed a new QBWO-MLDSS technique for OC detection and classification in the smart healthcare environment. The proposed QBWO-MLDSS model encompasses Z-score normalization, QBWO based feature extraction, ELM-based classification, and SOS-based parameter tuning. The utilization of the SOS algorithm assists appropriately in choosing the parameter values of the ELM model. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts the block diagram of the QBWO-MLDSS technique.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Block diagram of QBWO-MLDSS technique</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-2.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Z-Score Normalization</title>
<p>The z-score is a normalization and standardization approach that characterizes the number of standard deviations (SD), a raw data point below or above the population mean [<xref ref-type="bibr" rid="ref-22">22</xref>]. It preferably lies in the range of <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mo>+</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula>. It standardizes the data set to the abovementioned scale for converting data with different scales to default scales. Consequently, reflecting how much SD a point is below or above the mean, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>x</mml:mi></mml:math></inline-formula> denotes the value of a particular sample, <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> indicates the mean, and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> shows the SD.</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>Z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mfrac></mml:math></disp-formula></p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Process Involved in QBWO Based Feature Selection</title>
<p>Once the medical data is pre-processed, they are passed into the QBWO algorithm to choose an optimal subset of features. Like other evolutionary techniques, the presented technique initiates with the first population of spiders. Thus, every spider signifies the potential solution. Primary spiders within pairs attempt to reproduce a novel generation [<xref ref-type="bibr" rid="ref-23">23</xref>]. The female black widow (BW) eats the male during or after mating. Afterward, she transfers kept sperm from her sperm thecae and releases them into egg sacs. It is left by being implemented on the winds.</p>
<p>For solving an optimized issue, the value of problem variables is created as a suitable infrastructure for solving existing issues. In BWO, the potential solutions to every problem have been assumed as BW spiders. All the BW spiders illustrate the value of problem variables. For resolving the benchmark function, the infrastructure is assumed as an array. In the <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>-dimension optimized issue, the widow is an array of <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> demonstrating the solution of problems. This array has been determined as:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi mathvariant="normal">W</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">w</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>All the variable values <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> has been floating-point numbers. The fitness of widows are attained with an estimation of FF <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mtext>f</mml:mtext></mml:mrow></mml:math></inline-formula> at the widow of <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Thus,</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mtext>&#xA0;Fitness</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>widow</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>For starting the optimized approach, the candidate widow matrix of sizes <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>pop</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> has been generated by the initial population of spiders. Then, the pairs of parents arbitrarily were selective to perform the creating stage by mating, whereas females have eaten the male BW during or after that.</p>
<p>As the pairs were independent of everyone, it can begin with a mate for reproducing a novel generation; simultaneously, all the pairs mate from its web individually in the other. In reality, around 1000 eggs were created from all mates; eventually, any spider babies have been survived that are stronger. Afterward, offspring have been created with utilizing <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> with the following formula (<xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>) whereas <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are parents, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are offspring.</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>This procedure has been repeated <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>var</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:math></inline-formula> times, but arbitrarily chosen numbers are not reproduced. Lastly, the children and mom were more to array and sort by its fitness value, based on the cannibalism rating (CR), any optimum individuals were added to the recently created populations. These stages implement in every pair.</p>
<p>At this point, it contains three types of cannibalism. A primary one is a sexual cannibalism, whereas the female BW eats her husband during or after mating. Its fitness value finds this approach female and male. The secondary type is sibling cannibalism, whereas the strong spiderlings eat their weaker sibling. This method sets a CR based on that the count of survivors is defined during this method. In particular cases, the tertiary type of cannibalism is frequently detected that the baby spider eats its mother. It utilizes the fitness value for determining strong/weak spiderlings. It is arbitrarily chosen Mutepop amount of individual&#x2019;s procedure population during the mutation phase. All the selected solutions arbitrarily exchange two elements from the array. The Mutepop has been computed as the mutation rate. Like another evolutionary technique, three end states are assumed: (A) the existing number of iterations. (B) the observance of without altering from the fitness values of the optimum widow to many iterations. (C) Attaining a particular level of accuracy.</p>
<p>The QBWO algorithm is derived using quantum computing concepts to improve global exploration capabilities [<xref ref-type="bibr" rid="ref-24">24</xref>]. The basic unit of quantum computing is the <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>Q</mml:mi></mml:math></inline-formula>-bit, which falls in the state <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003E;</mml:mo></mml:math></inline-formula>, in the state <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:math></inline-formula> in a superposition of the state <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:math></inline-formula> <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mo>&#x003E;</mml:mo></mml:math></inline-formula> concurrently. The <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>Q</mml:mi></mml:math></inline-formula>-bit can be defined by integrating the states <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mi>a</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> given below.</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>Q</mml:mi><mml:mo>&#x003E;=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></disp-formula>where <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> indicate complex numbers, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> (resp. <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>) implies the possibility of finding <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>Q</mml:mi></mml:math></inline-formula>-bit in state <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mn>0</mml:mn></mml:math></inline-formula>. The quantum register of size <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>n</mml:mi></mml:math></inline-formula> is applied to produce a collection of <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>n</mml:mi></mml:math></inline-formula> <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>Q</mml:mi></mml:math></inline-formula>-bits. It indicates a superposition of <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>n</mml:mi></mml:math></inline-formula> <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>Q</mml:mi></mml:math></inline-formula>-bits, i.e., it holds up to <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> likely values concurrently. A quantum register can be defined as follows.</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x003E;</mml:mo></mml:math></disp-formula></p>
<p>The amplitude <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> will fulfill the following property:</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></disp-formula></p>
<p>The choice of features using the QBWO algorithm can be represented by a <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>N</mml:mi></mml:math></inline-formula> sized vector where <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>N</mml:mi></mml:math></inline-formula> specifies the number of features [<xref ref-type="bibr" rid="ref-20">20</xref>]. Every position vector considered the value as 0/1, indicating the selection and non-selection of features. The QBWO algorithm derived a fitness function (FF) to determine solutions for achieving a trade-off between two objectives as given in <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>:</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mi>Y</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>T</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> implies the classification error rate. <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mo>|</mml:mo><mml:mi>Y</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> denotes the size of subsets that this technique selects and <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:mo>|</mml:mo><mml:mi>T</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> total count of features in the present dataset. <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> indicates the parameter <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> related to the weight of error rates of the classifier correspondingly, yet <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> refers to the importance of reducing features.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Process Involved in Optimal ELM Based Classification</title>
<p>The chosen features are fed into the ELM model during the OC classification process. ELM was presented in [<xref ref-type="bibr" rid="ref-25">25</xref>]. In mathematical procedures, ELM using <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>L</mml:mi></mml:math></inline-formula> hidden node and a feature mapping <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is modeled by the following equation</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula>whereas <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represent a weight vector linking the <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>j</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> hidden layer and the output neuron. Distinct functions might be utilized for the ELM feature mapping in different applications. An efficient feature mapping is a sigmoid function.</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> indicates the weight vector joining the <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>j</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> hidden layer and input neuron, <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the bias of &#x003D; <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>j</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> hidden layer. The <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>N</mml:mi></mml:math></inline-formula> equation in <xref ref-type="disp-formula" rid="eqn-5">(5)</xref> is formulated by a compact version H&#x03B2; <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mo>=</mml:mo><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow></mml:math></inline-formula>, using <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:mtext>H</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</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:msub><mml:mi>h</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Here <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:mtext>H</mml:mtext></mml:mrow></mml:math></inline-formula> denotes the hidden neuron output matrix. The solution corresponds to the subsequent optimization issue.</p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:munder><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mtext>H</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:msubsup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>When no gaining is feasible for the solution of <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref> by altering the input weight and hidden neuron bias, ELM arbitrarily assigns and fixes the input weight ai and hidden neuron bias bi. Then, the optimization issues <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref> is converted as:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:munder><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>H</mml:mi><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:msubsup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>It is observed that the ELM concept aims to reach the minimum training error and the minimum norm of output weight.</p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mover><mml:mi>&#x03B2;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mtext>H</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2020;</mml:mo></mml:mrow></mml:msup><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow></mml:math></disp-formula></p>
<p>Now <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mo>&#x2020;</mml:mo></mml:math></inline-formula> represents the Moore&#x2013;Penrose generalized inverse. For a novel testing instance <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, the decision process of ELM is represented as follows:</p>
<p><disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mover><mml:mi>&#x03B2;</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The ELM approach for OC classification has been shown in Algorithm 1.</p>
<fig id="fig-13">
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-13.png"/>
</fig>
<p>Finally, the weight and bias values of the ELM model are optimally adjusted using the SOS algorithm. Cheng and Prayogo [<xref ref-type="bibr" rid="ref-26">26</xref>] developed a metaheuristic technique, named SOS, stimulated from the natural ecosystem. The SOS algorithm exploits the symbiotic connection among two different species. Mutualism can be defined as the interdependent relationship among a pair of organisms where both organisms benefit from the interaction. The relationship between bees and flowers is a perfect illustration form mutualism. The bee moves amongst the flower, gather nectar, and converts it to honey. It also assists the flowers in the pollination procedure. The mathematical formulation of this process is defined in the following:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mo>&#x22C6;</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mo>&#x22C6;</mml:mo></mml:mrow></mml:msup><mml:mi>B</mml:mi><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mi>B</mml:mi><mml:mi>F</mml:mi><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> member of the population and <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is a creature arbitrarily chosen for interaction with <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The organisms are operating mutually based on the survival in the ecosystem, <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:math></inline-formula> is an arbitrary number with a constant distribution of <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>, <italic>MV</italic> defines mutual vector, <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>B</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> represents benefit vector, <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>k</mml:mi></mml:math></inline-formula> implies iteration, and <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes optimal individual organism attained in the <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> round. The MV and <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>B</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> can be determined using <xref ref-type="disp-formula" rid="eqn-18">Eqs. (18)</xref> and <xref ref-type="disp-formula" rid="eqn-19">(19)</xref>:</p>
<p><disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mi>M</mml:mi><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>B</mml:mi><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The round function can set the BF value as 1 or 2. It helps determine whether the organism partly or entirely benefitted from the interaction amongst the individuals from the population.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Validation</title>
<p>The experimental result analysis of the QBWO-MLDSS model is validated using the ovarian cancer dataset from the Kaggle repository (available at <uri xlink:href="https://www.kaggle.com/saurabhshahane/predict-ovarian-cancer">https://www.kaggle.com/saurabhshahane/predict-ovarian-cancer</uri>). This work takes 178 images under the Benign Ovarian Tumor (BOT) class and 171 images under OC class. Besides, the dataset holds a set of 50 features.</p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the correlation matrix attained for the chosen 20 features. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> exhibits the confusion matrix generated by the QBWO-MLDSS model on the OC classification process on the training/testing dataset of 80:20. The figure indicates that the QBWO-MLDSS model has identified 33 instances in the OC class and 35 in the BOT class.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Correlation matrix of QBWO-MLDSS technique</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-3.png"/>
</fig>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Confusion matrix of QBWO-MLDSS technique under training/testing (80:20) dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-4.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> demonstrates the confusion matrix created by the QBWO-MLDSS model on the OC classification process on the training/testing dataset of 70:30. The figure signified that the QBWO-MLDSS model had recognized 49 instances in the OC class and 50 in the BOT class.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Confusion matrix of QBWO-MLDSS technique under training/testing (70:30) dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-5.png"/>
</fig>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> provides an overall OC classification outcome of the QBWO-MLDSS model under a distinct training/testing dataset. The experimental values indicated that the QBWO-MLDSS model has resulted in practical outcomes on both sizes of training/testing datasets.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Result analysis of QBWO-MLDSS with different performance measures</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>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
<th>RMSE</th>
<th>MAPE</th>
</tr>
</thead>
<tbody>
<tr>
<td>Training/Testing (80:20)</td>
<td>97.06</td>
<td>97.22</td>
<td>97.14</td>
<td>0.017</td>
<td>2.16</td>
</tr>
<tr>
<td>Training/Testing (70:30)</td>
<td>96.08</td>
<td>94.34</td>
<td>95.19</td>
<td>0.023</td>
<td>3.12</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> investigates the performance of the QBWO-MLDSS model in terms of <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The figure reported that the QBWO-MLDSS model had accomplished maximum values of <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. For instance, on training/testing dataset of 80:20, the QBWO-MLDSS model has offered <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.06%, 97.22%, and 97.14%, respectively. Likewise, on training/testing dataset of 70:30, the QBWO-MLDSS model had obtained <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.08%, 94.34%, and 95.19% respectively.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Result analysis of QBWO-MLDSS model technique with various measures</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-6.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> examines the outcome of the QBWO-MLDSS model in terms of root mean square error (RMSE) and mean absolute percentage error (MAPE). The figure reported that the QBWO-MLDSS model had gained minimal values of RMSE and MAPE. For instance, on the training/testing dataset of 80:20, the QBWO-MLDSS model has provided low RMSE and MAPE of 0.017 and 2.16, respectively. In the same way, on the training/testing dataset of 70:30, the QBWO-MLDSS model has gained RMSE and MAPE of 0.023 and 3.12, respectively.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>RMSE and MAPE analysis of QBWO-MLDSS technique</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-7.png"/>
</fig>
<p>The accuracy outcome analysis of the QBWO-MLDSS technique under training/testing (80:20) dataset is portrayed in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The results demonstrated that the QBWO-MLDSS technique improved validation compared to training accuracy. It is additionally observable that the accuracy values with the count of epochs are saturated.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The QBWO-MLDSS accuracy analysis under training/testing (80:20) dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-8.png"/>
</fig>
<p>The loss outcome analysis of the QBWO-MLDSS technique under training/testing (80:20) dataset is depicted in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The figure revealed that the QBWO-MLDSS technique had signified the decreased validation over the training loss. It is further remarked that the loss values with the count of epochs are saturated.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Loss analysis of QBWO-MLDSS technique under training/testing (80:20) dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-9.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-10">Fig. 10</xref> illustrate the result analysis of the QBWO-MLDSS model in terms of RMSE and MAPE. The results indicated that the genetic algorithm (GA) model has worse outcomes with the maximum RMSE and MAPE values of 0.5693 and 5.5620, respectively. Afterward, the enhanced artificial bee colony (EABC) and harmony search (HS) models have certainly improved RMSE and MAPE values. Though the adaptive HS optimization (AHSO) algorithm has resulted in reasonable RMSE and MAPE values of 0.1065 and 3.4720, the presented QBWO-MLDSS model has accomplished effective outcomes with the least RMSE and MAPE values of 0.0170 and 2.1600, respectively.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Result analysis of QBWO-MLDSS model in terms of RMSE and MAPE with existing approaches</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>RMSE</th>
<th>MAPE</th>
</tr>
</thead>
<tbody>
<tr>
<td>GA</td>
<td>0.5693</td>
<td>5.5620</td>
</tr>
<tr>
<td>EABC</td>
<td>0.3498</td>
<td>4.5750</td>
</tr>
<tr>
<td>HS</td>
<td>0.2876</td>
<td>4.5100</td>
</tr>
<tr>
<td>AHSO</td>
<td>0.1065</td>
<td>3.4720</td>
</tr>
<tr>
<td>QBWO-MLDSS</td>
<td>0.0170</td>
<td>2.1600</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Result analysis of QBWO-MLDSS model with existing approaches</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-10.png"/>
</fig>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-11">Fig. 11</xref> demonstrate the comparative classification results of the QBWO-MLDSS model with existing techniques [<xref ref-type="bibr" rid="ref-20">20</xref>]. The results indicated that the radial basis function network (RBFN) and feed forward neural network (FFNN) models had shown ineffectual outcomes with minimal <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values. Ensuingly, the GEneral neural network (GENN) model has shown slightly increasing values of <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. In addition, the RNN and ORNN models have exhibited considerably improved values of <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. However, the QBWO-MLDSS model has accomplished superior OC classification results with the <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.06%, 97.22%, and 97.14%, respectively.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparative analysis of QBWO-MLDSS technique with existing approaches</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Sensitivity</th>
<th>Specificity</th>
<th>Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td>RBFN model</td>
<td>65.94</td>
<td>79.31</td>
<td>79.61</td>
</tr>
<tr>
<td>FFNN model</td>
<td>75.97</td>
<td>68.98</td>
<td>79.91</td>
</tr>
<tr>
<td>GENN model</td>
<td>82.34</td>
<td>78.4</td>
<td>80.83</td>
</tr>
<tr>
<td>RNN model</td>
<td>85.38</td>
<td>79.61</td>
<td>89.63</td>
</tr>
<tr>
<td>ORNN model</td>
<td>94.19</td>
<td>94.79</td>
<td>96.92</td>
</tr>
<tr>
<td>QBWO-MLDSS</td>
<td>97.06</td>
<td>97.22</td>
<td>97.14</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Comparative analysis of QBWO-MLDSS technique with existing approaches</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-11.png"/>
</fig>
<p>Finally, the fitness value analysis of the QBWO-MLDSS model is performed with other methods in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>. The results show that the HS model has poor results with a higher fitness value. At the same time, the AHSO algorithm has depicted slightly enhanced outcomes, whereas the GA attains even reduced fitness values. However, the QBWO-MLDSS model has surpassed the other methods with the maximum fitness values under several iterations. The tables and figures mentioned above ensure that the QBWO-MLDSS model can accomplish maximum OC classification performance.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Fitness value analysis of QBWO-MLDSS model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28878-fig-12.png"/>
</fig>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This study has developed a new QBWO-MLDSS technique for OC detection and classification in the smart healthcare environment. The proposed QBWO-MLDSS model encompasses Z-score normalization, QBWO based feature extraction, ELM-based classification, and SOS-based parameter tuning. The utilization of the SOS algorithm assists adequately in choosing the parameter values of the ELM model. The experimental result analysis of the QBWO-MLDSS model is performed using a benchmark dataset, and the comparative results reported the enhanced outcomes of the QBWO-MLDSS model over the recent approaches. Therefore, the QBWO-MLDSS technique can detect and categorize the OC rapidly and accurately. In the future, the proposed QBWO-MLDSS model can be extended to the design of feature reduction and outlier detection approaches to improvise the OC classification performance.</p>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</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>
</sec>
</body>
<back>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. W. L.</given-names> <surname>Moreira</surname></string-name>, <string-name><given-names>J. J. P. C.</given-names> <surname>Rodrigues</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Korotaev</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Al-Muhtadi</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Kumar</surname></string-name></person-group>, &#x201C;<article-title>A comprehensive review on smart decision support systems for health care</article-title>,&#x201D; <source>IEEE Systems Journal</source>, vol. <volume>13</volume>, no. <issue>3</issue>, pp. <fpage>3536</fpage>&#x2013;<lpage>3545</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>E. S.</given-names> <surname>Kumar</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Jayadev</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for clinical decision support systems: A review from the panorama of smart healthcare</article-title>,&#x201D; <conf-name>Deep Learning Techniques for Biomedical and Health Informatics, Studies in Big Data Book Series</conf-name>, vol. <volume>68</volume>, pp. <fpage>79</fpage>&#x2013;<lpage>99</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>G. Z.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X. Z.</given-names> <surname>He</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>TBE-Net: A three-branch embedding network with part-aware ability and feature complementary learning for vehicle re-identification</article-title>,&#x201D; <source>IEEE Transactions on Intelligent Transportation Systems</source>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2021</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>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>P. S.</given-names> <surname>Chang</surname></string-name> and <string-name><given-names>X. Z.</given-names> <surname>He</surname></string-name></person-group>, &#x201C;<article-title>RSOD: Real-time small object detection algorithm in UAV-based traffic monitoring</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>92</volume>, no. <issue>6</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</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>C. A.</given-names> <surname>Kontovas</surname></string-name></person-group>, &#x201C;<article-title>The green ship routing and scheduling problem (GSRSP): A conceptual approach</article-title>,&#x201D; <source>Transportation Research Part D: Transport and Environment</source>, vol. <volume>31</volume>, no. <issue>3</issue>, pp. <fpage>61</fpage>&#x2013;<lpage>69</lpage>, <year>2014</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>S.</given-names> <surname>Ganguly</surname></string-name></person-group>, &#x201C;<article-title>Multi-objective distributed generation penetration planning with load model using particle SWARM optimization</article-title>,&#x201D; <source>Decision Making: Applications in Management and Engineering</source>, vol. <volume>3</volume>, no. <issue>1</issue>, pp. 30--42, <year>2020</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>H.</given-names> <surname>Engqvist</surname></string-name>, <string-name><given-names>T. Z.</given-names> <surname>Parris</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Biermann</surname></string-name>, <string-name><given-names>E. W.</given-names> <surname>R&#x00F6;nnerman</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Larsson</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Integrative genomics approach identifies molecular features associated with early-stage ovarian carcinoma histotypes</article-title>,&#x201D; <source>Scientific Reports</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</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>M.</given-names> <surname>Akazawa</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Hashimoto</surname></string-name></person-group>, &#x201C;<article-title>Artificial intelligence in ovarian cancer diagnosis</article-title>,&#x201D; <source>Anticancer Research</source>, vol. <volume>40</volume>, no. <issue>8</issue>, pp. <fpage>4795</fpage>&#x2013;<lpage>4800</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>R. F.</given-names> <surname>Mansour</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Escorcia-Gutierrez</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gamarra</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Garc&#x00ED;a</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Artificial intelligence with big data analytics-based brain intracranial hemorrhage e-diagnosis using CT images</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2021</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>K.</given-names> <surname>Muthumayil</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Manikandan</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Srinivasan</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Escorcia-Gutierrez</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gamarra</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Diagnosis of leukemia disease based on enhanced virtual neural network</article-title>, <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>69</volume>, no. <issue>2</issue>, pp. <fpage>2031</fpage>&#x2013;<lpage>2044</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>J.</given-names> <surname>Escorcia-Gutierrez</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Torrents-Barrena</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gamarra</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Madera</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Romero-Aroca</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A feature selection strategy to optimize retinal vasculature segmentation</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>70</volume>, no. <issue>2</issue>, pp. <fpage>2971</fpage>&#x2013;<lpage>2989</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>J.</given-names> <surname>Escorcia-Gutierrez</surname></string-name>, <string-name><given-names>R. F.</given-names> <surname>Mansour</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Bele&#x00F1;o</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Jim&#x00E9;nez-Cabas</surname></string-name>, <string-name><given-names>M.</given-names> <surname>P&#x00E9;rez</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Automated deep learning empowered breast cancer diagnosis using biomedical mammogram images</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>2</issue>, pp. <fpage>4221</fpage>&#x2013;<lpage>4235</lpage>, <year>2022</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>L.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Improved deep learning network based in combination with cost-sensitive learning for early detection of ovarian cancer in color ultrasound detecting system</article-title>,&#x201D; <source>Journal of Medical Systems</source>, vol. <volume>43</volume>, no. <issue>8</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2019</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.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Automatic classification of ovarian cancer types from cytological images using deep convolutional neural networks</article-title>,&#x201D; <source>Bioscience Reports</source>, vol. <volume>38</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2018</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>A.</given-names> <surname>Consiglio</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Casalino</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Castellano</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Grillo</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Perlino</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Explaining ovarian cancer gene expression profiles with fuzzy rules and genetic algorithms</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>10</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <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>J. H.</given-names> <surname>Bae</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>J. S.</given-names> <surname>Lim</surname></string-name> and <string-name><given-names>Z. W.</given-names> <surname>Geem</surname></string-name></person-group>, &#x201C;<article-title>Feature selection for colon cancer detection using k-means clustering and modified harmony search algorithm</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>9</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <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>S.</given-names> <surname>Sujamol</surname></string-name>, <string-name><given-names>E. R.</given-names> <surname>Vimina</surname></string-name> and <string-name><given-names>U.</given-names> <surname>Krishnakumar</surname></string-name></person-group>, &#x201C;<article-title>Improving recurrence prediction accuracy of ovarian cancer using multi-phase feature selection methodology</article-title>,&#x201D; <source>Applied Artificial Intelligence</source>, vol. <volume>35</volume>, no. <issue>3</issue>, pp. <fpage>206</fpage>&#x2013;<lpage>226</lpage>, <year>2021</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>E. S.</given-names> <surname>Paik</surname></string-name>, <string-name><given-names>J. W.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>J. Y.</given-names> <surname>Park</surname></string-name>, <string-name><given-names>J. H.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kim</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Prediction of survival outcomes in patients with epithelial ovarian cancer using machine learning methods</article-title>,&#x201D; <source>Journal of Gynecologic Oncology</source>, vol. <volume>30</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2019</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>A.</given-names> <surname>Arfiani</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Rustam</surname></string-name></person-group>, &#x201C;<article-title>Ovarian cancer data classification using bagging and random forest</article-title>,&#x201D; <source>AIP Conference Proceedings</source>, vol. <volume>2168</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2019</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>M.</given-names> <surname>Elhoseny</surname></string-name>, <string-name><given-names>G. B.</given-names> <surname>Bian</surname></string-name>, <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>A. K.</given-names> <surname>Singh</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Effective features to classify ovarian cancer data in internet of medical things</article-title>,&#x201D; <source>Computer Networks</source>, vol. <volume>159</volume>, no. <issue>17</issue>, pp. <fpage>147</fpage>&#x2013;<lpage>156</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y. E.</given-names> <surname>Manzalawy</surname></string-name>, <string-name><given-names>T. Y.</given-names> <surname>Hsieh</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Shivakumar</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Kim</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Honavar</surname></string-name></person-group>, &#x201C;<article-title>Min-redundancy and max-relevance multi-view feature selection for predicting ovarian cancer survival using multi-omics data</article-title>,&#x201D; <source>BMC Medical Genomics</source>, vol. <volume>11</volume>, no. <issue>S3</issue>, pp. <fpage>20</fpage>&#x2013;<lpage>31</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Mumtaz</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Anwar</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Irfan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Efficient water quality prediction using supervised machine learning</article-title>,&#x201D; <source>Water</source>, vol. <volume>11</volume>, no. <issue>11</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Hayyolalam</surname></string-name> and <string-name><given-names>A. A. P.</given-names> <surname>Kazem</surname></string-name></person-group>, &#x201C;<article-title>Black widow optimization algorithm: A novel meta-heuristic approach for solving engineering optimization problems</article-title>,&#x201D; <source>Engineering Applications of Artificial Intelligence</source>, vol. <volume>87</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>28</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. T.</given-names> <surname>Brady</surname></string-name>, <string-name><given-names>C. L.</given-names> <surname>Baldwin</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bapat</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Kharkov</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Gorshkov</surname></string-name></person-group>, &#x201C;<article-title>Optimal protocols in quantum annealing and quantum approximate optimization algorithm problems</article-title>,&#x201D; <source>Physical Review Letters</source>, vol. <volume>126</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>V. B.</given-names> <surname>Semwal</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Gaud</surname></string-name> and <string-name><given-names>G. C.</given-names> <surname>Nandi</surname></string-name></person-group>, &#x201C;<chapter-title>Human gait state prediction using cellular automata and classification using ELM</chapter-title>,&#x201D; in <source>Machine Intelligence and Signal Analysis, Advances in Intelligent Systems and Computing Book Series</source>, vol. <volume>748</volume>, <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>135</fpage>&#x2013;<lpage>145</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. E.</given-names> <surname>Ezugwu</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Prayogo</surname></string-name></person-group>, &#x201C;<article-title>Symbiotic organisms search algorithm: Theory, recent advances and applications</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>119</volume>, no. <issue>6</issue>, pp. <fpage>184</fpage>&#x2013;<lpage>209</lpage>, <year>2019</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
