<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</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">70545</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.070545</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Boosting Cybersecurity: A Zero-Day Attack Detection Approach Using Equilibrium Optimiser with Deep Learning Model</article-title>
<alt-title alt-title-type="left-running-head">Boosting Cybersecurity: A Zero-Day Attack Detection Approach Using Equilibrium Optimiser with Deep Learning Model</alt-title>
<alt-title alt-title-type="right-running-head">Boosting Cybersecurity: A Zero-Day Attack Detection Approach Using Equilibrium Optimiser with Deep Learning Model</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Almofarreh</surname><given-names>Mona</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Alshahrani</surname><given-names>Amnah</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Alharbi</surname><given-names>Nouf Helal</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Ahmed</surname><given-names>Ahmed Omer</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Alshahrani</surname><given-names>Hussain</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-6" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alzahrani</surname><given-names>Abdulrahman</given-names></name><xref ref-type="aff" rid="aff-6">6</xref><xref rid="cor1" ref-type="corresp">&#x002A;</xref><email>aalzahrani@uhb.edu.sa</email></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Alshahrani</surname><given-names>Mohammed Mujib</given-names></name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Alhashmi</surname><given-names>Asma A.</given-names></name><xref ref-type="aff" rid="aff-8">8</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, College of Computer and Information Sciences, King Saud University, P.O. Box 51178</institution>, <addr-line>Riyadh, 11543</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Systems, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science and Information, Applied College, Taibah University</institution>, <addr-line>Tayba, Madinah, 42353</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Information Systems, Applied College at Mahayil, King Khalid University</institution>, <addr-line>Abha, 62529</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Computer Science, College of Computing and Information Technology, Shaqra University</institution>, <addr-line>Shaqra, 11961</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Computer Science and Engineering, College of Computer Science and Engineering, University of Hafr Al Batin, Al Jamiah</institution>, <addr-line>Hafar Al Batin, 39524</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-7"><label>7</label><institution>Department of Information Systems and Cybersecurity, College of Computing and Information Technology, University of Bisha</institution>, <addr-line>Bisha, P.O. Box 551</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-8"><label>8</label><institution>Department of Computer Science, College of Science, Northern Border University</institution>, <addr-line>Arar, 73213</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Abdulrahman Alzahrani. Email: <email>aalzahrani@uhb.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>26</day><month>11</month><year>2025</year>
</pub-date>
<volume>145</volume>
<issue>2</issue>
<fpage>2631</fpage>
<lpage>2656</lpage>
<history>
<date date-type="received">
<day>18</day>
<month>07</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>09</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_CMES_70545.pdf"></self-uri>
<abstract>
<p>Zero-day attacks use unknown vulnerabilities that prevent being identified by cybersecurity detection tools. This study indicates that zero-day attacks have a significant impact on computer security. A conventional signature-based detection algorithm is not efficient at recognizing zero-day attacks, as the signatures of zero-day attacks are usually not previously accessible. A machine learning (ML)-based detection algorithm is proficient in capturing statistical features of attacks and, therefore, optimistic for zero-day attack detection. ML and deep learning (DL) are employed for designing intrusion detection systems. The improvement of absolute varieties of novel cyberattacks poses significant challenges for IDS solutions that are dependent on datasets of prior signatures of the attacks. This manuscript presents the Zero-day attack detection employing an equilibrium optimizer with a deep learning (ZDAD-EODL) method to ensure cybersecurity. The ZDAD-EODL technique employs meta-heuristic feature subset selection using an optimum DL-based classification technique for zero-day attacks. Initially, the min-max scalar is utilized for normalizing the input data. For feature selection (FS), the ZDAD-EODL method utilizes the equilibrium optimizer (EO) model to choose feature sub-sets. In addition, the ZDAD-EODL technique employs the bi-directional gated recurrent unit (BiGRU) technique for the classification and identification of zero-day attacks. Finally, the detection performance of the BiGRU technique is further enhanced through the implementation of the subtraction average-based optimizer (SABO)-based tuning process. The performance of the ZDAD-EODL approach is investigated on the benchmark dataset. The comparison study of the ZDAD-EODL approach portrayed a superior accuracy value of 98.47% over existing techniques.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Zero-day attack</kwd>
<kwd>cybersecurity</kwd>
<kwd>deep learning</kwd>
<kwd>intrusion detection systems equilibrium optimiser</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>A zero-day attack becomes an innovative cyberattack that will remain unidentified to the cybersecurity community and public, known as &#x201C;zero-day&#x201D;. This employs the vulnerabilities that cannot be revealed openly or utilizes new attacking approaches for preventing those identified by present detection tools [<xref ref-type="bibr" rid="ref-1">1</xref>]. Attackers will be attacked by the objectives of their selection when residual unknown. A network intrusion detection system (NIDS) is a crucial security tool that recognizes attacks as they enter the network setting of organizations. Conventional signature-based NIDSs examine received network traffic for some Indicator of Compromise (IOC), called attack signatures such as hash values, domain names, and source IPs that specify the malicious traffic [<xref ref-type="bibr" rid="ref-2">2</xref>]. A significant challenge in protecting computer networks with signature-based NIDSs is the identification of zero-day attacks. Organizations safeguarded by signature-based NIDS are susceptible to zero-day attacks with no detection of IOCs related to the attacks [<xref ref-type="bibr" rid="ref-3">3</xref>]. Therefore, the attention is directed to the development of ML-based NIDSs, an improved current version of conventional NIDSs, to address the challenges in identifying zero-day or unnoticed attacks. ML-based NIDSs are developed and are also used for scanning and analyzing the received network traffic for some anomalies or malicious intentions [<xref ref-type="bibr" rid="ref-4">4</xref>]. ML functions are proficient in recognizing complex, up-to-date attacks that need advanced state-of-the-art identification abilities. The integration of intelligence into the organization&#x2019;s security scheme includes sophisticated layers of defence that will limit the amount of external and internal attacks, whether developed effectively [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>ML and DL are highly popular and limited approaches to simplifying tasks. It comprises intrusion detection that will be a strong possibility of identifying both zero-day and prominent signature attacks [<xref ref-type="bibr" rid="ref-6">6</xref>]. Accordingly, the requirement for robust IDSs that are efficient at recognizing zero-day assaults is improving. In recent years, the abilities of ML have been employed to increase the effectiveness and performance of numerous technological applications. ML has a subdomain of artificial intelligence (AI), comprising a collection of statistical methods that can be learned from data without being algorithmically trained [<xref ref-type="bibr" rid="ref-7">7</xref>]. ML techniques are identified for their higher capacity for extracting and learning complex data patterns, which experts in the field cannot possibly notice. The learned patterns can be exploited for prediction, classification, and regression of the prospective activities and situations [<xref ref-type="bibr" rid="ref-7">7</xref>]. ML is a breakthrough novelty in various industries, wherein functioning automation and effectiveness are essential. Hence, ML methods are extensively utilized in several fields, demonstrating significant achievements over conventional computing techniques [<xref ref-type="bibr" rid="ref-8">8</xref>]. A similar inspiration provides the application of ML approaches in the cybersecurity field to enhance security in organizations. Providentially, DL techniques are recognized for their capabilities to deal with unlabelled or labelled data or resolve complex issues through the higher-powered GPU [<xref ref-type="bibr" rid="ref-9">9</xref>]. The increasing complexity of cyber threats, particularly those exploiting unknown vulnerabilities, poses a serious threat to conventional security measures. There is a critical need for advanced detection techniques that can identify emerging and previously unseen attacks to protect network environments.</p>
<p>This study presents the Zero-day attack detection employing an equilibrium optimizer with a deep learning (ZDAD-EODL) method to ensure cybersecurity. Initially, the min-max scalar is utilized for normalizing the input data. For feature selection (FS), the ZDAD-EODL method utilizes the EO model to choose feature sub-sets. In addition, the ZDAD-EODL technique employs the bi-directional gated recurrent unit (BiGRU) technique for the classification and identification of zero-day attacks. Finally, the detection performance of the BiGRU technique is further enhanced through the implementation of the subtraction average-based optimizer (SABO)-based tuning process. The performance of the ZDAD-EODL approach is investigated on the benchmark dataset. The key contribution of the ZDAD-EODL approach is listed below.
<list list-type="bullet">
<list-item>
<p>The ZDAD-EODL model applies min-max scalar normalization for scaling input features between a fixed range, enhancing convergence speed and training stability. This ensures uniform feature contribution and improves the performance of the model. It supports better feature learning for downstream tasks. This step contributes to overall detection efficiency.</p></list-item>
<list-item>
<p>The ZDAD-EODL approach integrates the EO technique for choosing optimal feature subsets, effectively mitigating dimensionality without losing critical attack-related data. This improves computational efficiency and model interpretability. It improves focus on relevant attributes for better learning. This step enhances detection accuracy significantly.</p></list-item>
<list-item>
<p>The ZDAD-EODL methodology incorporates the BiGRU model for capturing both past and future contextual data in sequential data, enabling precise modelling of attack behaviours. This enhances the temporal learning capability of the model, improving its ability to classify zero-day attacks accurately. It strengthens the overall detection framework. The approach ensures robustness in handling IoT traffic dynamics.</p></list-item>
<list-item>
<p>The ZDAD-EODL technique incorporates the SABO methodology for fine-tuning the hyperparameters of the BiGRU model effectively, resulting in an enhanced detection precision and model generalization. This optimization improves learning stability and convergence. It contributes to reducing false alarms in zero-day attack detection. The method ensures performance efficiency across varied IoT threat patterns.</p></list-item>
<list-item>
<p>The novelty of the ZDAD-EODL model is in its integrated three-stage process that uniquely integrates EO-based FS, BiGRU classification, and SABO tuning. This unified approach optimizes each stage to work synergistically, improving overall efficiency and accuracy. The framework is specifically designed to address the challenges of zero-day attack detection in IoT environments. It provides a robust and adaptive solution designed for growing threats by seamlessly merging feature selection, classification, and hyperparameter tuning.</p></list-item>
</list></p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Wu et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] developed an innovative active learning architecture dependent upon Deep Q-Networks (DQNs) for zero-day attack recognition. This technique was comprised of an NIDS module, an instance selection approach, and an annotator. DQN method assists as an intelligent controller module for choosing the zero-day instances in labeling with the likelihood distributions. In addition, the bi-directional long short-term memory (Bi-LSTM) model is combined with the DQN technique to make the selection policy for analyzing the temporal relationship with the static classification setting. Shen et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] projected a heuristic learning intrusion detection system with Deep Q-Networks (DQN-HIDS) model for edge-based social Internet of Things (SIoT) systems in the setting of inadequate training instances. The SIoT networking traffic process element produces SIoT traffic instances, chooses instances received models and cybersecurity analysis, and outcomes similarity. The authors combined DQN with a heuristic learning model to steadily increase its capability in the identification of malicious traffic. Drozdenko and Powell [<xref ref-type="bibr" rid="ref-12">12</xref>] introduced a DL method for examining the traffic flow. Although deep neural networks (DNNs) can take extensive time to progress raw network packet capture (PCAP) profiles, training a DNN under data flow is the primary time-consuming step in identifying current cyberattacks. Akshaya and Padmavathi [<xref ref-type="bibr" rid="ref-13">13</xref>] intended to implement game theory in a real-time adverse environment, highlighting attack and security strategies employing an Adapted Bi-LSTM and Game theory with ANN-AE. Tests dependent upon gaming theory and a modified gaming system were used for performances. The Nash equilibrium method is implemented, and the conventional defence mechanism becomes an adversarial training method. Peppes et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] developed a complete technique beginning with the creation of a zero-day variety, but realistic, tabular formats of data, and finally, the assessment of an NN detector of zero-day attacks to be trained with and without synthetic information. The method includes the development and deployment of generative adversarial networks (GANs) for producing a novel and massive dataset of zero-day attacks synthetically. Popoola et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] implemented a federated deep learning (FDL) technique in zero-day botnet attack detection to prevent data privacy leakage. An improved DNN model was utilized for classifying the network traffic. A limitation of the technique is that the server remotely directs the self-sufficient DNN methods training at numerous IoT-edge devices. In contrast, the FedAvg technique was employed for combining the updates of the local model. A global DNN technique was generated later, involving a large amount of communication sequences among the IoT-edge gadgets and structural parameter servers. Priya and Annie Uthra [<xref ref-type="bibr" rid="ref-16">16</xref>] introduced an innovative DL-based VAE method for zero-day attack recognition. Such an investigation intends to develop a novel IDS with a higher detection rate and decreased false negative ration (FNR). The DL-assisted VAE model contains pre-processing to change the raw data into well-matched formats. Then, the pre-processed data was offered to the VAE model for identifying the incidence of zero-day assaults on the network data. Roshan and Zafar [<xref ref-type="bibr" rid="ref-17">17</xref>] presented an IDS that identified Zero-day and unknown cyberattacks. The authors employed the AE to make an intelligent IDS. The innovation of the developed study is to indicate how the threshold plays a vital role in the identification of zero-day cyberattacks with better recall. In addition, preferring a single threshold for a category of attacks cannot function efficiently in the alternative, unnoticed cyberattacks. Zahid et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] proposed an optimized lightweight active security framework for detecting Slow-Rate Attacks in Industrial Cyber&#x2013;Physical Systems using the Online Sequential Extreme Learning Machine (OSELM) technique. The framework reduces memory usage and detection time while improving accuracy through a simple stratified k-fold cross-training method.</p>
<p>Danquah et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] presented a low-complexity federated learning (FL) model for detecting IoT botnet attacks using extreme gradient boosting (XGBoost) for FS, principal component analysis (PCA) for dimensionality reduction, and a differentially private multi-layer perceptron (MLP) trained locally by FL clients and aggregated via federated averaging (FedAvg). Khadidos et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] proposed CyberSentry, a security framework for supervisory control and data acquisition (SCADA) systems that integrates recursive multi-correlation-based information gain (RMIG) FS, tri-fusion network (Tri-Fusion Net) for attack detection, and parrot-levy blend optimization (PLBO) for parameter tuning to improve detection accuracy and system resilience. Reddy et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] explored the utilization of DL techniques such as convolutional neural networks (CNNs), recurrent neural networks (RNNs), and generative adversarial networks (GANs) to improve zero-day attack detection through enhanced anomaly detection (AD), extraction, and behavioural analysis. Akshaya and Ganapathi [<xref ref-type="bibr" rid="ref-22">22</xref>] introduced a model using supervised learning and advanced models, comprising probabilistic graph-based backpropagation neural network (PGB-BPNN), modified bidirectional long short-term memory with game theory (Bi-LSTM-GT), artificial neural network autoencoder (ANN-AE), CNN with long short-term memory (CNN-LSTM), and residual network (ResNet50), along with a deep convolutional zero-day network and hybrid game theory with transfer learning (HGT-TL), achieving high detection accuracy. Abedallah et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] proposed a comprehensive IoT security framework integrating five key methods, namely ML-based patch prioritization, scalable patch distribution (SPD), AD, dynamic risk assessment (DRA), and threat intelligence integration (TII), effectively detecting and mitigating zero-day vulnerabilities. Mohamed et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] presented a probabilistic composite model for zero-day exploit detection. The model comprises adaptive wavepca-autoencoder (AWPA)-based pre-processing, meta-attention transformer autoencoder (MATA)-based feature extraction, Genetic Mongoose-Chameleon Optimisation (GMCO)-based FS, and adaptive hybrid exploit detection network (AHEDNet)-based dynamic ensemble detection. Dai et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] introduced an enhanced zero-day attack detection approach using Autoencoder-based anomaly detection integrated with XGBoost (XGBoost-AE) and Random Forest (RF-AE), achieving high accuracy and robustness. Abid et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] presented the Robust Zero-Day Attack Detection with Optimal Deep Learning (RZDAD-ODL) technique by utilizing Honey Badger Algorithm (HBA)-based FS, Conditional Variational Autoencoder (CVAE)-based attack detection, and Rider Optimisation Algorithm (ROA)-based parameter tuning. Saurabh et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] proposed a hybrid DL model incorporating CNNs and LSTM networks for zero-day attack detection in IoT. Korba et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] developed an anomaly-based detection framework incorporating semi-supervised learning with explainable artificial intelligence (XAI) to identify stealthy botnet command and control (C&#x0026;C) traffic in IoT networks using only benign data for training. Korba et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] developed Zero-X, a security framework integrating deep neural networks (DNN) with open-set recognition (OSR) and blockchain-based privacy-preserving FL to detect both zero-day (0-day) and known (N-day) attacks in the Internet of Vehicles (IoV).</p>
<p>Although various studies have exhibited DL, FL, and AE-based models for zero-day attack detection, a clear research gap exists in integrating these approaches within lightweight, real-time, and highly generalizable IDS for heterogeneous IoT and Industrial Cyber-Physical Systems (ICPS) environments. Many models, comprising DQN-HIDS, Bi-LSTM-GT, and CNN-LSTM, exhibit high accuracy but often lack scalability, adaptability, or robustness under imbalanced or evolving datasets. Models such as AE, GAN, and VAE enhance anomaly detection but suffer from threshold sensitivity or require extensive tuning. Some frameworks also discard effective cross-device or temporal generalization. In addition, restricted work utilizes unified optimization strategies for FS, tuning, and detection in a coordinated process.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Method</title>
<p>In this manuscript, the ZDAD-EODL technique is presented to ensure cybersecurity. The ZDAD-EODL technique employs metaheuristic feature sub-set selection with an optimum DL-based classification method for zero-day attacks. Hence, the ZDAD-EODL method comprises different types of subprocesses, such as pre-processing, EO-based FS, BiGRU-based attack classification, and SABO-based parameter tuning. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the overall process of the ZDAD-EODL technique.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Complete procedure of the ZDAD-EODL approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Pre-Processing</title>
<p>Primarily, the ZDAD-EODL method implements a min-max scalar used for regularising the input data. This model is chosen for its efficiency in transforming features to a standard limit in [0, 1], which helps the model converge faster and enhances numerical stability. This technique preserves the original data distribution while ensuring all features contribute equally during training. This is specifically beneficial for models sensitive to feature magnitude, such as neural networks and gradient-based optimizers. In addition, this model is easy to implement, computationally efficient, and effectively maintains the associations between data points. These merits make it an ideal choice over other techniques such as robust scaling or logarithmic transformations, particularly when working with diverse IoT datasets where preserving feature integrity is crucial.</p>
<p>Min-max scaling, a popular method in data pre-processing, is implemented from the perspective of attack detection for normalizing the feature values within a certain level. This technique confirms that all features are provided similarly to the analysis, avoiding the supremacy of specified variables because of their larger scale. In real-time attack detection, wherein various and dynamic patterns must exist in network traffic or system records, min-max scaling increases the proficiency of the model to distinguish subtle malicious or anomalous activities. Min-max scaling enables a highly robust and accurate training of the ML method for identifying security attacks by converting the input features to standardized ranges, usually between 0 and 1. This normalization procedure is vital for preserving the integrity and efficiency of the attack detection model, finally providing an additional resilient and approachable cybersecurity architecture.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>EO-Based FS</title>
<p>For FS, the ZDAD-EODL model utilizes the EO method to choose feature subsets [<xref ref-type="bibr" rid="ref-30">30</xref>]. This model is selected for its robust capability in balancing exploration and exploitation phases, which also assists in searching the solution space for the most relevant features. This technique replicates the mass balance in dynamic systems, enabling it to avoid local optima better than various conventional optimization algorithms. Compared to methods such as genetic algorithms (GAs) or particle swarm optimization (PSO), EO often converges faster and provides more stable feature subsets. Its capability in handling high-dimensional data and maintaining diversity in the candidate solutions makes it specifically appropriate for complex IoT datasets. This results in reduced dimensionality without sacrificing critical information, ultimately improving model accuracy and computational efficiency.</p>
<p>EO uses a modified candidate solution to begin the optimization process, such as another metaheuristic algorithm. The initial concentration is represented as follows:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" 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:mi>X</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></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:mi>i</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>)</mml:mo></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:mspace width="thinmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p>Now, the concentration of the <italic>i</italic>th particle is represented by <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>; the lower and upper limits of the exploration area are <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>, respectively. The scale of the population in development is formulated as <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>N</mml:mi></mml:math></inline-formula>.</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Equilibrium Pool</title>
<p>The four particles with optimum fitness and the mean of the particles are chosen for creating the equilibrium pool. <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mrow><mml:mtext>q</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are formulated under corresponding conditions.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mn>4</mml:mn></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Exponential Term (F)</title>
<p>The exponential term <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>F</mml:mi></mml:math></inline-formula> is instrumental in retaining the accurate exploration-exploitation balance. This is formulated as follows:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></disp-formula>where a produced variable at random within the interval of [0, 1] is represented by <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>; a non-linear computation is denoted by <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>t</mml:mi></mml:math></inline-formula>:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mi>I</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi>I</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>I</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>T</mml:mi></mml:math></inline-formula> are current and predetermined maximal iteration count; <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> designates the constant parameter.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03BB;</mml:mi></mml:mfrac><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>O</mml:mi><mml:mn>.5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>t</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> take on a value of 2 and 1; sign <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> efficiently defines the development direction; <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>r</mml:mi></mml:math></inline-formula> represents a randomly generated parameter that ranges from zero to one. Substituting <xref ref-type="disp-formula" rid="eqn-6">Eqs. (6)</xref> into <xref ref-type="disp-formula" rid="eqn-4">(4)</xref> yields:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Generation Rate (G)</title>
<p>The parameter accountable for controlling the range of exploitation is called the rate of generation <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>G</mml:mi></mml:math></inline-formula>, and it is defined as follows.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>G</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mi>F</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>G</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi><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>0.5</mml:mn><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mi>G</mml:mi><mml:mi>P</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>G</mml:mi><mml:mi>P</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are random numbers within [0, 1]; <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>G</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi></mml:math></inline-formula> is the generation rate controller parameter.</p>
<p>Therefore, the upgraded approach of EO is given as follows.
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo><mml:mi>F</mml:mi><mml:mo>+</mml:mo><mml:mfrac><mml:mi>G</mml:mi><mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The FF applied in the EO technique is projected to have a balance among multiple preferred features in all solutions (least) and the classification precision (highest) acquired by applying these designated attributes, <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref> indicates the FF to calculate solutions.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mi>R</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>C</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the classification rate of error in a specified classifier; <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>C</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></inline-formula> is the total no. of features in the dataset; <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:mo>|</mml:mo><mml:mi>R</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> is the cardinality of the chosen subset; <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> are two factors resulting in the prominence of classifier quality and subset length.</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Attack Detection Using the BiGRU Model</title>
<p>The ZDAD-EODL model uses the BiGRU technique for recognizing and classifying zero-day attacks. This model is chosen for its ability to capture dependencies in both forward and backwards time sequences, improving the comprehension of temporal patterns in network traffic data. This technique presents improved learning of contextual data, which is crucial for detecting subtle behaviours of zero-day attacks, compared to conventional RNNs and even standard GRUs. This model also requires fewer parameters and is computationally more efficient than LSTMs, making it appropriate for resource-constrained IoT environments. Their gating mechanisms effectively handle vanishing gradient problems, ensuring better training stability and accuracy. Overall, BiGRUs provide a robust balance between performance and efficiency for precise attack classification. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> represents the structure of the Bi-GRU model.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of the BiGRU model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-2.tif"/>
</fig>
<p>Both GRU and LSTM are proposed by RNN [<xref ref-type="bibr" rid="ref-31">31</xref>]. LSTM is applicable for the data series analysis and can capture long-term dependency. The GRU relies on the LSTM to attain a system architecture that only comprises a reset and update gates, which improves computational efficiency and minimizes network complexity.</p>
<p>Where <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are update and reset gates; correspondingly; <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the input from the prior time step, and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the outputs. The computational procedure of <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> output values of the GRU are as follows:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>z</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mover><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>tanh</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is the sigmoid activation function; <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>W</mml:mi></mml:math></inline-formula> is the weight matrices among the update and reset gates; <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the reset gate and ranges within [<inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>]. If <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, each data point passed at the prior time step is to be forgotten; <italic>b</italic> is the bias vector.</p>
<p>BiGRU is composed of a bidirectional RNN with reverse and forward propagation to consider the data&#x2019;s positive and negative aspects. BiGRU considers the change law of data in comparison to unidirectional GRU, and there is no link between the backwards and forward hidden layers (HLs); hence, BiGRU can mine the features of data series.
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>G</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi></mml:math></inline-formula> is the classical <italic>GRU</italic> network computing procedure; <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are the states and weights of forward HL at a time, correspondingly; <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mover><mml:mi>h</mml:mi><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> are the backwards HL states and weights at the time step, correspondingly; <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the set of HL states at time <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>t</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula></p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>SABO-Based Parameter Tuning Method</title>
<p>The detection outcomes of the BiGRU model are improved by implementing the SABO technique [<xref ref-type="bibr" rid="ref-32">32</xref>]. This model is chosen for its effectiveness in balancing between exploration and exploitation phases, which also assists in swift convergence to optimal hyperparameters. Compared to conventional optimization techniques such as grid or random search, this model mitigates computational time (CT) while maintaining high accuracy. Its unique subtraction average strategy allows better avoidance of local minima, improving global search capabilities. The adaptive behavior of the model also makes it appropriate for tuning intrinsic methods such as BiGRU, ensuring improved detection performance. This makes SABO specifically advantageous for optimizing DL techniques in dynamic and resource-constrained environments such as IoT.</p>
<p>The SABO is a mathematically theorized optimization method. Its central notion involves upgrading the places of participants with a population in the search space via employing the SABO of individuals. The technique efficiently alleviates the method&#x2019;s dependency on given individuals.</p>
<p>The solution space was described as the searching region. The primary position of separate search agents with a searching region was arbitrarily measured as expressed in <xref ref-type="disp-formula" rid="eqn-20">Eq. (20)</xref>:
<disp-formula id="ueqn-20"><mml:math id="mml-ueqn-20" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F0;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F0;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</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:mspace width="thinmathspace" /><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>m</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>i</mml:mi><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> individual; <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>N</mml:mi></mml:math></inline-formula> is the individuals count with the population; <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>X</mml:mi></mml:math></inline-formula> describes the total matrices of the SABO populations; <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> identifies its place at <italic>d</italic>th size of the search space; <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are the lower and upper boundaries of the outcome variables at <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>d</mml:mi><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> dimensions; <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>m</mml:mi></mml:math></inline-formula> is the number of decision variables; <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> exhibits in an arbitrary number at an interval <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>All the search particles relate to the solution of optimizer difficulty, and also their gathering of fitness function (FF) values is denoted as a vector <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mover><mml:mi>F</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula>, given in <xref ref-type="disp-formula" rid="eqn-21">Eq. (21)</xref>:
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:mover><mml:mi>F</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>F</mml:mi><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:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></disp-formula>where <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mover><mml:mi>F</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> is the FF vector; <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the FF.</p>
<p>Unlike distinct primary optimization methods, the SABO technique does not upgrade the place of the search populations at the <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><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>&#x2212;</mml:mo><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> round only dependent upon the place of the preeminent searching agents at the <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> iteration; alternatively, this utilizes the arithmetic mean place at <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> iteration for executing the upgrade for the <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> iterative search population. The SABO method steps are discussed below:</p>
<p>1. The SABO technique presents &#x201C;<inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mo>&#x2212;</mml:mo><mml:mi>v</mml:mi></mml:math></inline-formula>&#x201D;, described as the &#x201C;<inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>v</mml:mi></mml:math></inline-formula>-difference&#x201D; among searching agents <italic>A</italic> and <italic>B</italic>, which is expressed as follows:
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mi>A</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>v</mml:mi><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mover><mml:mi>v</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>B</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mover><mml:mi>v</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> is a vector of dimensionality <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>m</mml:mi></mml:math></inline-formula>; <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> describe the primary function variables of search agents <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>A</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>B</mml:mi></mml:math></inline-formula>; <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>u</mml:mi></mml:math></inline-formula> is a number randomly created at the interval [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>], correspondingly.</p>
<p>The function <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mrow><mml:mtext>``*''</mml:mtext></mml:mrow></mml:math></inline-formula> indicates the Hadamard product of 2 vectors.</p>
<p>2. A change of <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> will be calculated in obtaining the arithmetic mean of the &#x201C;<inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>v</mml:mi></mml:math></inline-formula>-variances&#x201D; attained by subtraction at every search agent <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:math></inline-formula>
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><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:mover><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><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>&#x2212;</mml:mo><mml:mi>v</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>N</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>N</mml:mi></mml:math></inline-formula> is the total number of search particles; <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mover><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> is a vector of dimensionality <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>m</mml:mi></mml:math></inline-formula>; <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the new place of <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:math></inline-formula> individual <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</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>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> describes a random value sampled from a normal distribution.</p>
<p>3. Location update:
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" 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:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are the central functional values of the search agent; <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> correspondingly. When the upgraded place is higher, it is replaced by the new place employing <xref ref-type="disp-formula" rid="eqn-24">Eq. (24)</xref>; then, the new position is taken. <xref ref-type="table" rid="table-1">Table 1</xref> describes the key parameters and their value range in the SABO technique.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Key parameters and their typical value ranges used in the SABO model for effective hyperparameter tuning</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Description</th>
<th>Typical Values/Range</th>
</tr>
</thead>
<tbody>
<tr>
<td>POPU_SIZE</td>
<td>Number of candidate solutions in the populace</td>
<td>20&#x2013;50</td>
</tr>
<tr>
<td>MAX_ITER</td>
<td>Maximum number of optimization iterations</td>
<td>100&#x2013;500</td>
</tr>
<tr>
<td>Dimensionality</td>
<td>Number of features or variables being optimized</td>
<td>Problem dimension specific</td>
</tr>
<tr>
<td>LOWER_LIMIT</td>
<td>Minimum value for each variable</td>
<td>Problem-specific</td>
</tr>
<tr>
<td>UPPER_LIMIT</td>
<td>Maximum value for each variable</td>
<td>Problem-specific</td>
</tr>
<tr>
<td>SUBSTRACTION_RATE</td>
<td>Controls the average subtraction step size</td>
<td>[0, 1]</td>
</tr>
<tr>
<td>Exploration factor</td>
<td>Balances exploration and exploitation phases</td>
<td>Between 0.1 and 0.9</td>
</tr>
<tr>
<td>Convergence threshold</td>
<td>Stopping criterion based on fitness improvement</td>
<td>Small positive value, 1e&#x2212;6</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The SABO method obtains an FF for achieving the enriched classification effectiveness. This finds a positive number to denote the exceptional proficiency of the candidate solutions. The drop in the classifier error rate will be calculated as the FF, as described in <xref ref-type="disp-formula" rid="eqn-25">Eq. (25)</xref>.
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml: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>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>E</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><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:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Validation</title>
<p>The attack detection findings of the ZDAD-EODL technique are inspected by the ToN-IoT dataset [<xref ref-type="bibr" rid="ref-33">33</xref>]. The method runs on Python 3.6.5 with an i5-8600k CPU, 4 GB GPU, 16 GB RAM, 250 GB SSD, and 1 TB HDD, using a 0.01 learning rate, ReLU, 50 epochs, 0.5 dropout, and batch size 5. It maintains 10,000 samples with 10 classes, namely Backdoor, Denial of Service (DoS), Distributed Denial of Service (DDoS), Injection, Man-in-the-Middle (MITM), Scanning, Ransomware, Password, Cross-Site Scripting (XSS), and Normal, as described in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Details of the dataset</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>&#x201C;Type of event&#x201D;</th>
<th>&#x201C;No. of records&#x201D;</th>
</tr>
</thead>
<tbody>
<tr>
<td>&#x201C;Backdoor&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;DoS&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;DDoS&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Injection&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;MITM&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Scanning&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Ransomware&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Password&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;XSS&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Normal&#x201D;</td>
<td>&#x201C;1000&#x201D;</td>
</tr>
<tr>
<td>&#x201C;Total Records&#x201D;</td>
<td>&#x201C;10,000&#x201D;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> explains the confusion matrices achieved by the ZDAD-EODL approach with 80%:20% and 70%:30% of the training set (TRAS) and testing set (TESS). These findings characterize the effective recognition with 10 samples across all classes.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Confusion matrices of (<bold>a</bold>, <bold>b</bold>) 80%:20% of TRAS and TESS and (<bold>c</bold>, <bold>d</bold>) 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-3a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-3b.tif"/>
</fig>
<p>The attack detection consequences of the ZDAD-EODL approach are demonstrated at 80%:20% of TRAS and TESS, as provided in <xref ref-type="table" rid="table-3">Table 3</xref> and <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. These outcomes indicate that the ZDAD-EODL approach achieves effective attack detection. With 80% of TRAS, the ZDAD-EODL model attains an average <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.38%, <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><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 91.84%, <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> of 91.84%, <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 91.83%, and <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.47%. In addition, depending on 20% of TESS, the ZDAD-EODL model attains an average <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.47%, <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><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 92.38%, <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.35%, <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.33%, and <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.75%.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Attack recognition result of ZDAD-EODL model with 80%:20% of TRAS and TESS</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Classes</th>
<th><inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mrow><mml:mi mathvariant="bold-italic">R</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi mathvariant="bold-italic">F</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">U</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">TRAS (80%)</td>
</tr>
<tr>
<td>Backdoor</td>
<td>98.19</td>
<td>91.78</td>
<td>89.29</td>
<td>90.52</td>
<td>94.22</td>
</tr>
<tr>
<td>DoS</td>
<td>98.71</td>
<td>92.73</td>
<td>94.47</td>
<td>93.59</td>
<td>96.83</td>
</tr>
<tr>
<td>DDoS</td>
<td>98.58</td>
<td>93.58</td>
<td>92.19</td>
<td>92.88</td>
<td>95.74</td>
</tr>
<tr>
<td>Injection</td>
<td>98.39</td>
<td>92.00</td>
<td>92.12</td>
<td>92.06</td>
<td>95.61</td>
</tr>
<tr>
<td>MITM</td>
<td>97.86</td>
<td>90.52</td>
<td>88.18</td>
<td>89.33</td>
<td>93.57</td>
</tr>
<tr>
<td>Scanning</td>
<td>97.92</td>
<td>89.00</td>
<td>90.55</td>
<td>89.77</td>
<td>94.65</td>
</tr>
<tr>
<td>Ransomware</td>
<td>98.52</td>
<td>91.98</td>
<td>93.36</td>
<td>92.66</td>
<td>96.23</td>
</tr>
<tr>
<td>Password</td>
<td>98.56</td>
<td>92.34</td>
<td>93.16</td>
<td>92.74</td>
<td>96.15</td>
</tr>
<tr>
<td>XSS</td>
<td>98.24</td>
<td>92.82</td>
<td>89.49</td>
<td>91.13</td>
<td>94.36</td>
</tr>
<tr>
<td>Normal</td>
<td>98.70</td>
<td>91.71</td>
<td>95.61</td>
<td>93.62</td>
<td>97.33</td>
</tr>
<tr>
<td>Average</td>
<td>98.37</td>
<td>91.84</td>
<td>91.84</td>
<td>91.83</td>
<td>95.47</td>
</tr>
<tr>
<td align="center" colspan="6">TESS (20%)</td>
</tr>
<tr>
<td>Backdoor</td>
<td>98.20</td>
<td>94.79</td>
<td>88.89</td>
<td>91.74</td>
<td>94.13</td>
</tr>
<tr>
<td>DoS</td>
<td>98.65</td>
<td>92.75</td>
<td>94.12</td>
<td>93.43</td>
<td>96.64</td>
</tr>
<tr>
<td>DDoS</td>
<td>98.60</td>
<td>94.59</td>
<td>90.67</td>
<td>92.59</td>
<td>95.06</td>
</tr>
<tr>
<td>Injection</td>
<td>98.50</td>
<td>91.15</td>
<td>93.09</td>
<td>92.11</td>
<td>96.07</td>
</tr>
<tr>
<td>MITM</td>
<td>98.40</td>
<td>90.62</td>
<td>92.55</td>
<td>91.58</td>
<td>95.78</td>
</tr>
<tr>
<td>Scanning</td>
<td>98.10</td>
<td>89.90</td>
<td>90.82</td>
<td>90.36</td>
<td>94.85</td>
</tr>
<tr>
<td>Ransomware</td>
<td>98.85</td>
<td>95.43</td>
<td>93.07</td>
<td>94.24</td>
<td>96.28</td>
</tr>
<tr>
<td>Password</td>
<td>98.80</td>
<td>92.31</td>
<td>96.68</td>
<td>94.44</td>
<td>97.87</td>
</tr>
<tr>
<td>XSS</td>
<td>98.40</td>
<td>93.44</td>
<td>89.53</td>
<td>91.44</td>
<td>94.43</td>
</tr>
<tr>
<td>Normal</td>
<td>98.20</td>
<td>88.79</td>
<td>94.06</td>
<td>91.35</td>
<td>96.36</td>
</tr>
<tr>
<td>Average</td>
<td>98.47</td>
<td>92.38</td>
<td>92.35</td>
<td>92.33</td>
<td>95.75</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Average outcome of ZDAD-EODL model at 80%:20% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-4.tif"/>
</fig>
<p>The <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> examination for training (TRA) and validation (VAL) shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> for the ZDAD-EODL technique at 80%:20% of TRAS and TESS provides a valuable understanding of its effectiveness at numerous epochs. Mainly, it is a continual updating at the TRA and TES <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><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> to improved epochs, specifying the skills of the approach for learning and recognizing patterns in both datasets. This increased tendency in TES <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> highlights the flexibility of the model to the TRA data and the capacity to provide accurate forecasts on unnoticed datasets, highlighting the abilities of strong generalizability.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title><inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> curve of ZDAD-EODL model at 80%:20% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-5.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> illustrates a wide-ranging finding of the TRA loss and TES loss values for the ZDAD-EODL technique at 80%:20% of TRAS and TESS at changing epochs. The loss of TRA is reliably minimized as the methodology enhances the weights to reduce errors of the classifier on either dataset. The loss examination noticeably represents the arrangements with the TRA dataset, underlining its capacity to seize patterns positively. The importance lies in the constant enhancement of parameters in the ZDAD-EODL model, aimed at lessening changes between real and predicted TRA labels.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Loss curve of ZDAD-EODL method with 80%:20% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-6.tif"/>
</fig>
<p>Regarding the precision-recall (PR) curve illustrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The discoveries confirm that the ZDAD-EODL technique with 80%:20% of TRAS and TESS consistently yields higher PR values in each class. These acquired performances emphasize the effective capability of the method for distinguishing between different classes, underlining its efficiency in correctly identifying classes.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>PR curve of ZDAD-EODL model at 80%:20% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-7.tif"/>
</fig>
<p>Simultaneously, <xref ref-type="fig" rid="fig-8">Fig. 8</xref> presents the ROC analysis performed using the ZDAD-EODL model with an 80%:20% split of TRAS and TESS, highlighting its ability to distinguish between classes. This curve provides valuable perceptions of how the tradeoff between true positive rate (TPR) and false positive rate (FPR) adjusts in multiple classification thresholds and epoch counts. The outcomes highlight the model&#x2019;s accurate classifier efficiency on dissimilar classes, underlining its proficiency in overcoming several classification challenges.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>ROC curve of ZDAD-EODL methodology at 80%:20% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-8.tif"/>
</fig>
<p>The attack recognition outcomes of the ZDAD-EODL model are confirmed with 70%:30% of TRAS and TESS, as described in <xref ref-type="table" rid="table-4">Table 4</xref> and <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. These obtained findings display that the ZDAD-EODL approach obtains proficient recognition of the attacks. Based on 70% of TRAS, the ZDAD-EODL methods gained an average <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><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.13%, <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><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 90.66%, <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><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 90.63%, <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 90.63%, and <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.79%. Similarly, depending on 30% of TESS, the ZDAD-EODL process achieves an average <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><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.21%, <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><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 91.06%, <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><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 91.06%, <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 91.04%, and <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.03%.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Attack recognition result of ZDAD-EODL model with 70%:30% of TRASH/TESSH</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Classes</th>
<th><inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mrow><mml:mi mathvariant="bold-italic">R</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mi mathvariant="bold-italic">F</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">U</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">TRAS (70%)</td>
</tr>
<tr>
<td>Backdoor</td>
<td>98.11</td>
<td>90.58</td>
<td>90.58</td>
<td>90.58</td>
<td>94.77</td>
</tr>
<tr>
<td>DoS</td>
<td>97.77</td>
<td>88.83</td>
<td>89.08</td>
<td>88.95</td>
<td>93.91</td>
</tr>
<tr>
<td>DDoS</td>
<td>97.99</td>
<td>88.43</td>
<td>92.28</td>
<td>90.31</td>
<td>95.45</td>
</tr>
<tr>
<td>Injection</td>
<td>97.89</td>
<td>91.18</td>
<td>87.57</td>
<td>89.34</td>
<td>93.31</td>
</tr>
<tr>
<td>MITM</td>
<td>97.71</td>
<td>88.68</td>
<td>88.17</td>
<td>88.42</td>
<td>93.47</td>
</tr>
<tr>
<td>Scanning</td>
<td>98.39</td>
<td>92.58</td>
<td>91.41</td>
<td>91.99</td>
<td>95.29</td>
</tr>
<tr>
<td>Ransomware</td>
<td>98.21</td>
<td>91.19</td>
<td>91.06</td>
<td>91.13</td>
<td>95.04</td>
</tr>
<tr>
<td>Password</td>
<td>98.57</td>
<td>90.96</td>
<td>95.13</td>
<td>93.00</td>
<td>97.04</td>
</tr>
<tr>
<td>XSS</td>
<td>98.10</td>
<td>89.62</td>
<td>90.81</td>
<td>90.21</td>
<td>94.85</td>
</tr>
<tr>
<td>Normal</td>
<td>98.51</td>
<td>94.55</td>
<td>90.19</td>
<td>92.32</td>
<td>94.81</td>
</tr>
<tr>
<td>Average</td>
<td>98.13</td>
<td>90.66</td>
<td>90.63</td>
<td>90.63</td>
<td>94.79</td>
</tr>
<tr>
<td align="center" colspan="6">TESS (30%)</td>
</tr>
<tr>
<td>Backdoor</td>
<td>98.07</td>
<td>91.13</td>
<td>89.30</td>
<td>90.20</td>
<td>94.17</td>
</tr>
<tr>
<td>DoS</td>
<td>98.20</td>
<td>91.41</td>
<td>90.17</td>
<td>90.78</td>
<td>94.62</td>
</tr>
<tr>
<td>DDoS</td>
<td>98.27</td>
<td>88.06</td>
<td>94.79</td>
<td>91.30</td>
<td>96.71</td>
</tr>
<tr>
<td>Injection</td>
<td>97.93</td>
<td>88.85</td>
<td>90.07</td>
<td>89.46</td>
<td>94.42</td>
</tr>
<tr>
<td>MITM</td>
<td>98.13</td>
<td>92.26</td>
<td>89.25</td>
<td>90.73</td>
<td>94.20</td>
</tr>
<tr>
<td>Scanning</td>
<td>98.63</td>
<td>93.99</td>
<td>91.72</td>
<td>92.84</td>
<td>95.55</td>
</tr>
<tr>
<td>Ransomware</td>
<td>98.17</td>
<td>90.54</td>
<td>90.85</td>
<td>90.69</td>
<td>94.91</td>
</tr>
<tr>
<td>Password</td>
<td>98.53</td>
<td>90.82</td>
<td>95.03</td>
<td>92.88</td>
<td>96.98</td>
</tr>
<tr>
<td>XSS</td>
<td>97.90</td>
<td>91.19</td>
<td>89.23</td>
<td>90.20</td>
<td>94.09</td>
</tr>
<tr>
<td>Normal</td>
<td>98.23</td>
<td>92.33</td>
<td>90.23</td>
<td>91.27</td>
<td>94.69</td>
</tr>
<tr>
<td>Average</td>
<td>98.21</td>
<td>91.06</td>
<td>91.06</td>
<td>91.04</td>
<td>95.03</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Average of ZDAD-EODL model at 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-9.tif"/>
</fig>
<p>The <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><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> curves for TRA and VAL illustrated in <xref ref-type="fig" rid="fig-10">Fig. 10</xref> for the ZDAD-EODL approach at 70%:30% of TRAS and TESS present valuable insights into its effectiveness at many epochs. Initially, it is a continual upgrading in the TRA <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><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> and TES <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><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> with improved epoch counts, indicating the abilities of the method for learning and identifiable patterns from both datasets. The advanced tendency in TES <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><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> highlight the flexibilities of the model to the TRA datasets and the capabilities to generate exact predictions on unobserved datasets, stressing the proficiency of strong generalizability.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title><inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><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> curve of ZDAD-EODL model at 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-10.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> provides an all-inclusive outcome of the TRA loss and TES loss values for the ZDAD-EODL technique at 70%:30% of TRAS and TESS at several epochs. The loss of TRA continuously reduces as the method enhances the weights to lower classification errors in the datasets. The curves of loss noticeably denote the arrangements with the TRA dataset, heightening its capacities to detect seizure patterns. Substantial is the continual perfection of parameters in the ZDAD-EODL approach, directed at diminishing variances between actual and predicted TRA labels.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Loss curve of ZDAD-EODL technique on 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-11.tif"/>
</fig>
<p>About the PR examination presented in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>, the results affirm that the ZDAD-EODL method at 70%:30% of TRASH/TESSH consistently yields higher PR values in all classes. The outcomes highlight the effective ability of the process for distinguishing between varied classes, highlighting its effectiveness in correctly recognizing classes.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>PR curve of ZDAD-EODL technique on 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-12.tif"/>
</fig>
<p>Likewise, <xref ref-type="fig" rid="fig-13">Fig. 13</xref> illustrates ROC curves created in the ZDAD-EODL approaches at 70%:30% of TRASH/TESSH, signifying its ability to distinguish between classes. This curve provides a valuable understanding of how the tradeoff among FPR and TPR changes at varying classifier thresholds and epoch counts. The outcomes emphasize the model&#x2019;s correct classifier effectiveness on various classes, accentuating its efficiency in tackling manifold classifier tasks.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>ROC curve of ZDAD-EODL model at 70%:30% of TRAS and TESS</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-13.tif"/>
</fig>
<p>The comparative results of the ZDAD-EODL technique are illustrated [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>] in <xref ref-type="table" rid="table-5">Table 5</xref> and <xref ref-type="fig" rid="fig-14">Fig. 14</xref>. These comparative results indicate that the Densely-ResNet model attains the poorest performance. Simultaneously, the OSELM, XGBoost, RMIG, logistic regression (LR), deep feed forward (DFF), RF, XGBoost, and Inception models obtained closer results. In addition, the ZDAD-EODL technique gains superior results with a maximum <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><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.47%, <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><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 92.38%, <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><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 92.35%, and <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.33%.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Comparative outcome of the ZDAD-EODL model with existing techniques [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>]</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th><inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:mrow><mml:mi mathvariant="bold-italic">R</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:mi mathvariant="bold-italic">F</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>OSELM</td>
<td>98.24</td>
<td>91.98</td>
<td>90.66</td>
<td>91.02</td>
</tr>
<tr>
<td>XGBoost</td>
<td>93.55</td>
<td>90.69</td>
<td>92.16</td>
<td>90.91</td>
</tr>
<tr>
<td>RMIG</td>
<td>96.65</td>
<td>91.62</td>
<td>92.14</td>
<td>92.27</td>
</tr>
<tr>
<td>LR</td>
<td>97.45</td>
<td>91.30</td>
<td>90.03</td>
<td>90.45</td>
</tr>
<tr>
<td>Densely-Resnet</td>
<td>92.99</td>
<td>90.08</td>
<td>91.65</td>
<td>90.26</td>
</tr>
<tr>
<td>DFF Model</td>
<td>96.10</td>
<td>90.83</td>
<td>91.35</td>
<td>91.65</td>
</tr>
<tr>
<td>RF</td>
<td>97.35</td>
<td>91.03</td>
<td>90.67</td>
<td>90.94</td>
</tr>
<tr>
<td>XGBoost</td>
<td>98.28</td>
<td>90.92</td>
<td>91.62</td>
<td>90.77</td>
</tr>
<tr>
<td>Inception Model</td>
<td>98.20</td>
<td>90.66</td>
<td>91.81</td>
<td>91.65</td>
</tr>
<tr>
<td>ZDAD-EODL</td>
<td>98.47</td>
<td>92.38</td>
<td>92.35</td>
<td>92.33</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Comparative outcome of the ZDAD-EODL model with existing techniques</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-14.tif"/>
</fig>
<p>An extensive comparative computational time (CT) results of the ZDAD-EODL technique are presented in <xref ref-type="table" rid="table-6">Table 6</xref> and <xref ref-type="fig" rid="fig-15">Fig. 15</xref>. These comparative results display that the Densely-ResNet model provides lower performance. Simultaneously, the OSELM, XGBoost, RMIG, LR, DFF, RF, XGBoost, and Inception models achieve closer results. However, the ZDAD-EODL method gains higher results with decreased CT of 3.70 s, respectively.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>CT outcome of ZDAD-EODL technique with existing methods</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Techniques</th>
<th>CT (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td>OSELM</td>
<td>10.60</td>
</tr>
<tr>
<td>XGBoost</td>
<td>9.07</td>
</tr>
<tr>
<td>RMIG</td>
<td>6.44</td>
</tr>
<tr>
<td>LR</td>
<td>5.94</td>
</tr>
<tr>
<td>Densely-Resnet</td>
<td>7.38</td>
</tr>
<tr>
<td>DFF Model</td>
<td>7.16</td>
</tr>
<tr>
<td>RF</td>
<td>9.81</td>
</tr>
<tr>
<td>XGBoost</td>
<td>8.53</td>
</tr>
<tr>
<td>Inception Model</td>
<td>8.52</td>
</tr>
<tr>
<td>ZDAD-EODL</td>
<td>3.70</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>CT outcome of the ZDAD-EODL technique with existing methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-15.tif"/>
</fig>
<p><xref ref-type="table" rid="table-7">Table 7</xref> and <xref ref-type="fig" rid="fig-16">Fig. 16</xref> specify the error analysis of the ZDAD-EODL approach with existing models. The ZDAD-EODL approach achieves the lowest error rates with an <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><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> at 1.53%, <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><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> at 7.62%, <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><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> at 7.65%, and <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> at 7.67%, indicating better overall reliability in predictions. In contrast, the Densely-Resnet model exhibits higher error values with an <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><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 7.01%, <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><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 9.92%, <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><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 8.35%, and <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 9.74%, indicating less consistent performance. Other models, such as OSELM and XGBoost, also exhibit relatively higher errors across metrics; for example, OSELM illustrates 1.76% <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><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> error and 8.98% <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> error. This analysis highlights that the ZDAD-EODL model provides more accurate and balanced detection capabilities with fewer errors compared to the alternative approaches evaluated.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Error analysis of ZDAD-EODL approach with existing models</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th><inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:mrow><mml:mi mathvariant="bold-italic">R</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi mathvariant="bold-italic">F</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>OSELM</td>
<td>1.76</td>
<td>8.02</td>
<td>9.34</td>
<td>8.98</td>
</tr>
<tr>
<td>XGBoost</td>
<td>6.45</td>
<td>9.31</td>
<td>7.84</td>
<td>9.09</td>
</tr>
<tr>
<td>RMIG</td>
<td>3.35</td>
<td>8.38</td>
<td>7.86</td>
<td>7.73</td>
</tr>
<tr>
<td>LR</td>
<td>2.55</td>
<td>8.70</td>
<td>9.97</td>
<td>9.55</td>
</tr>
<tr>
<td>Densely-Resnet</td>
<td>7.01</td>
<td>9.92</td>
<td>8.35</td>
<td>9.74</td>
</tr>
<tr>
<td>DFF Model</td>
<td>3.90</td>
<td>9.17</td>
<td>8.65</td>
<td>8.35</td>
</tr>
<tr>
<td>RF</td>
<td>2.65</td>
<td>8.97</td>
<td>9.33</td>
<td>9.06</td>
</tr>
<tr>
<td>XGBoost</td>
<td>1.72</td>
<td>9.08</td>
<td>8.38</td>
<td>9.23</td>
</tr>
<tr>
<td>Inception Model</td>
<td>1.80</td>
<td>9.34</td>
<td>8.19</td>
<td>8.35</td>
</tr>
<tr>
<td>ZDAD-EODL</td>
<td>1.53</td>
<td>7.62</td>
<td>7.65</td>
<td>7.67</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Error analysis of the ZDAD-EODL approach with existing models</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-16.tif"/>
</fig>
<p><xref ref-type="table" rid="table-8">Table 8</xref> and <xref ref-type="fig" rid="fig-17">Fig. 17</xref> specify the ablation study of the ZDAD-EODL methodology with existing techniques. The EO model achieves an <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.20%, <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><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 90.07%, <inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><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 90.08%, and <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 90.07%, serving as the baseline feature selection method. SABO-based tuning improves these metrics slightly, reaching an <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.80%, <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><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 90.76%, <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><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 90.81%, and <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 90.86%, indicating enhanced parameter optimization. The BiGRU classification model, in addition, improves performance with an <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.65%, <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><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 91.61%, <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><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 91.63%, and <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 91.71%, reflecting superior sequence modeling. Finally, the ZDAD-EODL model attains the highest scores with an <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><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.47%, <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><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 92.38%, <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><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 92.35%, and <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.33%, demonstrating the effectiveness of combining all components for optimal zero-day attack detection.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Result analysis of ablation study of ZDAD-EODL methodology with existing techniques</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th><inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:mrow><mml:mi mathvariant="bold-italic">R</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:mi mathvariant="bold-italic">F</mml:mi><mml:msub><mml:mrow><mml:mtext mathvariant="bold">1</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>EO</td>
<td>96.20</td>
<td>90.07</td>
<td>90.08</td>
<td>90.07</td>
</tr>
<tr>
<td>SABO</td>
<td>96.80</td>
<td>90.76</td>
<td>90.81</td>
<td>90.86</td>
</tr>
<tr>
<td>BiGRU</td>
<td>97.65</td>
<td>91.61</td>
<td>91.63</td>
<td>91.71</td>
</tr>
<tr>
<td>ZDAD-EODL</td>
<td>98.47</td>
<td>92.38</td>
<td>92.35</td>
<td>92.33</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Result analysis of ablation study of ZDAD-EODL methodology with existing techniques</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_70545-fig-17.tif"/>
</fig>
<p>Therefore, the ZDAD-EODL model proved to be an effective tool for zero-day attack classification.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This study presents the ZDAD-EODL approach to ensure cybersecurity. The ZDAD-EODL technique employs metaheuristic feature sub-set selection with an optimum DL-based classification approach for zero-day attacks. The ZDAD-EODL methods comprise various kinds of sub-processes such as pre-processing, EO-based FS process, BiGRU-based classification, and SABO-based parameter optimizer. Primarily, the ZDAD-EODL method utilizes a min-max scalar for normalizing the input data. For FS, the ZDAD-EODL technique employs the EO model to choose feature subsets. In addition, the ZDAD-EODL technique employs the BiGRU model for the classification and identification of zero-day attacks. The detection performance of the BiGRU model is further enhanced through the implementation of the SABO-based tuning process. The performance of the ZDAD-EODL methodology is investigated under a benchmark dataset. The accomplished simulation results reported that the ZDAD-EODL methodology gains superior performance across other existing models. The limitations of the ZDAD-EODL methodology comprise potential challenges in handling highly dynamic and diverse IoT environments, which can affect detection robustness. The current model can also face difficulties adapting quickly to rapidly growing zero-day attack patterns. In addition, real-time implementation and resource constraints on edge devices were not fully explored. Future work should consider validating the model on larger and more diverse datasets to improve generalizability. Further research can concentrate on improving adaptability to new threats and optimizing the model for deployment in resource-limited IoT settings.</p>
</sec>
</body>
<back>
<ack>
<p>The authors extend their appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP2/286/46. Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R732), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. 
The authors would like to thank Ongoing Research Funding program (ORFFT-2025-100-7), King Saud University, Riyadh, Saudi Arabia for financial support. The authors extend their appreciation to the Deanship of Scientific Research at Northern Border University, Arar, Saudi Arabia, for funding this research work through the project number &#x201C;NBU-FFR-2025-2913-07&#x201D;. The authors are thankful to the Deanship of Graduate Studies and Scientific Research at the University of Bisha for supporting this work through the Fast-Track Research Support Program.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: conceptualization, Mona Almofarreh; methodology, Mona Almofarreh; software, Ahmed Omer Ahmed and Hussain Alshahrani; investigation, Mona Almofarreh; resources, Abdulrahman Alzahrani; data curation, Amnah Alshahrani and Nouf Helal Alharbi; formal analysis, Amnah Alshahrani and Nouf Helal Alharbi; writing&#x2014;original draft preparation, Mona Almofarreh; writing&#x2014;review and editing, Abdulrahman Alzahrani; visualization, Mohammed Mujib Alshahrani and Asma A. Alhashmi; supervision, Abdulrahman Alzahrani, Ahmed Omer Ahmed and Hussain Alshahrani; project administration, Abdulrahman Alzahrani; funding acquisition, Abdulrahman Alzahrani. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The data that support the findings of this study are openly available in the repository <ext-link ext-link-type="uri" xlink:href="https://research.unsw.edu.au/projects/toniot-datasets">https://research.unsw.edu.au/projects/toniot-datasets</ext-link> (accessed on 01 January 2025), reference number [<xref ref-type="bibr" rid="ref-33">33</xref>].</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sara</surname> <given-names>JJ</given-names></string-name>, <string-name><surname>Hossain</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Static analysis based malware detection for zero-day attacks in Android applications</article-title>. In: <conf-name>Proceedings of the 2023 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD); 2023 Sep 21&#x2013;23</conf-name>; <publisher-loc>Dhaka, Bangladesh. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2023</year>. p. <fpage>169</fpage>&#x2013;<lpage>73</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICICT4SD59951.2023.10303336</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Swathy Akshaya</surname> <given-names>M</given-names></string-name>, <string-name><surname>Padmavathi</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Zero-day attack path identification using probabilistic graph approach based back propagation neural network in cloud</article-title>. <source>Math Stat Eng Appl</source>. <year>2022</year>;<volume>71</volume>:<fpage>1091</fpage>&#x2013;<lpage>106</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Samha</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Malik</surname> <given-names>N</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>D</given-names></string-name>, <string-name><surname>S</surname> <given-names>K</given-names></string-name>, <string-name><surname>Dutta</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Intrusion detection system using hybrid convolutional neural network</article-title>. <source>Mob Netw Appl</source>. <year>2024</year>;<volume>29</volume>(<issue>6</issue>):<fpage>1719</fpage>&#x2013;<lpage>31</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11036-023-02223-6</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ibrahim Hairab</surname> <given-names>B</given-names></string-name>, <string-name><surname>Aslan</surname> <given-names>HK</given-names></string-name>, <string-name><surname>Elsayed</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Jurcut</surname> <given-names>AD</given-names></string-name>, <string-name><surname>Azer</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Anomaly detection of zero-day attacks based on CNN and regularization techniques</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>3</issue>):<fpage>573</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12030573</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hairab</surname> <given-names>BI</given-names></string-name>, <string-name><surname>Said Elsayed</surname> <given-names>M</given-names></string-name>, <string-name><surname>Jurcut</surname> <given-names>AD</given-names></string-name>, <string-name><surname>Azer</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Anomaly detection based on CNN and regularization techniques against zero-day attacks in IoT networks</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>98427</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2022.3206367</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mearaj</surname> <given-names>N</given-names></string-name>, <string-name><surname>Wani</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Zero-day attack detection with machine learning and deep learning</article-title>. In: <conf-name>Proceedings of the 2023 10th International Conference on Computing for Sustainable Global Development (INDIACom); 2023 Mar 15&#x2013;17</conf-name>; <publisher-loc>New Delhi, India. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2023</year>. p. <fpage>719</fpage>&#x2013;<lpage>25</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mohammed</surname> <given-names>M</given-names></string-name>, <string-name><surname>Musa</surname> <given-names>AIA</given-names></string-name></person-group>. <article-title>Enhancing network security using possibility neutrosophic hypersoft set for cyberattack detection</article-title>. <source>Int J Neutrosophic Sci</source>. <year>2024</year>;<volume>25</volume>(<issue>1</issue>):<fpage>38</fpage>&#x2013;<lpage>50</lpage>. doi:<pub-id pub-id-type="doi">10.54216/ijns.250103</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Kim</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Automated profiling-based zero-day malware detection [dissertation]. Commerce, TX, USA: Texas A&#x0026;M University-Commerce</article-title>; <year>2022</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>F</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>RQ</given-names></string-name>, <string-name><surname>Qian</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Towards detection of zero-day botnet attack in IoT networks using federated learning</article-title>. In: <conf-name>Proceedings of the ICC 2023&#x2014;IEEE International Conference on Communications; 2023 May 28&#x2013;Jun 1</conf-name>; <publisher-loc>Rome, Italy. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2023</year>. p. <fpage>7</fpage>&#x2013;<lpage>12</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICC45041.2023.10279423</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>A</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>An active learning framework using deep Q-network for zero-day attack detection</article-title>. <source>Comput Secur</source>. <year>2024</year>;<volume>139</volume>:<fpage>103713</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cose.2024.103713</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shen</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Deep Q-network-based heuristic intrusion detection against edge-based SIoT zero-day attacks</article-title>. <source>Appl Soft Comput</source>. <year>2024</year>;<volume>150</volume>:<fpage>111080</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asoc.2023.111080</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Drozdenko</surname> <given-names>B</given-names></string-name>, <string-name><surname>Powell</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Utilizing deep learning techniques to detect zero day exploits in network traffic flows</article-title>. In: <conf-name>Proceedings of the 2022 IEEE 13th Annual Ubiquitous Computing, Electronics &#x0026; Mobile Communication Conference (UEMCON); 2022 Oct 26&#x2013;29</conf-name>; <publisher-loc>New York, NY, USA. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>163</fpage>&#x2013;<lpage>72</lpage>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akshaya</surname> <given-names>S</given-names></string-name>, <string-name><surname>Padmavathi</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Enhancing zero-day attack prediction: a hybrid game theory approach with neural networks</article-title>. <source>Int J Intell Syst Appl Eng</source>. <year>2024</year>;<volume>12</volume>(<issue>7s</issue>):<fpage>643</fpage>&#x2013;<lpage>63</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peppes</surname> <given-names>N</given-names></string-name>, <string-name><surname>Alexakis</surname> <given-names>T</given-names></string-name>, <string-name><surname>Adamopoulou</surname> <given-names>E</given-names></string-name>, <string-name><surname>Demestichas</surname> <given-names>K</given-names></string-name></person-group>. <article-title>The effectiveness of zero-day attacks data samples generated via GANs on deep learning classifiers</article-title>. <source>Sensors</source>. <year>2023</year>;<volume>23</volume>(<issue>2</issue>):<fpage>900</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s23020900</pub-id>; <pub-id pub-id-type="pmid">36679705</pub-id></mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Popoola</surname> <given-names>SI</given-names></string-name>, <string-name><surname>Ande</surname> <given-names>R</given-names></string-name>, <string-name><surname>Adebisi</surname> <given-names>B</given-names></string-name>, <string-name><surname>Gui</surname> <given-names>G</given-names></string-name>, <string-name><surname>Hammoudeh</surname> <given-names>M</given-names></string-name>, <string-name><surname>Jogunola</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Federated deep learning for zero-day botnet attack detection in IoT-edge devices</article-title>. <source>IEEE Internet Things J</source>. <year>2022</year>;<volume>9</volume>(<issue>5</issue>):<fpage>3930</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3100755</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Priya</surname> <given-names>S</given-names></string-name>, <string-name><surname>Annie Uthra</surname> <given-names>R</given-names></string-name></person-group>. <article-title>An effective deep learning-based variational autoencoder for zero-day attack detection model</article-title>. In: <conf-name>Proceedings of the Inventive Systems and Control; 2021 Jan 7&#x2013;8</conf-name>; <publisher-loc>Coimbatore, India. Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2021</year>. p. <fpage>205</fpage>&#x2013;<lpage>12</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-981-16-1395-1_16</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Roshan</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zafar</surname> <given-names>A</given-names></string-name></person-group>. <article-title>An optimized auto-encoder based approach for detecting zero-day cyber-attacks in computer network</article-title>. In: <conf-name>Proceedings of the 2021 5th International Conference on Information Systems and Computer Networks (ISCON); 2021 Oct 22&#x2013;23</conf-name>; <publisher-loc>Mathura, India. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2022</year>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ISCON52037.2021.9702437</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zahid</surname> <given-names>F</given-names></string-name>, <string-name><surname>Kuo</surname> <given-names>MMY</given-names></string-name>, <string-name><surname>Sinha</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Light-weight slow-rate attack detection framework for resource-constrained industrial cyber-physical systems</article-title>. <source>Comput Secur</source>. <year>2025</year>;<volume>156</volume>:<fpage>104508</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cose.2025.104508</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Danquah</surname> <given-names>LKG</given-names></string-name>, <string-name><surname>Appiah</surname> <given-names>SY</given-names></string-name>, <string-name><surname>Mantey</surname> <given-names>VA</given-names></string-name>, <string-name><surname>Danlard</surname> <given-names>I</given-names></string-name>, <string-name><surname>Akowuah</surname> <given-names>EK</given-names></string-name></person-group>. <article-title>Computationally efficient deep federated learning with optimized feature selection for IoT botnet attack detection</article-title>. <source>Intell Syst Appl</source>. <year>2025</year>;<volume>25</volume>:<fpage>200462</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.iswa.2024.200462</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khadidos</surname> <given-names>AO</given-names></string-name>, <string-name><surname>Khadidos</surname> <given-names>AO</given-names></string-name>, <string-name><surname>Selvarajan</surname> <given-names>S</given-names></string-name>, <string-name><surname>Al-Shehari</surname> <given-names>T</given-names></string-name>, <string-name><surname>Alsadhan</surname> <given-names>NA</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>S</given-names></string-name></person-group>. <article-title>CyberSentry: enhancing SCADA security through advanced deep learning and optimization strategies</article-title>. <source>Int J Crit Infrastruct Prot</source>. <year>2025</year>;<volume>50</volume>:<fpage>100782</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ijcip.2025.100782</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Reddy</surname> <given-names>SPK</given-names></string-name>, <string-name><surname>Nagavelli</surname> <given-names>U</given-names></string-name>, <string-name><surname>Kiran</surname> <given-names>YS</given-names></string-name>, <string-name><surname>Kondoju</surname> <given-names>CS</given-names></string-name>, <string-name><surname>Bushmoni</surname> <given-names>S</given-names></string-name>, <string-name><surname>Yashaswi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Deep learning for zero-day threat detection and mitigation</article-title>. In: <conf-name>Proceedings of the 2024 International Conference on IoT Based Control Networks and Intelligent Systems (ICICNIS); 2024 Dec 17&#x2013;18</conf-name>; <publisher-loc>Bengaluru, India. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2024</year>. p. <fpage>1362</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1109/icicnis64247.2024.10823270</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akshaya</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ganapathi</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Augmenting cyber defense counter to zero-day attacks through predictive analysis: a fusion methodology assimilating game theory and RESNet inspired optimization techniques</article-title>. <source>Int J Commun Netw Inf Secur</source>. <year>2024</year>;<volume>16</volume>(<issue>3</issue>):<fpage>91</fpage>&#x2013;<lpage>104</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abedallah</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zikrillaeva</surname> <given-names>N</given-names></string-name>, <string-name><surname>Gulnora</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Optimizing AI-based automated security patch deployment in IoT devices to combat zero-day exploits and advanced cyber attacks</article-title>. <source>J Cybersecur Inf Manage</source>. <year>2024</year>;<volume>8</volume>(<issue>2</issue>):<fpage>30</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.54216/jcim.130203</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mohamed</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Al-Saleh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>SK</given-names></string-name>, <string-name><surname>Tejani</surname> <given-names>GG</given-names></string-name></person-group>. <article-title>Zero-day exploits detection with adaptive WavePCA-Autoencoder (AWPA) adaptive hybrid exploit detection network (AHEDNet)</article-title>. <source>Sci Rep</source>. <year>2025</year>;<volume>15</volume>(<issue>1</issue>):<fpage>4036</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-025-87615-2</pub-id>; <pub-id pub-id-type="pmid">39900799</pub-id></mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Por</surname> <given-names>LY</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>YL</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ku</surname> <given-names>CS</given-names></string-name>, <string-name><surname>Alizadehsani</surname> <given-names>R</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>An intrusion detection model to detect zero-day attacks in unseen data using machine learning</article-title>. <source>PLoS One</source>. <year>2024</year>;<volume>19</volume>(<issue>9</issue>):<fpage>e0308469</fpage>. doi:<pub-id pub-id-type="doi">10.1371/journal.pone.0308469</pub-id>; <pub-id pub-id-type="pmid">39259729</pub-id></mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abid</surname> <given-names>NJ</given-names></string-name>, <string-name><surname>Alhebaishi</surname> <given-names>N</given-names></string-name>, <string-name><surname>Althaqafi</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Robust zero-day attack detection with optimal deep learning for securing Internet of things environment</article-title>. <source>J Intell Syst Internet Things</source>. <year>2025</year>;<volume>16</volume>(<issue>1</issue>):<fpage>118</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Saurabh</surname> <given-names>K</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>U</given-names></string-name>, <string-name><surname>Mishra</surname> <given-names>A</given-names></string-name>, <string-name><surname>Vyas</surname> <given-names>R</given-names></string-name>, <string-name><surname>Vyas</surname> <given-names>OP</given-names></string-name></person-group>. <article-title>Zero-shot based hybrid neural network system for enhancing zero-day attack detection</article-title>. In: <conf-name>Proceedings of the 2024 IEEE 21st India Council International Conference (INDICON); 2024 Dec 19&#x2013;21</conf-name>; <publisher-loc>Kharagpur, India. Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2024</year>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi:<pub-id pub-id-type="doi">10.1109/INDICON63790.2024.10958486</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Korba</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Diaf</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bouchiha</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Ghamri-Doudane</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Mitigating IoT botnet attacks: an early-stage explainable network-based anomaly detection approach</article-title>. <source>Comput Commun</source>. <year>2025</year>;<volume>241</volume>:<fpage>108270</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2025.108270</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Korba</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Boualouache</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ghamri-Doudane</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Zero-X: a blockchain-enabled open-set federated learning framework for zero-day attack detection in IoV</article-title>. <source>IEEE Trans Veh Technol</source>. <year>2024</year>;<volume>73</volume>(<issue>9</issue>):<fpage>12399</fpage>&#x2013;<lpage>414</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TVT.2024.3385916</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Dhiman</surname> <given-names>G</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>P</given-names></string-name></person-group>. <article-title>An enhanced equilibrium optimizer for solving optimization tasks</article-title>. <source>Comput Mater Contin</source>. <year>2023</year>;<volume>77</volume>(<issue>2</issue>):<fpage>2385</fpage>&#x2013;<lpage>406</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2023.039883</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>The bidirectional gated recurrent unit network based on the inception module (inception-BiGRU) predicts the missing data by well logging data</article-title>. <source>ACS Omega</source>. <year>2023</year>;<volume>8</volume>(<issue>30</issue>):<fpage>27710</fpage>&#x2013;<lpage>24</lpage>. doi:<pub-id pub-id-type="doi">10.1021/acsomega.3c03677</pub-id>; <pub-id pub-id-type="pmid">37546590</pub-id></mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Duan</surname> <given-names>X</given-names></string-name>, <string-name><surname>Cen</surname> <given-names>W</given-names></string-name>, <string-name><surname>He</surname> <given-names>P</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Classification algorithm for DC power quality disturbances based on SABO-BP</article-title>. <source>Energies</source>. <year>2024</year>;<volume>17</volume>(<issue>2</issue>):<fpage>361</fpage>. doi:<pub-id pub-id-type="doi">10.3390/en17020361</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><comment>[cited 2025 Jan 1]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://research.unsw.edu.au/projects/toniot-datasets">https://research.unsw.edu.au/projects/toniot-datasets</ext-link>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tareq</surname> <given-names>I</given-names></string-name>, <string-name><surname>Elbagoury</surname> <given-names>BM</given-names></string-name>, <string-name><surname>El-Regaily</surname> <given-names>S</given-names></string-name>, <string-name><surname>El-Horbaty</surname> <given-names>EM</given-names></string-name></person-group>. <article-title>Analysis of ToN-IoT, UNW-NB15, and edge-IIoT datasets using DL in cybersecurity for IoT</article-title>. <source>Appl Sci</source>. <year>2022</year>;<volume>12</volume>(<issue>19</issue>):<fpage>9572</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app12199572</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>























