<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">31613</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.031613</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Artificial Intelligence Based Threat Detection in Industrial Internet of&#x00A0;Things&#x00A0;Environment</article-title>
<alt-title alt-title-type="left-running-head">Artificial Intelligence Based Threat Detection in Industrial Internet of Things Environment</alt-title>
<alt-title alt-title-type="right-running-head">Artificial Intelligence Based Threat Detection in Industrial Internet of Things Environment</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alruwaili</surname><given-names>Fahad F.</given-names></name><email>alruwaili@su.edu.sa</email></contrib>
<aff id="aff-1"><institution>College of Computing and Information Technology, Shaqra University</institution>, <addr-line>Sharqa</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Fahad F. Alruwaili. Email: <email>alruwaili@su.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-07-25"><day>25</day>
<month>07</month>
<year>2022</year></pub-date>
<volume>73</volume>
<issue>3</issue>
<fpage>5809</fpage>
<lpage>5824</lpage>
<history>
<date date-type="received"><day>22</day><month>4</month><year>2022</year></date>
<date date-type="accepted"><day>07</day><month>6</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Alruwaili</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Alruwaili</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_31613.pdf"></self-uri>
<abstract>
<p>Internet of Things (IoT) is one of the hottest research topics in recent years, thanks to its dynamic working mechanism that integrates physical and digital world into a single system. IoT technology, applied in industries, is termed as Industrial IoT (IIoT). IIoT has been found to be highly susceptible to attacks from adversaries, based on the difficulties observed in IIoT and its increased dependency upon internet and communication network. Intentional or accidental attacks on these approaches result in catastrophic effects like power outage, denial of vital health services, disruption to civil service, etc., Thus, there is a need exists to develop a vibrant and powerful for identification and mitigation of security vulnerabilities in IIoT. In this view, the current study develops an AI-based Threat Detection and Classification model for IIoT, abbreviated as AITDC-IIoT model. The presented AITDC-IIoT model initially pre-processes the input data to transform it into a compatible format. In addition, Whale Optimization Algorithm based Feature Selection (WOA-FS) is used to elect the subset of features. Moreover, Cockroach Swarm Optimization (CSO) is employed with Random Vector Functional Link network (RVFL) technique for threat classification. Finally, CSO algorithm is applied to appropriately adjust the parameters related to RVFL model. The performance of the proposed AITDC-IIoT model was validated under benchmark datasets. The experimental results established the supremacy of the proposed AITDC-IIoT model over recent approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Security</kwd>
<kwd>industrial internet of things</kwd>
<kwd>threat detection</kwd>
<kwd>artificial intelligence</kwd>
<kwd>feature selection</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Internet of Things (IoT) has managed to pervade numerous domains from home automation to industries with crucial frameworks. The contributions of IoT are wide enough started from attaining the final cases or complementing/exchanging the processes involved in industrial control systems. The extensive applicability of IoT gadgets allows the industrial technologies to flourish, in industries with less technical maturity. Few appropriate instances are linked with exploitation of oil and electricity production while both the domains are straightforwardly linked with national cyberdefence [<xref ref-type="bibr" rid="ref-1">1</xref>]. Industrial Internet of Things (IIoT) combines multiple players such as sensors, gadgets, and physical machineries with internet. Then, it utilizes software to conduct deep analytics and convert huge volumes of both structured and unstructured data into powerful insights and information [<xref ref-type="bibr" rid="ref-2">2</xref>]. IIoT emphasizes the application of IoT in manufacturing zones since there is a growing interest among researchers to involve Machine-to-Machine (M2&#x2005;M) transmission, big data, and Machine Learning (ML) in industry settings. IoT can also be applied in some other domains such as linking wastewater systems and manufacturing of robots, flow gauges, electric meters and other connected systems, and industrial gadgets. With the incorporation of IIoT, institutions as well as manufacturing hubs gain high efficiency and dependability upon its works [<xref ref-type="bibr" rid="ref-3">3</xref>]. Since IoT is capable of linking multiple gadgets with internet, it allows the identification of distinct threats to perform anomalous actions. There is an increasing number of loopholes and susceptibilities found in the protocol utilized by IIoT structure. If it encounters risks, sophisticated attacks can be made at IIoT environment using multiple methods [<xref ref-type="bibr" rid="ref-4">4</xref>]. The intentions of an attacker are multitude in nature such as gaining access to appropriate data, money theft, and source corruption [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>IoT gadgets have special features with regard to transmission. So, whenever there is an attack made, it tends to provoke the decentralized assaults on any kind of structures [<xref ref-type="bibr" rid="ref-6">6</xref>]. These are the difficulties faced in designing an identification algorithm for IoT which are well known in traditional networks [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>]. The main goal of machine learning technique is to empower the technologies so that it learns and performs estimation based on the information scheduled earlier. Though the usage of ML in identifying anomalous conduct is an established process, intruder identification domain has been mostly untouched [<xref ref-type="bibr" rid="ref-9">9</xref>]. In conventional techniques, anomaly recognition has been performed by statistical methodologies. Therefore, the increasing penetration of ML methods has unlocked new probabilities for the identification of outlier information, thanks to the accessibility of huge volume of information which might be leveraged using ML methods. In this perspective, such ML methods provide an alluring viewpoint to be applied in IoT application zones. It is challenging to make use of stationary models in this regard [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Aboelwafa&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-11">11</xref>] proposed a novel attack detection methodology via Autoencoder (AE). The study exploited the sensor data in correlation with time and space to sequentially recognize the fabricated dataset. Furthermore, the fabricated dataset is refined by Denoising AE (DAE). The DAE dataset was cleaned in an efficient manner and produced clean datasets from the corrupted (attacked) information. Hassan&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>] developed a down sampler-encoder-based collective dataset generator. This model was to ensure the effective collection of real distribution of the attack model for large-scale IIoT attack surfaces. The presented downsampler-based data generator is upgraded simultaneously and confirmed at the time of training Deep Neural Network (DNN) discriminators so as to ensure robustness.</p>
<p>Qureshi&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] presented a secure and novel architecture for identification of security threats in RPL-based IoT and IIoT systems. The presented architecture possesses the ability to identify Version number, HELLO-Flood, Blackhole, and Sinkhole attacks. Hassan&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-14">14</xref>] enhanced the reliability of IIoT systems using a scalable and reliable cyberattack recognition method i.e., Supervisory Control and Data Acquisition (SCADA) technique. To be specific, an ensemble-learning method, related to the integration of Random Subspace (RS) learning model using Random Tree (RT), was presented to identify SCADA cyberattacks o through network traffic from SCADA-related IIoT architecture. The researchers in the literature [<xref ref-type="bibr" rid="ref-15">15</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>] developed a detection module based on Stacked Variation Auto-Encoder (VAE) with Convolution Neural Network (CNN). This model has the capability to learn about hidden architecture of the scheme&#x2019;s activity and reveal its ransomware behaviour. Furthermore, a data augmentation technique was proposed based on VAE to generate a novel dataset that can be utilized in training a system and to improve the generalized abilities of the presented method.</p>
<p>The current study develops an AI-based Threat Detection and Classification model for IIoT, named AITDC-IIoT model. The presented AITDC-IIoT model initially pre-processes the input data and transforms it into a compatible format. Then, Whale Optimization Algorithm-based Feature Selection (WOA-FS) model has been involved to elect the subset of features. Moreover, Cockroach Swarm Optimization (CSO) is employed with Random Vector Functional Link network (RVFL) model for classification of threats. Finally, CSO algorithm is applied to appropriately adjust the parameters involved in RVFL model. The performance of the proposed AITDC-IIoT model was validated using benchmark datasets.</p>
</sec>
<sec id="s2"><label>2</label><title>The Proposed Model</title>
<p>In this study, a new AITDC-IIoT model has been developed for proficient threat detection and classification using IIoT. The presented AITDC-IIoT model initially pre-processes the input data to convert it into a compatible format. Followed by, WOA-FS model is applied to elect the subset of features. At last, CSO is employed with RVFL model for classification of threats. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> depicts the overall block diagram of AITDC-IIoT technique.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Block diagram of AITDC-IIoT technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-1.png"/></fig>
<sec id="s2_1"><label>2.1</label><title>Feature Selection Module</title>
<p>In order to elect the features, WOA is applied in this study. In order to explore the most number of possible solutions for the problem from searching space, whale individuals are utilized from the community [<xref ref-type="bibr" rid="ref-20">20</xref>]. Three functions are applied in WOA such as hunting, encircling, and shrinking. During exploitation stage, both surrounding and shrinking functions are utilized. However, under exploration stage, the hunting function is utilized. To arrive at the optimal solution for Dimension Optimization problem (DO), the processes of <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> individual from <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> generation are utilized. Following processes are involved in WOA.</p>
<p>Encircling Operation
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>B</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula></p>
<p>Shrinking Operation</p>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula>
<p>Hunting Operation</p>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>B</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula>
<p>The arbitrary number in the range of [0 1] is explained through <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, The existing number of iterations is demonstrated as <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>c</mml:mi></mml:math></inline-formula>, maximum number of iterations is explained as <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> and the positive vector of the optimum solution is denoted by <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. In order to define the logarithmical spiral shape, a constant <italic>e</italic> is utilized, and the arbitrary number from &#x2212;1 and 1 is demonstrated as <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>t</mml:mi></mml:math></inline-formula>. The arbitrary position vector <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is chosen from the existing population. Three distances are subsequently found. At first, the primary distance is at <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:math></inline-formula> while the secondary distance is at <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> and the tertiary distance is at <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mn>2</mml:mn><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula>. Based on the probability <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, three <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-3">(3)</xref> are applied in WOA. The whale individuals are upgraded in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, if <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:mo>|</mml:mo><mml:mi>B</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, then the individuals are adjusted by <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, once <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:mo>|</mml:mo><mml:mi>B</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> is utilized for updating the individuals, if <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0.5.</mml:mn></mml:math></inline-formula></p>
<p>In WOA, the whale moves from searching space to adapt to the position pointed in the space which is named as &#x2018;constant space&#x2019;. The transformation can be done using <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>S</mml:mi></mml:math></inline-formula>-shaped transfer function. The possibility of altering the location vector element from <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mn>0</mml:mn></mml:math></inline-formula> to 1 is adapted by the transfer function. So, it forces the searching agent to move into a binary space. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts the flowchart of WOA.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>WOA Flowchart</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-2.png"/></fig>
<p>The <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>S</mml:mi></mml:math></inline-formula>-shaped function is updated as demonstrated herewith.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mi>v</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext mathvariant="italic">otherwise</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Threat Classification Module</title>
<p>Once the features are selected, they are fed as input in RVFL model for classification purpose. RVFL model depends upon Single Layer Feed Forward Network (SLFN) [<xref ref-type="bibr" rid="ref-21">21</xref>]. In this method, the weights are arbitrarily initialized based on the node and weight is tuned with no iteration. Consider that RVFL network contains <italic>J</italic> improvement node and <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the resultant weight, whereas <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mo>=</mml:mo><mml:mi>J</mml:mi><mml:mo>+</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> . The activation function for <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> trained instance is determined as <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> on the <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msup><mml:mrow><mml:mi>&#x2113;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> improvement layer to <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:mi>&#x2113;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:math></inline-formula>. Here, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><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>a</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <italic>b</italic> correspond to weight as well as bias correspondingly. Accordingly, Hessian matrix is assumed as <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>U</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mo>&#x22EF;</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>U</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> as follows.
<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The problem equation for RVFL is stated as
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>V</mml:mi><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula>whereas <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mi>H</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>U</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> refers to the fixed positive constants. At this point, the gradient of <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref> is defined in terms of <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>. Additionally, the gradient equates to <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mn>0</mml:mn></mml:math></inline-formula> to determine the solution as follows.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mi>V</mml:mi><mml:mo>+</mml:mo><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mi>y</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula></p>
<p>At novel instance <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>x</mml:mi></mml:math></inline-formula>, the regressor evaluated for RVFL is as follows.
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math></disp-formula>whereas <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22EF;</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>G</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></p>
</sec>
<sec id="s2_3"><label>2.3</label><title>Parameter Optimization Module</title>
<p>In this final stage, CSO algorithm is applied to appropriately adjust the parameters related to RVFL model [<xref ref-type="bibr" rid="ref-22">22</xref>&#x2013;<xref ref-type="bibr" rid="ref-25">25</xref>]. The CSO model imitates cockroach behavior i.e., dispersing, ruthless, chase-swarming behaviors [<xref ref-type="bibr" rid="ref-26">26</xref>]. In <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>D</mml:mi></mml:math></inline-formula>-dimension searching region <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, a cockroach cluster consists of <italic>N</italic> cockroach individuals while <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>i</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> individual characterizes the <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>D</mml:mi></mml:math></inline-formula>-dimension vector <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and the individual position is the best possible solution.</p>
<p>Chase-Swarming Behavior:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mi>w</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mo>.</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2260;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>w</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mo>.</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In this equation, <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>w</mml:mi></mml:math></inline-formula>indicates the inertia weight i.e., a constant step indicates a fixed value whereas rand denotes an arbitrary value that lies in the interval of <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>O</mml:mi><mml:mi>p</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo>&#x223C;</mml:mo></mml:mrow></mml:msub><mml:mi>j</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">visual</mml:mtext></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mi>N</mml:mi><mml:mo>.</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>O</mml:mi><mml:mi>p</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Whereas opt indicates the optimal value.</p>
<p>Dispersion Behaviour:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">r</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></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:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p>Now rand(l, D) represents the <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>D</mml:mi></mml:math></inline-formula>-dimension vector that is fixed to some extent.</p>
<p>Ruthless Behavior
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>X</mml:mi><mml:mrow><mml:mtext>k</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mi>g</mml:mi></mml:math></disp-formula></p>
<p>In this formula, <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>k</mml:mi></mml:math></inline-formula> denotes an arbitrary value within <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the global optimal location. The steps involved in Continual space Cockroach Swarm Optimization (CCSO) method are shown below.
<list list-type="order">
<list-item><p>Initialize cockroach swarm with uniform distribution of arbitrary numbers and set value for each parameter.</p></list-item>
<list-item><p>Search <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> using the <xref ref-type="disp-formula" rid="eqn-11">Eqs. (11)</xref> and <xref ref-type="disp-formula" rid="eqn-12">(12)</xref>.</p></list-item>
<list-item><p>Implement chase-swarming by <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref></p></list-item>
<list-item><p>Implement dispersion behaviour by <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref></p></list-item>
<list-item><p>Implement ruthless behavior by <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref></p></list-item>
<list-item><p>Repeat the loop until the end condition is obtained.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Experimental Validation</title>
<p>In this section, the proposed AITDC-IIoT model was experimentally validated using N-BaIoT dataset [<xref ref-type="bibr" rid="ref-27">27</xref>]. The dataset holds 76,200 samples under 9 class labels which are given in <xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Sample class labels</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Class labels</th>
<th align="left">Categories</th>
<th align="left">No. of instances (Attack)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">C-1</td>
<td align="left">Benign</td>
<td align="left">49500</td>
</tr>
<tr>
<td align="left">C-2</td>
<td align="left">Ack</td>
<td align="left">3400</td>
</tr>
<tr>
<td align="left">C-3</td>
<td align="left">Scan</td>
<td align="left">3300</td>
</tr>
<tr>
<td align="left">C-4</td>
<td align="left">SYN</td>
<td align="left">3300</td>
</tr>
<tr>
<td align="left">C-5</td>
<td align="left">UDP</td>
<td align="left">3400</td>
</tr>
<tr>
<td align="left">C-6</td>
<td align="left">UDP Plain</td>
<td align="left">3300</td>
</tr>
<tr>
<td align="left">C-7</td>
<td align="left">Combo</td>
<td align="left">3300</td>
</tr>
<tr>
<td align="left">C-8</td>
<td align="left">Junk</td>
<td align="left">3300</td>
</tr>
<tr>
<td align="left">C-9</td>
<td align="left">TCP</td>
<td align="left">3400</td>
</tr>
<tr>
<td align="left" colspan="2">Total</td>
<td align="left">76200</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> demonstrates the set of confusion matrices generated by the proposed AITDC-IIoT model on test dataset. The figures imply that the proposed AITDC-IIoT model effectively recognized all the nine classes in the applied dataset.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Confusion matrices generated by AITDC-IIoT technique for (a) entire dataset, (b) 70&#x0025; of TR dataset, and (c) 30&#x0025; of TS dataset</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-3.png"/></fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> illustrates the results offered by AITDC-IIoT model on threat classification in IIoT environment. The results indicate that the proposed AITDC-IIoT model gained significant results under all the classes. For instance, with entire dataset, the proposed AITDC-IIoT model categorized benign classes with <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and Mathew Correlation Coefficient (MCC) values such as 99.28&#x0025;, 99.87&#x0025;, 99.02&#x0025;, 99.44&#x0025;, and 98.43&#x0025; respectively. Simultaneously, with entire dataset, the AITDC-IIoT method categorized TCP class with <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.82&#x0025;, 97.83&#x0025;, 98.09&#x0025;, 97.96&#x0025;, and 97.86&#x0025; respectively. Concurrently, with 70&#x0025; of TR dataset, the presented AITDC-IIoT approach categorized benign classes with <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.27&#x0025;, 99.87&#x0025;, 99.01&#x0025;, 99.44&#x0025;, and 98.41&#x0025; correspondingly. Meanwhile, with 70&#x0025; of TR dataset, the proposed AITDC-IIoT system categorized TCP class with <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.82&#x0025;, 98.04&#x0025;, 97.91&#x0025;, 97.98&#x0025;, and 97.88&#x0025; respectively. Eventually, with 30&#x0025; of TS dataset, AITDC-IIoT model categorized benign class with <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.83&#x0025;, 97.58&#x0025;, 98.53&#x0025;, 98.05&#x0025;, and 97.96&#x0025; correspondingly.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Results of the analysis of AITDC-IIoT technique under different measures</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Labels</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F-Score</th>
<th align="left">MCC</th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">Entire dataset</td>
</tr>
<tr>
<td align="left">Benign</td>
<td align="left">99.28</td>
<td align="left">99.87</td>
<td align="left">99.02</td>
<td align="left">99.44</td>
<td align="left">98.43</td>
</tr>
<tr>
<td align="left">Ack</td>
<td align="left">99.80</td>
<td align="left">96.85</td>
<td align="left">98.71</td>
<td align="left">97.77</td>
<td align="left">97.67</td>
</tr>
<tr>
<td align="left">Scan</td>
<td align="left">99.80</td>
<td align="left">96.81</td>
<td align="left">98.55</td>
<td align="left">97.67</td>
<td align="left">97.57</td>
</tr>
<tr>
<td align="left">SYN</td>
<td align="left">99.86</td>
<td align="left">97.93</td>
<td align="left">98.76</td>
<td align="left">98.34</td>
<td align="left">98.27</td>
</tr>
<tr>
<td align="left">UDP</td>
<td align="left">99.80</td>
<td align="left">96.67</td>
<td align="left">99.00</td>
<td align="left">97.82</td>
<td align="left">97.72</td>
</tr>
<tr>
<td align="left">UDP Plain</td>
<td align="left">99.82</td>
<td align="left">97.28</td>
<td align="left">98.61</td>
<td align="left">97.94</td>
<td align="left">97.85</td>
</tr>
<tr>
<td align="left">Combo</td>
<td align="left">99.77</td>
<td align="left">96.05</td>
<td align="left">98.67</td>
<td align="left">97.34</td>
<td align="left">97.23</td>
</tr>
<tr>
<td align="left">Junk</td>
<td align="left">99.84</td>
<td align="left">97.54</td>
<td align="left">98.73</td>
<td align="left">98.13</td>
<td align="left">98.05</td>
</tr>
<tr>
<td align="left">TCP</td>
<td align="left">99.82</td>
<td align="left">97.83</td>
<td align="left">98.09</td>
<td align="left">97.96</td>
<td align="left">97.86</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">99.75</td>
<td align="left">97.43</td>
<td align="left">98.68</td>
<td align="left">98.05</td>
<td align="left">97.85</td>
</tr>
<tr>
<td align="center" colspan="6">Training phase (70&#x0025;)</td>
</tr>
<tr>
<td align="left">Benign</td>
<td align="left">99.27</td>
<td align="left">99.87</td>
<td align="left">99.01</td>
<td align="left">99.44</td>
<td align="left">98.41</td>
</tr>
<tr>
<td align="left">Ack</td>
<td align="left">99.79</td>
<td align="left">96.55</td>
<td align="left">98.78</td>
<td align="left">97.65</td>
<td align="left">97.55</td>
</tr>
<tr>
<td align="left">Scan</td>
<td align="left">99.78</td>
<td align="left">96.67</td>
<td align="left">98.35</td>
<td align="left">97.50</td>
<td align="left">97.39</td>
</tr>
<tr>
<td align="left">SYN</td>
<td align="left">99.86</td>
<td align="left">98.08</td>
<td align="left">98.63</td>
<td align="left">98.35</td>
<td align="left">98.28</td>
</tr>
<tr>
<td align="left">UDP</td>
<td align="left">99.81</td>
<td align="left">96.57</td>
<td align="left">99.16</td>
<td align="left">97.85</td>
<td align="left">97.75</td>
</tr>
<tr>
<td align="left">UDP Plain</td>
<td align="left">99.81</td>
<td align="left">97.10</td>
<td align="left">98.48</td>
<td align="left">97.79</td>
<td align="left">97.69</td>
</tr>
<tr>
<td align="left">Combo</td>
<td align="left">99.75</td>
<td align="left">95.59</td>
<td align="left">98.56</td>
<td align="left">97.05</td>
<td align="left">96.94</td>
</tr>
<tr>
<td align="left">Junk</td>
<td align="left">99.84</td>
<td align="left">97.69</td>
<td align="left">98.75</td>
<td align="left">98.22</td>
<td align="left">98.14</td>
</tr>
<tr>
<td align="left">TCP</td>
<td align="left">99.82</td>
<td align="left">98.04</td>
<td align="left">97.91</td>
<td align="left">97.98</td>
<td align="left">97.88</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">99.75</td>
<td align="left">97.35</td>
<td align="left">98.63</td>
<td align="left">97.98</td>
<td align="left">97.78</td>
</tr>
<tr>
<td align="center" colspan="6">Training phase (30&#x0025;)</td>
</tr>
<tr>
<td align="left">Benign</td>
<td align="left">99.83</td>
<td align="left">97.58</td>
<td align="left">98.53</td>
<td align="left">98.05</td>
<td align="left">97.96</td>
</tr>
<tr>
<td align="left">Ack</td>
<td align="left">99.83</td>
<td align="left">97.14</td>
<td align="left">99.00</td>
<td align="left">98.06</td>
<td align="left">97.98</td>
</tr>
<tr>
<td align="left">Scan</td>
<td align="left">99.86</td>
<td align="left">97.57</td>
<td align="left">99.07</td>
<td align="left">98.31</td>
<td align="left">98.24</td>
</tr>
<tr>
<td align="left">SYN</td>
<td align="left">99.80</td>
<td align="left">96.91</td>
<td align="left">98.62</td>
<td align="left">97.76</td>
<td align="left">97.65</td>
</tr>
<tr>
<td align="left">UDP</td>
<td align="left">99.85</td>
<td align="left">97.71</td>
<td align="left">98.89</td>
<td align="left">98.29</td>
<td align="left">98.22</td>
</tr>
<tr>
<td align="left">UDP Plain</td>
<td align="left">99.80</td>
<td align="left">96.99</td>
<td align="left">98.89</td>
<td align="left">97.93</td>
<td align="left">97.83</td>
</tr>
<tr>
<td align="left">Combo</td>
<td align="left">99.82</td>
<td align="left">97.21</td>
<td align="left">98.68</td>
<td align="left">97.94</td>
<td align="left">97.85</td>
</tr>
<tr>
<td align="left">Junk</td>
<td align="left">99.82</td>
<td align="left">97.34</td>
<td align="left">98.50</td>
<td align="left">97.92</td>
<td align="left">97.82</td>
</tr>
<tr>
<td align="left">TCP</td>
<td align="left">99.77</td>
<td align="left">97.59</td>
<td align="left">98.80</td>
<td align="left">98.19</td>
<td align="left">98.00</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">99.83</td>
<td align="left">97.58</td>
<td align="left">98.53</td>
<td align="left">98.05</td>
<td align="left">97.96</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> demonstrates the average threat classification outcomes achieved by the proposed AITDC-IIoT model. Upon entire dataset, AITDC-IIoT model achieved average <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.75&#x0025;, 97.43&#x0025;, 98.68&#x0025;, 98.05&#x0025;, and 97.85&#x0025; respectively. Moreover, on 70&#x0025; of TR dataset, the proposed AITDC-IIoT technique offered average <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.75&#x0025;, 97.35&#x0025;, 98.63&#x0025;, 97.98&#x0025;, and 97.78&#x0025; correspondingly. Furthermore, on 30&#x0025; of TS dataset, the presented AITDC-IIoT model provided average <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, and MCC values such as 99.83&#x0025;, 97.58&#x0025;, 98.53&#x0025;, 98.05&#x0025;, and 97.96&#x0025; correspondingly.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Average analysis results of AITDC-IIoT technique under different measures</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-4.png"/></fig>
<p>A brief precision-recall analysis was conducted upon AITDC-IIoT approach on test dataset and the results are depicted in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. As per the figure, it is clear that the proposed AITDC-IIoT method accomplished maximum precision-recall performance under different number of class labels.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Precision-recall curve analysis results of AITDC-IIoT technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-5.png"/></fig>
<p>Training Accuracy (TA) and Validation Accuracy (VA) values, attained by AITDC-IIoT model on test dataset, are demonstrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The experimental outcome imply that AITDC-IIoT model gained the maximum TA and VA values. To be specific, VA seemed to be higher than TA.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>TA and VA graph analyses results of AITDC-IIoT technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-6.png"/></fig>
<p>Training Loss (TL) and Validation Loss (VL) values, achieved by the proposed AITDC-IIoT technique on test dataset, are portrayed in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The experimental outcomes infer that AITDC-IIoT model achieved the least TL and VL values. To be specific, VL seemed to be lower than TL.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>TL and VL graph analyses results of AITDC-IIoT technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-7.png"/></fig>
<p>In order to validate the supremacy of the proposed AITDC-IIoT model, a detailed comparative analysis was performed against existing models and the results are shown in <xref ref-type="table" rid="table-3">Tab. 3</xref> [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Comparative analysis results of AITDC-IIoT technique and other existing approaches</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Methods</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">Accuracy</th>
<th align="left">F-Score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">GRU-RNN</td>
<td align="left">96.75</td>
<td align="left">94.40</td>
<td align="left">96.87</td>
<td align="left">97.88</td>
</tr>
<tr>
<td align="left">AutoEncoders-EDSA</td>
<td align="left">96.36</td>
<td align="left">95.59</td>
<td align="left">97.24</td>
<td align="left">97.41</td>
</tr>
<tr>
<td align="left">Multi-CNN Model</td>
<td align="left">96.79</td>
<td align="left">97.65</td>
<td align="left">99.11</td>
<td align="left">96.81</td>
</tr>
<tr>
<td align="left">Cu-LSTMGRU-Cu-BLSTM</td>
<td align="left">96.99</td>
<td align="left">98.12</td>
<td align="left">99.47</td>
<td align="left">97.95</td>
</tr>
<tr>
<td align="left">Cu-DNN-LSTM Model</td>
<td align="left">94.91</td>
<td align="left">97.70</td>
<td align="left">98.86</td>
<td align="left">97.51</td>
</tr>
<tr>
<td align="left">Cu-DNN-GRU Model</td>
<td align="left">96.11</td>
<td align="left">97.01</td>
<td align="left">99.16</td>
<td align="left">97.57</td>
</tr>
<tr>
<td align="left">AITDC-IIoT</td>
<td align="left">97.58</td>
<td align="left">98.53</td>
<td align="left">99.83</td>
<td align="left">98.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-8">Fig. 8</xref> illustrates the comparative examination results of AITDC-IIoT model and other existing methods in terms of <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The experimental values indicate that Cu-DNN-long Short Term Memory (LSTM) model achieved ineffectual outcome with the least <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.91&#x0025;. Followed by, Gated Recurrent Unit (GRU)-Recurrent Neural Network (RNN), AutoEncoders-EDSA, Multi-CNN, Cu-LSTMGRU-Cu-BLSTM, and Cu-DNN-GRU models produced reasonably closer <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values such as 96.75&#x0025;, 96.36&#x0025;, 96.79&#x0025;, 96.99&#x0025;, and 96.11&#x0025; respectively. However, the proposed AITDC-IIoT model accomplished an enhanced performance with a maximum <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.58&#x0025;.</p>
<fig id="fig-8"><label>Figure 8</label><caption><title><inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis results of AITDC-IIoT technique and other recent algorithms</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-8.png"/></fig>
<p><xref ref-type="fig" rid="fig-9">Fig. 9</xref> showcases the comparative analysis results achieved by the proposed AITDC-IIoT model and other existing methods in terms of <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The experimental values indicate that Cu-DNN-LSTM model showcased ineffectual outcomes with a minimal <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.70&#x0025;. Next, GRU-RNN, AutoEncoders-EDSA, Multi-CNN, Cu-LSTMGRU-Cu-BLSTM, and Cu-DNN-GRU models produced reasonably closer <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values such as 94.40&#x0025;, 95.59&#x0025;, 97.65&#x0025;, 98.12&#x0025;, and 97.01&#x0025; correspondingly. But, the proposed AITDC-IIoT model accomplished an enhanced performance with a maximum <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.58&#x0025;.</p>
<fig id="fig-9"><label>Figure 9</label><caption><title><inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis results of AITDC-IIoT technique and other recent algorithms</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-9.png"/></fig>
<p><xref ref-type="fig" rid="fig-10">Fig. 10</xref> depicts the comparative investigation results attained by the proposed AITDC-IIoT approach and other existing methods in terms of <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The experimental values infer that Cu-DNN-LSTM model achieved ineffectual outcome with the least <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.86&#x0025;. Likewise, GRU-RNN, AutoEncoders-EDSA, Multi-CNN, Cu-LSTMGRU-Cu-BLSTM, and Cu-DNN-GRU models produced reasonably closer <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values such as 96.87&#x0025;, 97.24&#x0025;, 99.11&#x0025;, 99.47&#x0025;, and 99.16&#x0025; correspondingly. However, the proposed AITDC-IIoT model accomplished enhanced performance with a maximum <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.83&#x0025;.</p>
<fig id="fig-10"><label>Figure 10</label><caption><title><inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis results of AITDC-IIoT technique and other recent algorithms</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-10.png"/></fig>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> demonstrates the comparative analysis results achieved by AITDC-IIoT system and other existing systems in terms of <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>. The experimental values imply that Cu-DNN-LSTM algorithm attained ineffectual outcome with a minimal <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.51&#x0025;. Along with that, GRU-RNN, AutoEncoders-EDSA, Multi-CNN, Cu-LSTMGRU-Cu-BLSTM, and Cu-DNN-GRU techniques produced reasonably closer <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> values such as 97.88&#x0025;, 97.41&#x0025;, 96.81&#x0025;, 97.95&#x0025;, and 97.57&#x0025; respectively. At last, the proposed AITDC-IIoT methodology accomplished an enhanced performance with a maximum <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.05&#x0025;.</p>
<p>Based on the results and discussion made above, it is apparent that the proposed AITDC-IIoT model is an excellent performer in terms of threat detection and classification compared to the existing techniques.</p>
<fig id="fig-11"><label>Figure 11</label><caption><title><inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> analysis results of AITDC-IIoT technique with other recent algorithms</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_31613-fig-11.png"/></fig>
</sec>
<sec id="s4"><label>4</label><title>Conclusion</title>
<p>In this study, a new AITDC-IIoT model has been developed for proficient threat detection and classification. The presented AITDC-IIoT model initially pre-processes the input data so as to convert it to a compatible format. Followed by, WOA-FS model is involved to elect the subset of features. Moreover, CSO is employed with RVFL model for threat classification. Finally, CSO algorithm is applied to appropriately adjust the parameters related to RVFL model. The performance of the proposed AITDC-IIoT model was validated under benchmark datasets. The experimental results established the supremacy of the proposed AITDC-IIoT technique over recent approaches. Thus, AITDC-IIoT model can be employed for effectual threat detection and classification in IIoT environment. In future, the performance of the model can be enhanced by including outlier detection and clustering processes.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The author received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The author declares that he has 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>L. L.</given-names> <surname>Dhirani</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Armstrong</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Newe</surname></string-name></person-group>, &#x201C;<article-title>Industrial IoT, cyber threats, and standards landscape: Evaluation and roadmap</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>21</volume>, no. <issue>11</issue>, pp. <fpage>3901</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Tsiknas</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Taketzis</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Demertzis</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Skianis</surname></string-name></person-group>, &#x201C;<article-title>Cyber threats to industrial iot: A survey on attacks and countermeasures</article-title>,&#x201D; <source>IoT</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>163</fpage>&#x2013;<lpage>186</lpage>, <year>2021</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>J. E.</given-names> <surname>Rubio</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Roman</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Lopez</surname></string-name></person-group>, &#x201C;<article-title>Integration of a threat traceability solution in the industrial internet of things</article-title>,&#x201D; <source>IEEE Transactions on Industrial Informatics</source>, vol. <volume>16</volume>, no. <issue>10</issue>, pp. <fpage>6575</fpage>&#x2013;<lpage>6583</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Naeem</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Naeem</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Khalid</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Vasan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Malware detection in industrial internet of things based on hybrid image visualization and deep learning model</article-title>,&#x201D; <source>Ad Hoc Networks</source>, vol. <volume>105</volume>, pp. <fpage>102154</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Sharmeen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Huda</surname></string-name>, <string-name><given-names>J. H.</given-names> <surname>Abawajy</surname></string-name>, <string-name><given-names>W. N.</given-names> <surname>Ismail</surname></string-name> and <string-name><given-names>M. M.</given-names> <surname>Hassan</surname></string-name></person-group>, &#x201C;<article-title>Malware threats and detection for industrial mobile-iot networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, pp. <fpage>15941</fpage>&#x2013;<lpage>15957</lpage>, <year>2018</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>K.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Tan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mumtaz</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Rubaye</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Dulaimi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Securing critical infrastructures: Deep-learning-based threat detection in iiot</article-title>,&#x201D; <source>IEEE Communications Magazine</source>, vol. <volume>59</volume>, no. <issue>10</issue>, pp. <fpage>76</fpage>&#x2013;<lpage>82</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Trakadas</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Simoens</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Gkonis</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Sarakis</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Angelopoulos</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>An artificial intelligence-based collaboration approach in industrial iot manufacturing: Key concepts, architectural extensions and potential applications</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>20</volume>, no. <issue>19</issue>, pp. <fpage>5480</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Hawawreh</surname></string-name>, <string-name><given-names>F. d.</given-names> <surname>Hartog</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Sitnikova</surname></string-name></person-group>, &#x201C;<article-title>Targeted ransomware: A new cyber threat to edge system of brownfield industrial internet of things</article-title>,&#x201D; <source>IEEE Internet Things Journal</source>, vol. <volume>6</volume>, no. <issue>4</issue>, pp. <fpage>7137</fpage>&#x2013;<lpage>7151</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>G. D. L. T.</given-names> <surname>Parra</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rad</surname></string-name> and <string-name><given-names>K. K. R.</given-names> <surname>Choo</surname></string-name></person-group>, &#x201C;<article-title>Implementation of deep packet inspection in smart grids and industrial internet of things: Challenges and opportunities</article-title>,&#x201D; <source>Journal of Network and Computer Applications</source>, vol. <volume>135</volume>, pp. <fpage>32</fpage>&#x2013;<lpage>46</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. H.</given-names> <surname>Muna</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Moustafa</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Sitnikova</surname></string-name></person-group>, &#x201C;<article-title>Identification of malicious activities in industrial internet of things based on deep learning models</article-title>,&#x201D; <source>Journal of Information Security and Applications</source>, vol. <volume>41</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2018</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>M. M. N.</given-names> <surname>Aboelwafa</surname></string-name>, <string-name><given-names>K. G.</given-names> <surname>Seddik</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Eldefrawy</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gadallah</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Gidlund</surname></string-name></person-group>, &#x201C;<article-title>A Machine-learning-based technique for false data injection attacks detection in industrial IoT</article-title>,&#x201D; <source>IEEE Internet Things Journal</source>, vol. <volume>7</volume>, no. <issue>9</issue>, pp. <fpage>8462</fpage>&#x2013;<lpage>8471</lpage>, <year>2020</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>M. M.</given-names> <surname>Hassan</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Hassan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Huda</surname></string-name> and <string-name><given-names>V. H. C. d.</given-names> <surname>Albuquerque</surname></string-name></person-group>, &#x201C;<article-title>A robust deep-learning-enabled trust-boundary protection for adversarial industrial iot environment</article-title>,&#x201D; <source>IEEE Internet Things Journal</source>, vol. <volume>8</volume>, no. <issue>12</issue>, pp. <fpage>9611</fpage>&#x2013;<lpage>9621</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. N.</given-names> <surname>Qureshi</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Rana</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ahmed</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Jeon</surname></string-name></person-group>, &#x201C;<article-title>A novel and secure attacks detection framework for smart cities industrial internet of things</article-title>,&#x201D; <source>Sustainable Cities and Society</source>, vol. <volume>61</volume>, pp. <fpage>102343</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname>Hassan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gumaei</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Huda</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Almogren</surname></string-name></person-group>, &#x201C;<article-title>Increasing the trustworthiness in the industrial iot networks through a reliable cyberattack detection model</article-title>,&#x201D; <source>IEEE Transactions on Industrial Informatics</source>, vol. <volume>16</volume>, no. <issue>9</issue>, pp. <fpage>6154</fpage>&#x2013;<lpage>6162</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Hawawreh</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Sitnikova</surname></string-name></person-group>, &#x201C;<article-title>Industrial internet of things based ransomware detection using stacked variational neural network</article-title>,&#x201D; in <conf-name>Proc. of the 3rd Int. Conf. on Big Data and Internet of Things</conf-name>, <conf-loc>Melbourn VIC Australia</conf-loc>, pp. <fpage>126</fpage>&#x2013;<lpage>130</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name>, <string-name><given-names>J. S.</given-names> <surname>Alzahrani</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Abunadi</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Nemri</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Intelligent deep learning model for privacy preserving iiot on 6&#x2005;g environment</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>72</volume>, no. <issue>1</issue>, pp. <fpage>333</fpage>&#x2013;<lpage>348</lpage>, <year>2022</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. A.</given-names> <surname>Alohali</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Goel</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gupta</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Khanna</surname></string-name></person-group>, &#x201C;<article-title>Artificial intelligence enabled intrusion detection systems for cognitive cyber-physical systems in industry 4.0 environment</article-title>,&#x201D; <source>Cognitive Neurodynamics</source>, <year>2022</year>, <uri xlink:href="https://doi.org/10.1007/s11571-022-09780-8">https://doi.org/10.1007/s11571-022-09780-8</uri>.</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>A. M.</given-names> <surname>Hilal</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Alohali</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Nemri</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Hasan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Enhancing quality of experience in mobile edge computing using deep learning based data offloading and cyberattack detection technique</article-title>,&#x201D; <source>Cluster Computing</source>, <year>2021</year>, <uri xlink:href="https://doi.org/10.1007/s10586-021-03401-5">https://doi.org/10.1007/s10586-021-03401-5</uri>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. A.</given-names> <surname>Albraikan</surname></string-name>, <string-name><given-names>S. B.</given-names> <surname>Haj Hassine</surname></string-name>, <string-name><given-names>S. M.</given-names> <surname>Fati</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Optimal deep learning-based cyberattack detection and classification technique on social networks</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>72</volume>, no. <issue>1</issue>, pp. <fpage>907</fpage>&#x2013;<lpage>923</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Lewis</surname></string-name></person-group>, &#x201C;<article-title>The whale optimization algorithm</article-title>,&#x201D; <source>Advances in Engineering Software</source>, vol. <volume>95</volume>, pp. <fpage>51</fpage>&#x2013;<lpage>67</lpage>, <year>2015</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>F.</given-names> <surname>Essa</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Elaziz</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Elsheikh</surname></string-name></person-group>, &#x201C;<article-title>Prediction of power consumption and water productivity of seawater greenhouse system using random vector functional link network integrated with artificial ecosystem-based optimization</article-title>,&#x201D; <source>Process Safety and Environmental Protection</source>, vol. <volume>144</volume>, pp. <fpage>322</fpage>&#x2013;<lpage>329</lpage>, <year>2020</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>A.</given-names> <surname>Muthumari</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Banumathi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Rajasekaran</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Vijayakarthik</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>High security for de-duplicated big data using optimal simon cipher</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>67</volume>, no. <issue>2</issue>, pp. <fpage>1863</fpage>&#x2013;<lpage>1879</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Gopi</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Muthusamy</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Suresh</surname></string-name>, <string-name><given-names>C. G. G. S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhina</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Optimal confidential mechanisms in smart city healthcare</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>70</volume>, no. <issue>3</issue>, pp. <fpage>4883</fpage>&#x2013;<lpage>4896</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. A.</given-names> <surname>Pustokhin</surname></string-name>, <string-name><given-names>I. V.</given-names> <surname>Pustokhin</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rani</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Kansal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Elhoseny</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Optimal deep learning approaches and healthcare big data analytics for mobile networks toward 5G</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>95</volume>, pp. <fpage>107376</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. A.</given-names> <surname>Alzubi</surname></string-name>, <string-name><given-names>O. A.</given-names> <surname>Alzubi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Beseiso</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Budati</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Shankar</surname></string-name></person-group>, &#x201C;<article-title>Optimal multiple key-based homomorphic encryption with deep neural networks to secure medical data transmission and diagnosis</article-title>,&#x201D; <source>Expert Systems</source>, vol. <volume>39</volume>, no. <issue>4</issue>, pp. <fpage>e12879</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Kwiecie&#x0144;</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Pasieka</surname></string-name></person-group>, &#x201C;<article-title>Cockroach swarm optimization algorithm for travel planning</article-title>,&#x201D; <source>Entropy</source>, vol. <volume>19</volume>, no. <issue>5</issue>, pp. <fpage>213</fpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Abeshu</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Chilamkurti</surname></string-name></person-group>, &#x201C;<article-title>Deep learning: The frontier for distributed attack detection in fog-to-things computing</article-title>,&#x201D; <source>IEEE Communications Magazine</source>, vol. <volume>56</volume>, no. <issue>2</issue>, pp. <fpage>169</fpage>&#x2013;<lpage>175</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Javeed</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Shoukat</surname></string-name></person-group>, &#x201C;<article-title>A hybrid intelligent framework to combat sophisticated threats in secure industries</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>1582</fpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>