<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">25336</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.025336</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Energy Aware Clustering with Medical Data Classification Model in IoT Environment</article-title>
<alt-title alt-title-type="left-running-head">Energy Aware Clustering with Medical Data Classification Model in IoT Environment</alt-title>
<alt-title alt-title-type="right-running-head">Energy Aware Clustering with Medical Data Classification Model in IoT Environment</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Bharathi</surname><given-names>R.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>bharathiphd2017@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Abirami</surname><given-names>T.</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, Cheran College of Engineering</institution>, <addr-line>K. Paramathi, Karur, 639111</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Technology, Kongu Engineering College</institution>, <addr-line>Perundurai, Erode, 638060</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: R. Bharathi. Email: <email>bharathiphd2017@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-05-24"><day>24</day>
<month>05</month>
<year>2022</year></pub-date>
<volume>44</volume>
<issue>1</issue>
<fpage>797</fpage>
<lpage>811</lpage>
<history>
<date date-type="received"><day>20</day><month>11</month><year>2021</year></date>
<date date-type="accepted"><day>06</day><month>1</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Bharathi and Abirami</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Bharathi and Abirami</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_25336.pdf"></self-uri>
<abstract>
<p>With the exponential developments of wireless networking and inexpensive Internet of Things (IoT), a wide range of applications has been designed to attain enhanced services. Due to the limited energy capacity of IoT devices, energy-aware clustering techniques can be highly preferable. At the same time, artificial intelligence (AI) techniques can be applied to perform appropriate disease diagnostic processes. With this motivation, this study designs a novel squirrel search algorithm-based energy-aware clustering with a medical data classification (SSAC-MDC) model in an IoT environment. The goal of the SSAC-MDC technique is to attain maximum energy efficiency and disease diagnosis in the IoT environment. The proposed SSAC-MDC technique involves the design of the squirrel search algorithm-based clustering (SSAC) technique to choose the proper set of cluster heads (CHs) and construct clusters. Besides, the medical data classification process involves three different subprocesses namely pre-processing, autoencoder (AE) based classification, and improved beetle antenna search (IBAS) based parameter tuning. The design of the SSAC technique and IBAS based parameter optimization processes show the novelty of the work. For showcasing the improved performance of the SSAC-MDC technique, a series of experiments were performed and the comparative results highlighted the supremacy of the SSAC-MDC technique over the recent methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Internet of things</kwd>
<kwd>healthcare</kwd>
<kwd>medical data classification</kwd>
<kwd>energy efficiency</kwd>
<kwd>clustering</kwd>
<kwd>autoencoder</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>More recent techniques, like smart devices, mobile applications, wearable devices, blockchain-based electronic medical recording systems home virtual assistants, biosensors, are initiating a modern era in health care service [<xref ref-type="bibr" rid="ref-1">1</xref>]. By connecting sensor nodes to mobile devices, several parameters could be interpreted and read properly and transferred to healthcare centres. Now, there are several reports about early launch and on-going development of a number of &#x201C;smart&#x201D; healthcare devices for diabetes mellitus (diabetes) such as &#x201C;smart syringe pen&#x201D;, &#x201C;smart pills&#x201D; and &#x201C;smart inhaler&#x201D; [<xref ref-type="bibr" rid="ref-2">2</xref>]. At the same time, biosensor is other essential application of the on-going digital transformation in healthcare. There is a wide-ranging biosensor which transmits healthcare data to web and mobile applications through wireless networks [<xref ref-type="bibr" rid="ref-3">3</xref>]. In this method, medical staffs have the possibility to monitor health status and control patient treatment outside the hospitals. The integration of IoT and Cloud is included in making efficient medical domain to monitor the patients and hospital centres [<xref ref-type="bibr" rid="ref-4">4</xref>]. Cloud IoT upgrades the health care applications by making collaborations among distinct units [<xref ref-type="bibr" rid="ref-5">5</xref>]. Under the use of Cloud IoT in medical industry, it is likely to distribute several applications such as sending the data to Cloud, WSN to collect delicate medical information, and subsequently examine the information for extracting valuable details with data analytics. The key characteristic of Cloud IoT in healthcare is to provide continuous medical services with decreased operation costs [<xref ref-type="bibr" rid="ref-6">6</xref>]. From the ubiquitous nature of medical systems, large number of information was generated by the sensor network that requires efficient management and continue with other data analytics [<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>Furthermore, medical sensor and IoT devices readings could be effectively employed in detecting a severe disease within a certain time period. The syntax is determined to carry out the detection method in the cloud-centric platform. The three sub-systems are developed for carrying out disease diagnosis procedures [<xref ref-type="bibr" rid="ref-8">8</xref>]. First, medical sensor and IoT device-based readings are attained by user subsystems. Next, for component-based, data analysis cloud sub-system is determined for carrying out disease diagnosis procedures. Finally, distinct alert-based signals are transmitted to caregiver and responder to take further actions according to the outcomes computed at the cloud sub-system [<xref ref-type="bibr" rid="ref-9">9</xref>]. In medical industry, IoT employs a wide historical dataset of continuous measurement during a certain period for disease diagnoses. The diagnoses in a health care environment require a collection of measurements for efficient outcomes that is impossible to have a single hospital visit [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Verma et al. [<xref ref-type="bibr" rid="ref-11">11</xref>], proposed a cloud-centric IoT based m-health care monitoring disease diagnosis architecture that forecasts the possible disease with its severity level. Main terminologies are determined for generating user-oriented healthcare measurement by examining the concepts of computation science. The architecture model for smart student health care is developed for the application scenarios. In Akhbarifar et al. [<xref ref-type="bibr" rid="ref-12">12</xref>], the patients&#x2019; health care status can be described by forecasting critical situations via data mining models to analyze their biological data sensed using smart healthcare IoT devices where a lightweight secured block encryption method is exploited to guarantee the patient sensitive information becomes secured. Lightweight block encryption approaches have a critical effect on these kinds of systems because of the limited resource in IoT platforms. Sattar et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] present a novel energy effective cluster enabled clinical decision support system (EEC-CDSS) for embedded IoT environments. Additionally, the IoT device transmits the information to the cloud environment wherever the real classification process is executed. Ullah et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] propose a clustering method for privacy-aware data dissemination based medical health care-IoT (MH-IoT) system for wireless networks. The presented method is compared to distinct ML methods with average data sets for patient data privacy once physician&#x0027;s review their healthcare reports.</p>
<p>Kumar et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] present an advanced IoT and Cloud based Mobile Healthcare application to diagnose and monitor severe disease. Now, a novel architecture is proposed for the public. In the study, a novel systematic model is employed for the diabetes disease and the relevant healthcare information is created by the UCI Repository data set and the healthcare sensor to predict the individuals who had a serious impact with diabetes. Furthermore, introduce a novel classification method termed Fuzzy Rule based Neural Classifier to diagnose the severity and the disease. Verma et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] developed the remote patient healthcare monitoring system in smart homes by utilizing the concepts of fog computing at the smart gateways. The presented method employs innovative services and techniques, like distributed storage, notification services, and at embedded data mining the edge network. The event triggering-based data communication method is adapted for processing the patient actual information at the fog layer.</p>
<p>This study designs a novel squirrel search algorithm based on energy aware clustering with medical data classification (SSAC-MDC) model in an IoT environment. The proposed SSAC-MDC technique involves the design of the squirrel search algorithm based clustering (SSAC) technique to choose proper set of cluster heads (CHs) and construct clusters. Moreover, the medical data classification process involves three different subprocesses namely pre-processing, autoencoder (AE) based classification, and improved beetle antenna search (IBAS) based parameter tuning. For showcasing the improved performance of the SSAC-MDC technique, a series of experiments were performed and the results are inspected extensively.</p>
<p>The rest of the paper is organized as follows. Section 2 offers the proposed model, Section 3 provides the result analysis, and Section 4 gives the conclusion.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Materials and Methods</title>
<p>In this study, an effective SSAC-MDC technique has been presented to accomplish energy efficiency and disease diagnosis in the IoT environment. The proposed SSAC-MDC technique operates on three major phases namely data collection, SSAC based cluster construction, and medical data classification. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> demonstrates the overall block diagram of SSAC-MDC approach. The roles and responsibilities of every layer are given in the following.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Overall process of SSAC-MDC technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-1.png"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Data Collection</title>
<p>User healthcare information is collected by a data acquisition method that allows low-power sensors, alternate medical gadgets, and a seamless combination of smart. These sensors are integrated with, and around the human body to monitor the function. In this approach, a user body sensor is comprised of implanted and wearable sensors. All the sensors have been concatenated with bio-sensors such as Blood pressure (BP), and ECG EEG, etc. For maintaining data security during transmission, a network is secured by Secure Socket Layer (SSL) to provide privacy and security. The timestamp synchronization of dissimilar classes of sensor nodes has been implemented.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Energy Aware Clustering Using SSAC Technique</title>
<p>The typical SSA upgrades the places of individuals based on the present season [<xref ref-type="bibr" rid="ref-17">17</xref>], the kind of individuals, and if the predator performs. Let the amount of population is <italic>N</italic>, the upper as well as lower bounds of search spaces were <italic>FS</italic><sub><italic>u</italic></sub> and <italic>FS</italic><sub><italic>L</italic></sub>.<italic>N</italic> represents the individuals are arbitrarily created dependent upon in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>D</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><italic>FS</italic><sub><italic>i</italic></sub> implies the <italic>i</italic><sup><italic>th</italic></sup> individual, (<italic>i</italic>&#x2009;&#x003D;&#x2009;1&#x2026;<italic>N</italic>) ;<italic>rand</italic> refers to the arbitrary number amongst <italic>zero</italic> and one, <italic>D</italic> represents the dimension of the problem. The individuals upgrade their places with gliding for hickory or acorn trees. The particular upgrading equations are demonstrated as <xref ref-type="disp-formula" rid="eqn-2">Eqs. (2)</xref> &#x0026; <xref ref-type="disp-formula" rid="eqn-3">(3)</xref> correspondingly:</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>F</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>r</mml:mi><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>r</mml:mi><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula><italic>r</italic> refers to the arbitrary number amongst zero and one. <italic>P</italic><sub><italic>dp</italic></sub> value of 0.1 defines the predator form probability, once <italic>r</italic>&#x2009;&#x003E;&#x2009;<italic>P</italic><sub><italic>dp</italic></sub>, afterward no predator performs, the squirrels glide under the forest for finding the food, and individuals were safe when <italic>r</italic>&#x2009;&#x2264;&#x2009;<italic>P</italic><sub><italic>dp</italic></sub>, the predators&#x2019; act, the squirrels were required for narrowing the scope of performances, an individuals were endangered, and its places were transferred arbitrarily, <italic>t</italic> stands for the exiting round, <italic>G</italic><sub><italic>c</italic></sub> signifies the constant with the value of 1.9, <italic>F</italic><sub><italic>ai</italic></sub> (<italic>i</italic>&#x2009;&#x003D;&#x2009;1, 2, &#x2026;<italic>N</italic><sub><italic>fs</italic></sub>) has individual arbitrarily chosen in <italic>F</italic><sub><italic>a</italic></sub>, &#x2005;<italic>dg</italic> denotes the gliding distance that is computed in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>:<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>d</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>g</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mi>s</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p><italic>hg</italic> indicates the constant valued 8, &#x22C5;&#x2009;<italic>sf</italic> implies the constant value of 18, <italic>tan</italic>(&#x03C6;) demonstrates the gliding angle that is computed in <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>:<disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>D</mml:mi><mml:mi>L</mml:mi></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><italic>D</italic> refers to the drag force and <italic>L</italic> stands for the lift force that is computed in <xref ref-type="disp-formula" rid="eqn-6">Eqs. (6)</xref> and <xref ref-type="disp-formula" rid="eqn-7">(7)</xref> correspondingly:</p>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C1;</mml:mi><mml:msup><mml:mi>V</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mi>S</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C1;</mml:mi><mml:msup><mml:mi>V</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mi>S</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p><italic>&#x03C1;</italic>, <italic>V</italic>, <italic>S</italic> and <italic>C</italic><sub><italic>D</italic></sub> represents every constant that is equivalent to 1.204&#x2005;kg m<sup>&#x2212;3</sup>, 5.25 ms<sup>&#x2212;1</sup>, 154 cm<sup>2</sup> and 0.6 correspondingly, <italic>C</italic><sub><italic>L</italic></sub> implies the arbitrary number amongst 0.675 as well as 1.5. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts the flowchart of SSA. Initially of all iterations, the classical SSA needs that entire populations are in winter. If every individual was upgraded, because the season alters are judged dependent upon in <xref ref-type="disp-formula" rid="eqn-8">Eqs. (8)</xref> and <xref ref-type="disp-formula" rid="eqn-9">(9)</xref>:
<disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msubsup><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msqrt><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>D</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math>
</disp-formula>
<disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>10</mml:mn><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>6</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>365</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2.5</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flowchart of SSA</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-2.png"/>
</fig>
<p><italic>T</italic> refers to the maximal amount of iterations, when <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:msubsup><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msubsup><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</inline-formula> winter has over and the season goes to summer, else, the season was unchanging [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>If the season goes to summer, every individual that glide to <italic>F</italic><sub><italic>h</italic></sub> stay at the upgraded place and every individual that glide to <italic>F</italic><sub><italic>a</italic></sub> and does not happen with predator transfer its places in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>:</p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mi>F</mml:mi><mml:msubsup><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mi>v</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>The Levy is a random walk system that step obey Levy distribution and is computed in <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>:<disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mi>L</mml:mi><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mi>v</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:msup><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03B2;</mml:mi></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><italic>&#x03B2;</italic> signifies the constant valued 1.5, <italic>&#x03C3;</italic> has estimated in <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>:<disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03C0;</mml:mi><mml:mi>&#x03B2;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03B2;</mml:mi></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mstyle></mml:math>
</disp-formula><disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mi>w</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>!</mml:mo></mml:math>
</disp-formula></p>
<p>Assume that the IoT system of <italic>n</italic> sensor is randomly proposed. For CH selection, the developed SSA employs a squirrel population i.e., deployed by making proper cluster and retaining the decreased energy consumption of the network. Consider <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> means the population vector of IoT with <italic>n</italic> sensor, where <italic>X</italic><sub><italic>i</italic></sub>(<italic>j</italic>)&#x2009;&#x2208;&#x2009;&#x007B;0, 1&#x007D;. CH and normal nodes are signified as 1 and 0. The initial population of <italic>NP</italic> solution is randomly inspired by zero and ones as follows,<disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>Let <italic>p</italic><sub><italic>opt</italic></sub> be the suggested percentage of CHs, and <italic>rand</italic> signifies uniform arbitrary number within [0, 1]. The arbitrarily located sensors are organized as <italic>K</italic> clusters: C<sub>1</sub>, C<sub>2</sub>, &#x2026;, C<sub>K</sub>. The CH selection is accountable for minimizing the cost of FF,<disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msub><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">H</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</disp-formula></p>
<p>Using: <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1.</mml:mn><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow></mml:math>
</inline-formula> Maximum stability period is attained by minimizing the Standard Deviation (SD) of RE of a node is a primary concern. Henceforth, SD (<italic>&#x03C3;</italic><sub><italic>RE</italic></sub>) is relevant for evaluating the supremacy of uniformly distributed load from sensors, as<disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:msup><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:mstyle></mml:msqrt></mml:math>
</disp-formula></p>
<p>While <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>,, <italic>E</italic>(<italic>node</italic><sub><italic>i</italic></sub>) represent the RE of <italic>i</italic>th node and <italic>n</italic> indicated the amount of nodes. The ultimate goal is based on the clustering quality in which the function of cluster cohesion and isolation is accomplished. Once the proportion of cohesion to separation is minimal, optimum clustering can be executed. It can be attained by utilizing the FF ratio of complete Euclidean distance of CHs to CMs and constrained Euclidean distance of 2 dissimilar CHs.<disp-formula id="eqn-16"><label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:munder><mml:mrow><mml:mo form="prefix">min</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>&#x2260;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Medical Data Classification Model</title>
<p>At this stage, the collected medical data are examined in different ways to determine the existence of the diseases. The medical data classification module involves data preprocessing, AE based classification, and IBSA based parameter tuning.</p>
<sec id="s2_3_1">
<label>2.3.1</label>
<title>Data Pre-Processing</title>
<p>Initially, the data value was gathered in the UCI dataset afterward pre-processed that needs noise elimination or exchange of missing data. The noiseless data use for efficiently detecting designs linked with heart disease. The median studentized remaining manner was implemented for removing unwanted or noisy data as it examines the connection amongst data from the dataset. This procedure of noise elimination improves the detection procedure of heart disease. The primary step is for examining the data obtainable from the dataset and computing the median to the missing value [<xref ref-type="bibr" rid="ref-19">19</xref>]. The median value was defined as placing the data as to ascending order, and afterward, the mid-value was computed. The missing and distinct values were changed for helping the median value. The data has standardized from the range zero to one, then eliminating the missing value for reducing the complexity of estimating the designs of heart disease (HD). The remaining studentized manner was utilized as a normalized procedure dependent upon the computation of standard deviation (SD). The normalized method occurs with several data distributions and regression analysis to HD forecast.</p>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title>Autoencoder Based Classification</title>
<p>During the classification process, the AE model receives the preprocessed data as input and classifies the data into distinct classes. As a foundation of the DL method, DNNs or so-called multilayer perceptron (MLP), are utilized for representing a complicated model relating data outputs <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mi>y</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:math>
</inline-formula> and data input, <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:math>
</inline-formula>. A standard DNN is made up of an output, <italic>L</italic> hidden, and input layers. All the hidden layers transform the output of the preceding layer via two operators, that is, nonlinear activation function <italic>&#x03C3;</italic> and affine mapping as well as output the result to the following layer as follows:<disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>L</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula>whereas <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math>
</inline-formula> represent the outputs of layer <italic>l</italic> with <italic>n</italic><sub><italic>l</italic></sub> neuron, and <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>
</inline-formula> as well as <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math>
</inline-formula> denotes the bias vector of layer <italic>l</italic> and weight matrix for linear mapping, correspondingly, in which <italic>n</italic><sub>0</sub>&#x2009;&#x003D;&#x2009;<italic>d</italic><sub><italic>in</italic></sub> indicates the input dimension. Some widely utilized activation function includes rectified linear unit (ReLu), leaky ReLu, and logistic sigmoid. In this work, a hyperbolic tangent function is applied as the activation function for hidden layers, <italic>&#x03C3;</italic>&#x2009;&#x003D;&#x2009;<italic>tanh</italic> Noted that the setup of the output layer is based on the kind of ML processes, for example, regression, classification [<xref ref-type="bibr" rid="ref-20">20</xref>]. For regression task, a linear function is utilized in the output layer in which the final hidden layer data is mapped with the output vector <italic>y</italic>, formulated by: <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>L</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math>
</inline-formula>, while <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math>
</inline-formula> indicates the DNN estimate of the output <italic>y</italic>. <italic>&#x03B8;</italic> represent the set of bias coefficients and trainable weight, <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mi>&#x03B8;</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msubsup><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>.</mml:mo></mml:math>
</inline-formula></p>
<p>AE is an unsupervised learning method where the specific architecture of DNN is leveraged to representation learning or dimensionality reduction. Especially, the aim is to optimally copy its input to output with the representation feature by presenting a lower-dimension embedding layer (or named as a code). An AE contains a decoder function <italic>h</italic><sub><italic>dec</italic></sub>(.; <italic>&#x03B8;</italic><sub><italic>dec</italic></sub>): &#x211D;<sup><italic>p</italic></sup>&#x2009;&#x2192;&#x2009;&#x211D;<sup><italic>d</italic></sup> and encoder function <italic>h</italic><sub><italic>enc</italic></sub>(.;<italic>&#x03B8;</italic><sub><italic>enc</italic></sub>) : &#x211D;<sup><italic>d</italic></sup>&#x2009;&#x2192;&#x2009;&#x211D;<sup><italic>p</italic></sup>, as follows</p>
<p><disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>:=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2218;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-19"><label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:mo>:=</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>Whereas <italic>p</italic>&#x2009;&#x003C;&#x2009;<italic>d</italic> represent the embedding dimension, <italic>&#x03B8;</italic><sub><italic>enc</italic></sub> and <italic>&#x03B8;</italic><sub><italic>dec</italic></sub> indicates the DNN coefficient of encoder and decoder parts, correspondingly, as well as X denotes the output of the AE, a <italic>x</italic> reconstruction of the original input. Using the latent dimension <italic>p</italic> much lesser than the input dimension <italic>d</italic>, the encoder <italic>h</italic><sub><italic>enc</italic></sub> is trained for learning the compressed representation of <italic>x</italic>, represented as the embedding <italic>x</italic><sup>&#x2032;</sup>&#x2009;&#x2208;&#x2009;&#x211D;<sup><italic>p</italic></sup>, in which the decoder <italic>h</italic><sub><italic>dec</italic></sub> reconstruct the input data via mapping the embedding representation back to the higher-dimension space. Noted that other dimensionality reduction methods, the employment of AE is depending on the manifold hypothesis that assumes that the provided higher-dimension input data lies on a lower-dimension manifold <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="script">E</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> i.e., embedded in a high-dimension vector space.</p>
</sec>
<sec id="s2_3_3">
<label>2.3.3</label>
<title>Parameter Tuning Using IBSA Technique</title>
<p>For improvising the classifier results of the AE model, the parameter tuning process takes place using IBSA technique. In BAS method, uses the succeeding 2 rules stimulated by the behaviors of beetle search with antennae that include detecting and searching behaviors. Note that the beetle searches arbitrarily to examine an unknown environment.</p>
<p>Step 1: consider that the location of the longicorn beetle in <italic>n</italic>-dimension solution space is &#x003D;&#x2009;(<italic>x</italic><sub>1</sub>, <italic>x</italic><sub>2</sub>, &#x2026;, <italic>x</italic><sub><italic>n</italic></sub>), for modelling the searching behavior, as well as proposed an arbitrary direction of beetle searching:<disp-formula id="eqn-20"><label>(20)</label>
<mml:math id="mml-eqn-20" display="block"><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula>whereas rand (<italic>n</italic>, 1) represent an <italic>n</italic>-dimension vector of arbitrary value within [0, 1]</p>
<p>Step 2: proposed the search behavior of left-and right-hand sides, correspondingly, for imitating the activity of the beetle antennae:<disp-formula id="eqn-21"><label>(21)</label>
<mml:math id="mml-eqn-21" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula>whereas <italic>x</italic><sup><italic>k</italic></sup> indicates the present location of longicorn beetles, <italic>d</italic> denotes the distance from the center of mass to the antennae, <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math>
</inline-formula> signifies a location lies in the search region of the right-hand side, and <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math>
</inline-formula> means the left-hand side [<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<p>Step 3: location upgrade technique:<disp-formula id="eqn-22"><label>(22)</label>
<mml:math id="mml-eqn-22" display="block"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:msup><mml:mi>&#x03B4;</mml:mi><mml:mi>k</mml:mi></mml:msup><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:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>Let <italic>&#x03B4;</italic><sup><italic>k</italic></sup> be the existing step size, sign represent a symbolic function, as well as <italic>f</italic> indicates the function to be improved.</p>
<p>To improve the efficiency of the BSA, the IBSA is derived by the use of oppositional based learning (OBL) concepts. Each nature inspired meta-heuristic algorithm selects the first parameter arbitrarily as the candidate solution. Usually, the random population selection method follows a uniform distribution system. As the learning algorithm follows the black box method and does not need any background data it starts enhancing the candidate solution to attain optimal results until predetermined condition isn&#x0027;t attained. The efficacy of this algorithm is confined to amount of time taken by validating all candidate solutions within the searching region to attain nearby optimum solutions as global optimal. To achieve global optimal all near optimum solutions have to be examined. Therefore, finding of nearby optimum solution as an early guess of parameter which isn&#x0027;t suitable inside the searching region.</p>
<p>Moreover, to increase the exploration ability within the searching region, assume opposite case concurrently with early guesses, next the probability of achieving a nearby optimum solution to global optimal rises [<xref ref-type="bibr" rid="ref-22">22</xref>]. To improve the exploration capacity and evade earlier convergence in local minimal, a novel evolutionary approach is developed, selected as space transformation search (STS). As per the STS process, the current searching space is reallocated to a new region for evaluating candidate solutions at two regions concurrently. STS method includes 4 methods such as oppositional based learning (OBL) is one of them. The OBL method is formulated in the following as <italic>X</italic>&#x2009;&#x2208;&#x2009;[<italic>P</italic>, <italic>Q</italic>], whereas X represents a real number and <italic>P</italic>, <italic>Q</italic> denotes the boundary values of search space.<disp-formula id="eqn-23"><label>(23)</label>
<mml:math id="mml-eqn-23" display="block"><mml:msup><mml:mi>X</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>Q</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi></mml:math>
</disp-formula>Whereas, <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:msup><mml:mi>X</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>Q</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo><mml:mo>.</mml:mo></mml:math>
</inline-formula> The IBSA technique derives a fitness function to attain improved classification performance. It determines a positive integer to represent the better performance of the candidate solutions. In this study, the minimization of the classification error rate is considered as the fitness function, as given in <xref ref-type="disp-formula" rid="eqn-24">Eq. (24)</xref>. The optimal solution has a minimal error rate and the worse solution attains an increased error rate.<disp-formula id="eqn-24"><label>(24)</label>
<mml:math id="mml-eqn-24" display="block"><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>E</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Performance Validation</title>
<p>In this section, a comprehensive results analysis of the SSAC-MDC technique take place on benchmark healthcare data. The results are inspected under different instances and IoT devices. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> depicts the <italic>SENS</italic><sub><italic>y</italic></sub> results analysis of the SSAC-MDC technique under distinct instances. The results indicated that the SSAC-MDC technique has provided increased values of <italic>SENS</italic><sub><italic>y</italic></sub>. For instance, with 2000 instances, the SSAC-MDC technique has obtained maximum <italic>SENS</italic><sub><italic>y</italic></sub> of 0.9703 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have reached to minimum <italic>SENS</italic><sub><italic>y</italic></sub> of 0.9260, 0.8790, 0.8320, 0.9330, and 0.9478 respectively. <xref ref-type="table" rid="table-1">Tab. 1</xref> offers a brief comparison study of the classification results under varying instance counts.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title><italic>Sens</italic><sub><italic>y</italic></sub> analysis of SSAC-MDC technique with existing manners</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-3.png"/>
</fig>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Results analysis of existing and proposed SSAC-MDC method</title></caption>
<table><colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">No. of instances</th>
<th align="left">2000</th>
<th align="left">4000</th>
<th align="left">6000</th>
<th align="left">8000</th>
<th align="left">10000</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" colspan="6">Sensitivity</td>
</tr>
<tr>
<td align="left">KNN model</td>
<td align="left">0.9260</td>
<td align="left">0.8840</td>
<td align="left">0.9320</td>
<td align="left">0.9240</td>
<td align="left">0.9360</td>
</tr>
<tr>
<td align="left">Na&#x00EF;ve Bayes</td>
<td align="left">0.8790</td>
<td align="left">0.8460</td>
<td align="left">0.8640</td>
<td align="left">0.8860</td>
<td align="left">0.8910</td>
</tr>
<tr>
<td align="left">SVM algorithm</td>
<td align="left">0.8320</td>
<td align="left">0.8240</td>
<td align="left">0.8390</td>
<td align="left">0.8240</td>
<td align="left">0.8420</td>
</tr>
<tr>
<td align="left">Decision tree</td>
<td align="left">0.9330</td>
<td align="left">0.9230</td>
<td align="left">0.9360</td>
<td align="left">0.9690</td>
<td align="left">0.9600</td>
</tr>
<tr>
<td align="left">EEPSOC-ANN</td>
<td align="left">0.9478</td>
<td align="left">0.9497</td>
<td align="left">0.9563</td>
<td align="left">0.9723</td>
<td align="left">0.9786</td>
</tr>
<tr>
<td align="left">SSAC-MDC</td>
<td align="left">0.9703</td>
<td align="left">0.9754</td>
<td align="left">0.9833</td>
<td align="left">0.9909</td>
<td align="left">0.9978</td>
</tr>
<tr>
<td align="left" colspan="6">Specificity</td>
</tr>
<tr>
<td align="left">KNN model</td>
<td align="left">0.8420</td>
<td align="left">0.8610</td>
<td align="left">0.8730</td>
<td align="left">0.8830</td>
<td align="left">0.8930</td>
</tr>
<tr>
<td align="left">Na&#x00EF;ve Bayes</td>
<td align="left">0.8340</td>
<td align="left">0.8360</td>
<td align="left">0.8690</td>
<td align="left">0.8210</td>
<td align="left">0.8640</td>
</tr>
<tr>
<td align="left">SVM algorithm</td>
<td align="left">0.8020</td>
<td align="left">0.8210</td>
<td align="left">0.8340</td>
<td align="left">0.7840</td>
<td align="left">0.8430</td>
</tr>
<tr>
<td align="left">Decision tree</td>
<td align="left">0.9260</td>
<td align="left">0.9120</td>
<td align="left">0.9240</td>
<td align="left">0.8860</td>
<td align="left">0.9040</td>
</tr>
<tr>
<td align="left">EEPSOC-ANN</td>
<td align="left">0.9432</td>
<td align="left">0.9349</td>
<td align="left">0.9487</td>
<td align="left">0.9240</td>
<td align="left">0.9238</td>
</tr>
<tr>
<td align="left">SSAC-MDC</td>
<td align="left">0.9619</td>
<td align="left">0.9557</td>
<td align="left">0.9698</td>
<td align="left">0.9673</td>
<td align="left">0.9523</td>
</tr>
<tr>
<td align="left" colspan="6">Accuracy</td>
</tr>
<tr>
<td align="left">KNN model</td>
<td align="left">0.8940</td>
<td align="left">0.9130</td>
<td align="left">0.8760</td>
<td align="left">0.8640</td>
<td align="left">0.8930</td>
</tr>
<tr>
<td align="left">Na&#x00EF;ve Bayes</td>
<td align="left">0.7680</td>
<td align="left">0.7860</td>
<td align="left">0.7780</td>
<td align="left">0.8010</td>
<td align="left">0.8240</td>
</tr>
<tr>
<td align="left">SVM algorithm</td>
<td align="left">0.7340</td>
<td align="left">0.7767</td>
<td align="left">0.7560</td>
<td align="left">0.7840</td>
<td align="left">0.8160</td>
</tr>
<tr>
<td align="left">Decision tree</td>
<td align="left">0.9160</td>
<td align="left">0.9240</td>
<td align="left">0.9040</td>
<td align="left">0.9320</td>
<td align="left">0.9280</td>
</tr>
<tr>
<td align="left">EEPSOC-ANN</td>
<td align="left">0.9349</td>
<td align="left">0.9430</td>
<td align="left">0.9348</td>
<td align="left">0.9486</td>
<td align="left">0.9420</td>
</tr>
<tr>
<td align="left">SSAC-MDC</td>
<td align="left">0.9540</td>
<td align="left">0.9641</td>
<td align="left">0.9555</td>
<td align="left">0.9781</td>
<td align="left">0.9811</td>
</tr>
<tr>
<td align="left" colspan="6">F-Score</td>
</tr>
<tr>
<td align="left">KNN model</td>
<td align="left">0.9240</td>
<td align="left">0.9030</td>
<td align="left">0.9240</td>
<td align="left">0.9140</td>
<td align="left">0.9090</td>
</tr>
<tr>
<td align="left">Na&#x00EF;ve Bayes</td>
<td align="left">0.8560</td>
<td align="left">0.8440</td>
<td align="left">0.8720</td>
<td align="left">0.8460</td>
<td align="left">0.8370</td>
</tr>
<tr>
<td align="left">SVM algorithm</td>
<td align="left">0.8120</td>
<td align="left">0.8240</td>
<td align="left">0.8640</td>
<td align="left">0.8040</td>
<td align="left">0.8190</td>
</tr>
<tr>
<td align="left">Decision tree</td>
<td align="left">0.9760</td>
<td align="left">0.9360</td>
<td align="left">0.9320</td>
<td align="left">0.9270</td>
<td align="left">0.9330</td>
</tr>
<tr>
<td align="left">EEPSOC-ANN</td>
<td align="left">0.9814</td>
<td align="left">0.9530</td>
<td align="left">0.9467</td>
<td align="left">0.9452</td>
<td align="left">0.9521</td>
</tr>
<tr>
<td align="left">SSAC-MDC</td>
<td align="left">0.9980</td>
<td align="left">0.9809</td>
<td align="left">0.9765</td>
<td align="left">0.9679</td>
<td align="left">0.9700</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The comparative <italic>SPEC</italic><sub><italic>y</italic></sub> analysis of the SSAC-MDC technique under distinct instances is demonstrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref> and the experimental values portrayed that the SSAC-MDC technique has accomplished maximum performance. For instance, with 2000 instances, the SSAC-MDC technique has attained higher <italic>SPEC</italic><sub><italic>y</italic></sub> of 0.9619 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have achieved lower <italic>SPEC</italic><sub><italic>y</italic></sub> of 0.8420, 0.8340, 0.8020, 0.9260, and 0.9432 respectively. Moreover, with 5000 instances, the SSAC-MDC technique has accomplished maximum <italic>SPEC</italic><sub><italic>y</italic></sub> of 0.9523 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have reached to reduced <italic>SPEC</italic><sub><italic>y</italic></sub> of 0.8930, 0.8640, 0.8430, 0.9040, and 0.9238 respectively.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title><italic>Spec</italic><sub><italic>y</italic></sub> analysis of SSAC-MDC technique with existing manners</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-4.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> portrays the <italic>ACC</italic><sub><italic>y</italic></sub> results analysis of the SSAC-MDC technique under distinct instances. The results specified that the SSAC-MDC technique has delivered improved values of <italic>ACC</italic><sub><italic>y</italic></sub>. For instance, with 2000 instances, the SSAC-MDC technique has gotten supreme <italic>ACC</italic><sub><italic>y</italic></sub> of 0.9540 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have got inferior <italic>ACC</italic><sub><italic>y</italic></sub> of 0.8940, 0.7680, 0.7340, 0.9160, and 0.9349 respectively. Furthermore, with 5000 instances, the SSAC-MDC technique has extended raised <italic>ACC</italic><sub><italic>y</italic></sub> of 0.9811 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have revealed lessened <italic>ACC</italic><sub><italic>y</italic></sub> of 0.8930, 0.8240, 0.8160, 0.9280, and 0.9420 respectively.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title><italic>Acc</italic><sub><italic>y</italic></sub> analysis of SSAC-MDC technique with existing manners</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-5.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> describes the <italic>F</italic><sub><italic>SCORE</italic></sub> analysis of the SSAC-MDC technique under dissimilar instances. The results pointed out that the SSAC-MDC technique has reported maximum values of <italic>F</italic><sub><italic>SCORE</italic></sub>. For instance, with 2000 instances, the SSAC-MDC technique has offered improved <italic>F</italic><sub><italic>SCORE</italic></sub> of 0.9980 whereas the KNN, NB, SVM, DT, and EEPSOC-ANN techniques have reached to minimum <italic>F</italic><sub><italic>SCORE</italic></sub> of 0.9240, 0.8560, 0.8120, 0.9760, and 0.9814 respectively. The accuracy results analysis of the SSAC-MDC technique on the test medical data is portrayed in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The results showcased that the SSAC-MDC technique has resulted in increased training and validation accuracies. It is observable that the SSAC-MDC technique has the ability to attain increased validation accuracy over training accuracy.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title><italic>F</italic><sub><italic>score</italic></sub> analysis of SSAC-MDC technique with existing manners</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-6.png"/>
</fig>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Accuracy graph analysis of SSAC-MDC technique</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-7.png"/>
</fig>
<p>The loss results analysis of the SSAC-MDC technique on the test medical data is offered in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The figure indicated that the SSAC-MDC technique has gained reduced training and validation losses. It is noticeable that the SSAC-MDC technique has the capability of accomplishing decreased validation loss over training loss.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Loss graph analysis of SSAC-MDC approaches</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_25336-fig-8.png"/>
</fig>
<p>Lastly, a TEC analysis of the SSAC-MDC technique with recent methods is provided in <xref ref-type="table" rid="table-2">Tab. 2</xref> under the distinct number of IoT sensors. The experimental results stated that the SSAC-MDC technique has gained minimal TEC over the other techniques. For instance, with 100 IoT devices, the SSAC-MDC technique has gained a lower TEC of 37&#x0025; whereas the EEPSOC, ABC, GWO, and ACO techniques have obtained higher TEC of 46&#x0025;, 58&#x0025;, 61&#x0025;, and 67&#x0025; respectively. These results analysis portrayed that the SSAC-MDC technique has the ability to attain maximum energy efficiency and medical data classification performance.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparative total energy consumption (&#x0025;) analysis of SSAC-MDC method</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">IoT sensors</th>
<th align="left">SSAC-MDC</th>
<th align="left">EEPSOC</th>
<th align="left">ABC</th>
<th align="left">GWO</th>
<th align="left">ACO</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">100</td>
<td align="left">37.00</td>
<td align="left">46.00</td>
<td align="left">58.00</td>
<td align="left">61.00</td>
<td align="left">67.00</td>
</tr>
<tr>
<td align="left">200</td>
<td align="left">42.00</td>
<td align="left">52.00</td>
<td align="left">62.00</td>
<td align="left">69.00</td>
<td align="left">74.00</td>
</tr>
<tr>
<td align="left">300</td>
<td align="left">48.00</td>
<td align="left">59.00</td>
<td align="left">67.00</td>
<td align="left">73.00</td>
<td align="left">77.00</td>
</tr>
<tr>
<td align="left">400</td>
<td align="left">53.00</td>
<td align="left">64.00</td>
<td align="left">72.00</td>
<td align="left">76.00</td>
<td align="left">81.00</td>
</tr>
<tr>
<td align="left">500</td>
<td align="left">59.00</td>
<td align="left">69.00</td>
<td align="left">78.00</td>
<td align="left">83.00</td>
<td align="left">84.00</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this study, an effective SSAC-MDC technique has been presented to accomplish energy efficiency and disease diagnosis in the IoT environment. The proposed SSAC-MDC technique operates on three major phases namely data collection, SSAC based cluster construction, and medical data classification. During medical data classification process, the collected medical data are examined in different ways to determine the existence of the diseases. The medical data classification module involves data pre-processing, AE based classification, and IBSA based parameter tuning. For improvising the classifier results of the AE model, the parameter tuning process takes place using IBSA technique. For assessing the improved efficiency of the SSAC-MDC technique, a series of experimental analysis were performed and the comparative results highlighted the supremacy of the SSAC-MDC technique over the recent methods. In future, the classification results can be improvised by the design of outlier removal and feature selection approaches.</p>
</sec>
</body>
<back>
<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>
<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. A.</given-names> <surname>Basset</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Manogaran</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gamal</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Chang</surname></string-name></person-group>, &#x201C;<article-title>A novel intelligent medical decision support model based on soft computing and IoT</article-title>,&#x201D; <source>IEEE Internet Things Journal</source>, vol. <volume>7</volume>, no. <issue>5</issue>, pp. <fpage>4160</fpage>&#x2013;<lpage>4170</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. F.</given-names> <surname>Subahi</surname></string-name></person-group>, &#x201C;<article-title>Edge-based IoT medical record system: Requirements, recommendations and conceptual design</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>94150</fpage>&#x2013;<lpage>94159</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Asghari</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Rahmani</surname></string-name> and <string-name><given-names>H. H. S.</given-names> <surname>Javadi</surname></string-name></person-group>, &#x201C;<article-title>A medical monitoring scheme and health-medical service composition model in cloud-based IoT platform</article-title>,&#x201D; <source>Transactions on Emerging Telecommunications Technologies</source>, vol. <volume>30</volume>, no. <issue>6</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>25</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. A.</given-names> <surname>Alsuhibany</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Abdel-Khalek</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Algarni</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Fayomi</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Ensemble of Deep Learning Based Clinical Decision Support System for Chronic Kidney Disease Diagnosis in Medical Internet of Things Environment</article-title>,&#x201D; <source>Computational Intelligence and Neuroscience</source>, vol. <volume>2021</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Ani</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Krishna</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Anju</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Aslam</surname></string-name> and <string-name><given-names>O. S.</given-names> <surname>Deepa</surname></string-name></person-group>, &#x201C;<article-title>Iot based patient monitoring and diagnostic prediction tool using ensemble classifier</article-title>,&#x201D; in <conf-name>2017 Int. Conf. on Advances in Computing, Communications and Informatics (ICACCI)</conf-name>, <conf-loc>Udupi</conf-loc>, pp. <fpage>1588</fpage>&#x2013;<lpage>1593</lpage>, <year>2017</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>A.</given-names> <surname>Chandy</surname></string-name></person-group>, &#x201C;<article-title>A review on IoT based medical imaging technology for healthcare applications</article-title>,&#x201D; <source>Journal of Innovative Image Processing</source>, vol. <volume>1</volume>, no. <issue>1</issue>, pp. <fpage>51</fpage>&#x2013;<lpage>60</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Ganesan</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Sivakumar</surname></string-name></person-group>, &#x201C;<article-title>IoT based heart disease prediction and diagnosis model for healthcare using machine learning models</article-title>,&#x201D; in <conf-name>2019 IEEE Int. Conf. on System, Computation, Automation and Networking (ICSCAN)</conf-name>, <conf-loc>Pondicherry, India</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lan</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>An IoT-based framework of webvr visualization for medical big data in connected health</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>173866</fpage>&#x2013;<lpage>173874</lpage>, <year>2019</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>A.</given-names> <surname>Das</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rad</surname></string-name>, <string-name><given-names>K. K. R.</given-names> <surname>Choo</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Nouhi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lish</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Distributed machine learning cloud teleophthalmology IoT for predicting AMD disease progression</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>93</volume>, pp. <fpage>486</fpage>&#x2013;<lpage>498</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N. A. A.</given-names> <surname>Abdellah</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Thangadurai</surname></string-name></person-group>, &#x201C;<article-title>Real time application of iot for the agriculture in the field along with machine learning algorithm</article-title>,&#x201D; in <conf-name>2020 Int. Conf. on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)</conf-name>, <conf-loc>Khartoum, Sudan</conf-loc>, pp. <fpage>1</fpage>&#x2013;p, <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>P.</given-names> <surname>Verma</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Sood</surname></string-name></person-group>, &#x201C;<article-title>Cloud-centric IoT based disease diagnosis healthcare framework</article-title>,&#x201D; <source>Journal of Parallel and Distributed Computing</source>, vol. <volume>116</volume>, pp. <fpage>27</fpage>&#x2013;<lpage>38</lpage>, <year>2018</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>S.</given-names> <surname>Akhbarifar</surname></string-name>, <string-name><given-names>H. H. S.</given-names> <surname>Javadi</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Rahmani</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Hosseinzadeh</surname></string-name></person-group>, &#x201C;<article-title>A secure remote health monitoring model for early disease diagnosis in cloud-based IoT environment</article-title>,&#x201D; <source>Personal and Ubiquitous Computing</source>, pp. 1&#x2013;17. <year>2020</year>. <uri>https://doi.org/10.1007/s00779-020-01475-3</uri>.</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>H.</given-names> <surname>Sattar</surname></string-name>, <string-name><given-names>I. S.</given-names> <surname>Bajwa</surname></string-name> and <string-name><given-names>U. F.</given-names> <surname>Shafi</surname></string-name></person-group>, &#x201C;<article-title>An IoT assisted clinical decision support system for wound healthcare monitoring</article-title>,&#x201D; <source>Computational Intelligence</source>, <year>2021</year>. <uri>https://doi.org/10.1111/coin.12482</uri>.</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>F.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M. I.</given-names> <surname>Uddin</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Alyami</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Enabling clustering for privacy-aware data dissemination based on medical healthcare-IoTs (MH-IoTs) for wireless body area network</article-title>,&#x201D; <source>Journal of Healthcare Engineering</source>, vol. <volume>2020</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2020</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>P. M.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Lokesh</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Varatharajan</surname></string-name>, <string-name><given-names>G. C.</given-names> <surname>Babu</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Parthasarathy</surname></string-name></person-group>, &#x201C;<article-title>Cloud and IoT based disease prediction and diagnosis system for healthcare using fuzzy neural classifier</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>86</volume>, pp. <fpage>527</fpage>&#x2013;<lpage>534</lpage>, <year>2018</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>P.</given-names> <surname>Verma</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Sood</surname></string-name></person-group>, &#x201C;<article-title>Fog assisted-IoT enabled patient health monitoring in smart homes</article-title>,&#x201D; <source>IEEE Internet Things Journal</source>, vol. <volume>5</volume>, no. <issue>3</issue>, pp. <fpage>1789</fpage>&#x2013;<lpage>1796</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Singh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rani</surname></string-name></person-group>, &#x201C;<article-title>A novel nature-inspired algorithm for optimization: Squirrel search algorithm</article-title>,&#x201D; <source>Swarm and Evolutionary Computation</source>, vol. <volume>44</volume>, pp. <fpage>148</fpage>&#x2013;<lpage>175</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Du</surname></string-name></person-group>, &#x201C;<article-title>An improved squirrel search algorithm for global function optimization</article-title>,&#x201D; <source>Algorithms</source>, vol. <volume>12</volume>, no. <issue>4</issue>, pp. <fpage>80</fpage>, <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>M. A.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Algarni</surname></string-name></person-group>, &#x201C;<article-title>A healthcare monitoring system for the diagnosis of heart disease in the IoMT cloud environment using MSSO-ANFIS</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>122259</fpage>&#x2013;<lpage>122269</lpage>, <year>2020</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>A.</given-names> <surname>Lucas</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Iliadis</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Molina</surname></string-name> and <string-name><given-names>A. K.</given-names> <surname>Katsaggelos</surname></string-name></person-group>, &#x201C;<article-title>Using deep neural networks for inverse problems in imaging: Beyond analytical methods</article-title>,&#x201D; <source>IEEE Signal Processing Magazine</source>, vol. <volume>35</volume>, no. <issue>1</issue>, pp. <fpage>20</fpage>&#x2013;<lpage>36</lpage>, <year>2018</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>A. T.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Hu</surname></string-name> and <string-name><given-names>V. N.</given-names> <surname>Katsikis</surname></string-name></person-group>, &#x201C;<article-title>Quantum beetle antennae search: A novel technique for the constrained portfolio optimization problem</article-title>,&#x201D; <source>Science China Information Science</source>, vol. <volume>64</volume>, no. <issue>5</issue>, pp. <fpage>152204</fpage>, <year>2021</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>N.</given-names> <surname>Panda</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Majhi</surname></string-name></person-group>, &#x201C;<article-title>Oppositional salp swarm algorithm with mutation operator for global optimization and application in training higher order neural networks</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, <year>2021</year>. <uri>http://doi.org/10.1007/s11042-020-10304-x</uri>.</mixed-citation></ref>
</ref-list>
</back>
</article>