<?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">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">63242</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.063242</article-id>
<article-categories>
<subj-group subj-group-type="heading">
   <subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Enhancing Healthcare Data Privacy in Cloud IoT Networks Using Anomaly Detection and Optimization with Explainable AI (ExAI)</article-title>
<alt-title alt-title-type="left-running-head">Enhancing Healthcare Data Privacy in Cloud IoT Networks Using Anomaly Detection and Optimization with Explainable AI (ExAI)</alt-title>
<alt-title alt-title-type="right-running-head">Enhancing Healthcare Data Privacy in Cloud IoT Networks Using Anomaly Detection and Optimization with Explainable AI (ExAI)</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name
name-style="western"><surname>Samriya</surname><given-names>Jitendra Kumar</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>Singh</surname><given-names>Virendra</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>Bathla</surname><given-names>Gourav</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>Malik</surname><given-names>Meena</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>Arya</surname><given-names>Varsha</given-names></name><xref ref-type="aff" rid="aff-5">5</xref><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Alhalabi</surname><given-names>Wadee</given-names></name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<contrib id="author-7" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Gupta</surname><given-names>Brij B.</given-names></name><xref ref-type="aff" rid="aff-8">8</xref><xref ref-type="aff" rid="aff-9">9</xref><xref ref-type="aff" rid="aff-10">10</xref><xref ref-type="aff" rid="aff-11">11</xref><email>bbgupta@asia.edu.tw</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of CSE, Indian Institute of Information Technology</institution>, <addr-line>Sonepat, 131001, Haryana</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Application, Integral University, Lucknow</institution>, <addr-line>226026, Uttar Pradesh</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science and Engineering, GLA University</institution>, <addr-line>Mathura, 281406, Uttar Pradesh</addr-line>, <country>India</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computer Science Engineering, Chandigarh University</institution>, <addr-line>Mohali, 140143, Punjab</addr-line>, <country>India</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Electronic Engineering and Computer Science, Hong Kong Metropolitan University</institution>, <addr-line>Hong Kong SAR, 999077</addr-line>, <country>China</country></aff>
<aff id="aff-6"><label>6</label><institution>Center for Interdisciplinary Research, University of Petroleum and Energy Studies (UPES)</institution>, <addr-line>Dehradun, 248007, Uttarakhand, </addr-line> <country>India</country></aff>
<aff id="aff-7"><label>7</label><institution>Immersive Virtual Reality Research Group, Department of Computer Science, King Abdulaziz University</institution>, <addr-line>Jeddah, 22254</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-8"><label>8</label><institution>Department of Computer Science and Information Engineering, Asia University</institution>, <addr-line>Taichung, 41354</addr-line>, <country>Taiwan</country></aff>
<aff id="aff-9"><label>9</label><institution>Symbiosis Centre for Information Technology (SCIT), Symbiosis International University</institution>, <addr-line>Pune, 412115, Maharashtra</addr-line>, <country>India</country></aff>
<aff id="aff-10"><label>10</label><institution>School of Cybersecurity, Korea University</institution>, <addr-line>Seoul, 02841</addr-line>, <country>Repbulic of Korea</country></aff>
<aff id="aff-11"><label>11</label><institution>Department of Medical Research, China Medical University Hospital, China Medical University</institution>, <addr-line>Taichung, 404327</addr-line>, <country>Taiwan</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Brij B. Gupta. Email: <email>bbgupta@asia.edu.tw</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>03</day><month>07</month><year>2025</year>
</pub-date>
<volume>84</volume>
<issue>2</issue>
<fpage>3893</fpage>
<lpage>3910</lpage>
<history>
<date date-type="received">
<day>09</day>
<month>1</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>5</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_CMC_63242.pdf"></self-uri>
<abstract>
<p>The integration of the Internet of Things (IoT) into healthcare systems improves patient care, boosts operational efficiency, and contributes to cost-effective healthcare delivery. However, overcoming several associated challenges, such as data security, interoperability, and ethical concerns, is crucial to realizing the full potential of IoT in healthcare. Real-time anomaly detection plays a key role in protecting patient data and maintaining device integrity amidst the additional security risks posed by interconnected systems. In this context, this paper presents a novel method for healthcare data privacy analysis. The technique is based on the identification of anomalies in cloud-based Internet of Things (IoT) networks, and it is optimized using explainable artificial intelligence. For anomaly detection, the Radial Boltzmann Gaussian Temporal Fuzzy Network (RBGTFN) is used in the process of doing information privacy analysis for healthcare data. Remora Colony Swarm Optimization is then used to carry out the optimization of the network. The performance of the model in identifying anomalies across a variety of healthcare data is evaluated by an experimental study. This evaluation suggested that the model measures the accuracy, precision, latency, Quality of Service (QoS), and scalability of the model. A remarkable 95% precision, 93% latency, 89% quality of service, 98% detection accuracy, and 96% scalability were obtained by the suggested model, as shown by the subsequent findings.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Healthcare</kwd>
<kwd>data privacy analysis</kwd>
<kwd>anomaly detection</kwd>
<kwd>cloud IoT network</kwd>
<kwd>explainable artificial intelligence</kwd>
<kwd>temporal fuzzy network</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>King Abdulaziz University</funding-source>
<award-id>RG-6-611-43</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Nowadays, the healthcare industry has shifted from a hospital-centric model to a patient-centric approach, to empower individuals to control their health decisions for better management. Trending features in cloud and edge networks along with advancements in AI, IoT, and big data, derive and facilitate this transformation. Precisely, digital health are equipped with smart sensors that can produce better business insights with the help of real-time predictive models. Healthcare 4.0 focuses on a patient-centric approach leveraging a sensor-based technology to provide continuous health monitoring to collect real-time data followed by analysis using advanced tools. This empowers healthcare providers to offer more personalized care, making informed decisions through precise and current insights into the patient&#x2019;s health status.</p>
<p>While this industry has aligned patient care activities with the Healthcare 4.0 vision, it is developing new standards [<xref ref-type="bibr" rid="ref-1">1</xref>]. Healthcare 5.0 integrates intelligent control systems, augmented and virtual reality with various identifiable healthcare analytics and 3-D view models. Therefore, personalized analytics and comprehensive healthcare would drive ingenious business proposals in the medical domain. Medical science technology anticipates that millions of Internet of Things (IoT)-based sensors will be networked and interact over fifth-generation (5G) network infrastructure to enable digital wellness, smart healthcare, enhanced healthcare metrics in the context of Healthcare 5.0. Intelligent wearables are connected with mobile communication as well as medical methods for convenient and inaccessible healthcare deliverance in a scenario made possible by 5G, IoT, and AI [<xref ref-type="bibr" rid="ref-2">2</xref>]. Major methods such as IoT from the foundation for a number of emerging applications in the fields of smart manufacturing, transportation systems, and health care. IoT uses various sensors to collect data about people, things, and the environment. This data is regularly sent to the cloud server, enabling application managers to take a variety of actions aimed at enhancing application performance. Based on the gathered data, AI approaches can also be used to operate the apps. One of the main uses of IoT is in healthcare, where patients wear devices to collect vital signs data [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. Body measurements like blood pressure, sugar level, heart rate, oxygen saturation, and so on are examples of this type of data. These crucial measurements cannot be continuously collected and delivered to the cloud for processing without the use of IoT. Consequently, IoT-enabled health care is a significant use case that has a profound effect on people&#x2019;s lives. Healthcare predictive modeling can be intricate, counterintuitive, and frequently difficult to understand. Artificial intelligence can now function swiftly and well and is widely utilized in various fields. The influence of machine learning algorithms&#x2019; evolving processes and optimization to tackle a variety of issues in the healthcare industry, that enables AI usage in medical imaging as a central domain for research attention transforms diagnostic procedures, for more accurate disease detection like cancer, neurological disorders, and cardiovascular diseases [<xref ref-type="bibr" rid="ref-5">5</xref>]. Nevertheless, deep learning algorithm-based AI lacks transparency, leaving doctors confused about the symptoms of a diagnosis. So, how to present strong proof of the answers is a crucial query. However, a gap still exists between AI models and human understanding termed &#x201C;black-box&#x201D; transparency. Significant research is ongoing to improve clinical reliance on the use of AI models. For instance, in 2015, the US Defence Advanced Research Projects Agency (DARPA) created the explainable AI (ExAI) concept. Subsequently, in 2021, a trust AI project demonstrated that the ExAI may be applied to interdisciplinary application challenges in computer science, psychology, and statistics and may offer answers that boost users&#x2019; trust [<xref ref-type="bibr" rid="ref-6">6</xref>]. A robust scheme is essential to improvise predictive methods for explainability in the healthcare domains that may result in advanced patient care. In certain therapeutic settings, such as radiology, AI cna facilitate doctors in optimal choice and may better overtake human intelligence. By collaborating with healthcare professionals to develop relevant clinical questions, advanced AI algorithms can reveal clinically important information hidden within large volumes of healthcare data. AI applications are trained to predict particular results for a set of characteristics. This method helps to gain deep insights to get significant attention to recent advances in deep learning. In DL, NN with multiple hidden layers examines higher convoluted patterns to improve prognostic accuracy.</p>
<p>Several challenges may arise while interpreting the prediction outcomes and a functional explanation of artificial intelligence applications. It is challenging to monitor Deep Learning due to the lack of transparency in the decision-making stage and frequently described as an opaque model [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>].</p>
<p>This work provides the following significant contributions:</p>
<p>To suggest a unique technique for identifying anomalies in cloud IoT networks utilize explainable artificial intelligence and integrate privacy analysis of healthcare data. Here, the radial Boltzmann Gaussian temporal fuzzy network was used for anomaly detection in the healthcare data privacy invextigation. Next, remora colony swarm optimization was used to assess network optimization.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>Numerous medical diseases and applications use predictive modeling using sophisticated AI and ML techniques. To optimize long-term outcomes for the patients with type 1 diabetes, work [<xref ref-type="bibr" rid="ref-9">9</xref>] suggested using reinforcement learning to learn and suggest a sequential course of treatment that includes insulin and oral antidiabetic medications. Author [<xref ref-type="bibr" rid="ref-10">10</xref>] suggested modeling the intricate relationships between diseases using high-order networks. The suggested approach is utilized to replicate disease trajectories as well as forecast disease states in type 2 diabetes. It outperforms first-order network, according to the results. Rathee et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] present a Zero Trust Blockchain Architecture designed for decentralized e-health Cyber-Physical Systems (CPS) to enhance security, storage, and real-time patient monitoring. A dilated recurrent neural network (DRNN) was proposed in study [<xref ref-type="bibr" rid="ref-12">12</xref>] to predict type 1 diabetes patients&#x2019; future blood glucose levels. To identify diabetic retinopathy from retinal fundus images, work [<xref ref-type="bibr" rid="ref-13">13</xref>] built DL algorithms and discovered that they achieved great sensitivity and specificity. Using an annotation tool, a panel of ophthalmologists rated the photographs. Yaqoob et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] looked at the safety concerns related to treating sepsis and used the deep reinforcement learning approach to find the best course of action. To determine the optimal reward functions out of a set of seemingly optimal treatment trajectories, the work proposed in [<xref ref-type="bibr" rid="ref-15">15</xref>] provides a Mini-Tree (DIRL-MT) method using deep inverse reinforcement learning. The simultaneity of organ dysfunction was identified by the author [<xref ref-type="bibr" rid="ref-16">16</xref>] using a network-based model, which helps forecasting sepsis as well as the survival of those who experience it. A common metric for assessing the effectiveness of health services is the hospital readmission rate. Enhancing communication and care coordination is the aim of the Hospital Readmissions Reduction Program (HRRP) to lower preventable readmission rates. To predict the hospital readmission of diabetic patients, work [<xref ref-type="bibr" rid="ref-17">17</xref>] presented a deep learning model that combines deep forest and wavelet transform. Wei et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] introduce SM-UNet, a deep learning model designed for real-time medical image segmentation by integrating CNN and MLP architectures. A generalized taxonomy of ExAI is presented by the authors in [<xref ref-type="bibr" rid="ref-19">19</xref>] based on present issues and potential future developments. The suggested taxonomy combines the examined taxonomies, ExAI database methods, and decision tree methods to determine which taxonomy is most appropriate for the intended uses. A cloud-based, DL multi-modal method for ECG pattern detection using a 6G communication network is proposed by authors in [<xref ref-type="bibr" rid="ref-20">20</xref>]. Authors in [<xref ref-type="bibr" rid="ref-21">21</xref>] suggest an intrusion detection technique based on Sequential Online ELM. ELM is a NN with strong generalisability and high training speed. An advancement of ELM networks, known as OS-ELM, was created expressly to handle cloud services, incorporating multi-category detection into the process. Sadly, this makes it more difficult to detect attacks such as privilege escalation and probing. Convolutional neural networks (CNNs) were first designed to classify images; however, reference [<xref ref-type="bibr" rid="ref-22">22</xref>] proposed employing CNNs as an in-router multi-category network attack classifier. The approach was validated using public data from NSL-KDD and UNSW-NB15. Nevertheless, the suggested study does not address the IoT environment. Tewari &#x0026; Gupta [<xref ref-type="bibr" rid="ref-23">23</xref>] resent a secure and low-cost mutual authentication protocol for IoT-based healthcare systems, ensuring strong location privacy. Inuwa &#x0026; Das [<xref ref-type="bibr" rid="ref-24">24</xref>] proposed Vector Convolutional Deep Learning, a CNN variation, to detect anomalies in IoT data. Two novel qualities, Correlated-Set Thresholding and DT were introduced by [<xref ref-type="bibr" rid="ref-25">25</xref>]. They are based on ML and were developed specifically for the Raspberry Pi. The approach is evaluated using the available Bot-IoT dataset, no conclusions are drawn regarding benign classification. Hossain et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] introduced a new attribute selection technique. The new method uses a wrapper strategy to choose relevant attributes for the machine learning approach and accurately filters them using the AUC. The proposed strategy is validated using four distinct ML techniques and the Bot-IoT dataset. Gupta et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] examine the challenges of big data management in B2B-based healthcare systems and explore its potential benefits, such as improved patient access, efficiency in data transmission, and enhanced care quality. 98.8% classification accuracy has been achieved in the detection as well as physiological data classification, like ECG, for heartbeat using a support vector machine (SVM) along with discrete wavelet transform (DWT) [<xref ref-type="bibr" rid="ref-28">28</xref>]. Vector size is the work&#x2019;s limitation in such cases. The shift-invariance aspect of the DWT approach, which influences classification accuracy and performance, is absent from this work. Encrypted approaches like watermarking have been investigated about other elements, such as the security of industrial IoT-based healthcare, to prevent theft. This work does not emphasize the effective data management strategy. In IoT-based healthcare, a significant volume of data gathered by body sensors needs to be appropriately managed. Big data analytics approaches have been implemented in healthcare organizations as a result. R-peak is identified from an ECG signal to detect arrhythmias in a related study. Techniques from random forests and CNN have been used for categorization. Combining the frequency domain (FS2) and temporal (FS1) data has increased classification accuracy of automatic arrhythmia identification [<xref ref-type="bibr" rid="ref-29">29</xref>]. DTCWT as well as random forest classifier were used for classification. In this work, the accurate labeling of ECG data is crucial to the training process. To identify any irregularities in heartbeats, a hybrid deep CNN method can identify as well as categorise various heartbeats using real-time ECG data. Three neural network architectures have been trained using an ECG dataset for an entropy-based ECG categorization. To improve computational efficiency, there are three types of architectures: CNN-based, SincNet-based, and CNN-based with entropy induction. A method for increasing classification accuracy when there is a shortage of training data is provided in reference [<xref ref-type="bibr" rid="ref-30">30</xref>]. They used a two-dimensional residual network (2D-ResNet) in conjunction with the Stockwell transform (ST) approach.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Healthcare Data Privacy Analysis Based Anomaly Detection in Cloud IoT Network</title>
<p>ExAI is a branch of AI that strives to ensure the decisions made by AI systems are expliciate and aligned with human reasoning. The main priority in this context is building an AI system that ensures transparent and clear results, a factor that becomes particularly important in healthcare. Knowing the logic behind decisions is essential for impacting patient care and building trust effectively. ExAI helps to supply an apprehensible description to provide simplified knowledge for all the stakeholders like patients, doctors, etc. Its main strategy is to identify multiple methods for designing a collection of models that will help future innovators to minimize the trade off between system performance and its explainability.</p>
<p>As the healthcare database expands, it opens up several possibilities for AI solutions. Errors in medical procedures pose a significant challenge in this field due to the reliance on numerous medical devices, and various algorithms have been deployed to recognize and resolve these errors like erratic readings, deviant health conditions, etc. However, these methods fail to address the reason for considering it an anomaly. AI-based anomaly detection improves patient outcomes by identifying of several issues at an early stage and facilitates fast intercession along with controlling bogus anomaly alarms.</p>
<p>The suggested Anomaly Detection (AD) paradigm based on a cloud IoT network is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. To implement the proposed model for anomaly detection and privacy preservation, we used three datasets, the DARPA dataset [<xref ref-type="bibr" rid="ref-31">31</xref>], the CAIDAS dataset [<xref ref-type="bibr" rid="ref-32">32</xref>], and the DEFCON [<xref ref-type="bibr" rid="ref-33">33</xref>] dataset in the healthcare sector. Wearable glucose meters and smartwatches are only two examples of smart IoT devices that collect data, and each of the N participants has their own locally stored dataset. The dataset&#x2019;s samples are labeled to distinguish between &#x201C;normal&#x201D; and &#x201C;abnormal&#x201D; findings. After each participant trains a local model, the federated cloud server receives the model weights. Consequently, the weights from each participant&#x2019;s local model are sent to this server. It then compiles these weights according to specific criteria (such as the user&#x2019;s age or the name of their ailment) and returns the results to the participants as a global weight.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Proposed healthcare data privacy analysis based anomaly detection in cloud IoT network</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63242-fig-1.tif"/>
</fig>
<p>The system works as follows: it is made up of edge devices, gateways, a cloud database with users, and a remote IoT platform. For decentralized optimization, a collection of IoT devices initially communicates with the gateway. Transmission frequencies are iteratively determined throughout the optimization process considering the system resource limitations defined at the gateway. Transmitting data streams from devices to a cloud database by determining optimal transmission frequency via gateway as well as IoT platform after transmission frequencies have converged and been allotted locally. Using particular cloud-based applications, users can visualize data flows. We took into account the following description of the problem mathematically <xref ref-type="table" rid="table-1">(1)</xref> and <xref ref-type="table" rid="table-1">Table 1</xref> presents the abbreviations used in the paper:</p>

<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" 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></mml:mi><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</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:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>such that&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</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:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</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:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</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>&#x2264;</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> indicates the amount to be transmitted by device &#x2018;<italic>i</italic>&#x2019;, in a specific period, <italic>c</italic> presents the highest writing frequency (MWF) to the database, &#x2018;<italic>d</italic>&#x2019; refers to available storage capacity in a specific period, the utility function <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> presents flow writing frequency as <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> for <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> device. Here, <italic>d</italic> and <italic>c</italic> both are finite resources where set having <italic>N</italic> different devices want to solve optimization problems cooperatively in order to determine their optimal <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>. The best possible solution for every given device in the network depends on a combination of various system-level factors (<italic>N</italic>, <italic>c</italic>, and <italic>d</italic>) and user-defined information (<inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>). This work develops and offers an innovative anomaly detection model termed Radial Boltzmann Gaussian temporal fuzzy network (RBGTFN) in <xref ref-type="sec" rid="s4">Section 4</xref> to secure healthcare data. In the next phase, the Swordfish algorithm is applied to optimize the network performance in <xref ref-type="sec" rid="s5">Section 5</xref>. The simulation analysis and results comparison are present in <xref ref-type="sec" rid="s6">Sections 6</xref> and <xref ref-type="sec" rid="s7">7</xref>, showcasing primary outcomes and implications of the study.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Abbreviation table</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Abbreviation</th>
<th>Full form</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Decision variable for device <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>c</mml:mi></mml:math></inline-formula></td>
<td>Maximum writing frequency (MWF) to the database</td>
</tr>
<tr>
<td><inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>d</mml:mi></mml:math></inline-formula></td>
<td>Available storage capacity in a specific period</td>
</tr>
<tr>
<td><inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Utility function of device <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Amount of data to be transmitted by device <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>Z</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Partition function in the probability distribution</td>
</tr>
<tr>
<td><inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Energy function in Deep Boltzmann Machine (DBM)</td>
</tr>
<tr>
<td><inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Probability distribution function</td>
</tr>
<tr>
<td><italic>W</italic></td>
<td>Weight matrix in neural network models</td>
</tr>
<tr>
<td><inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>b</mml:mi></mml:math></inline-formula></td>
<td>Bias term in neural network models</td>
</tr>
<tr>
<td><inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula></td>
<td>Activation function</td>
</tr>
<tr>
<td><inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
<td>Weight update term for first hidden layer in DBM</td>
</tr>
<tr>
<td><inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
<td>Weight update term for second hidden layer in DBM</td>
</tr>
<tr>
<td><italic>D</italic></td>
<td>Food separation distance in Remora Colony Swarm Optimization</td>
</tr>
<tr>
<td><inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>a</mml:mi></mml:math></inline-formula></td>
<td>Random number for position update in Remora algorithm</td>
</tr>
<tr>
<td><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>b</mml:mi></mml:math></inline-formula></td>
<td>Coefficient for controlling position update in Remora algorithm</td>
</tr>
<tr>
<td><inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Pheromone level between city <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>i</mml:mi></mml:math></inline-formula> and city <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>j</mml:mi></mml:math></inline-formula> in ACO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Heuristic value in Ant Colony Optimization (ACO)</td>
</tr>
<tr>
<td><inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula></td>
<td>Pheromone evaporation rate in ACO</td>
</tr>
<tr>
<td><italic>Q</italic></td>
<td>Constant in ACO for pheromone update</td>
</tr>
<tr>
<td><inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>L</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Tour length in ACO for <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>k</mml:mi></mml:math></inline-formula>th ant</td>
</tr>
<tr>
<td><inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Velocity of particle <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>i</mml:mi></mml:math></inline-formula> in PSO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Position of particle <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>i</mml:mi></mml:math></inline-formula> in PSO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>w</mml:mi></mml:math></inline-formula></td>
<td>Inertia weight in PSO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula></td>
<td>Acceleration coefficients in PSO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mtext>rand</mml:mtext><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mtext>rand</mml:mtext><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula></td>
<td>Random numbers in PSO</td>
</tr>
<tr>
<td><inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula></td>
<td>Lagrange multipliers</td>
</tr>
<tr>
<td><inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>g</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Constraint functions in the optimization problem</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4">
<label>4</label>
<title>Radial Boltzmann Gaussian Temporal Fuzzy Network (RBGTFN) in Anomaly Detection</title>
<p>Due to the duplication, polymorphism, and incompleteness in health big data, the conventional supervised learning technique must perform feature selection and preprocessing before training the classifier. The process of analyzing data from the viewpoint of observation space is known as manifold analysis. To reduce the impact of specific isolated points on the AP algorithm, the data set is clustered according to the concept of neighborhood and the threshold of the gap between classes. The clusters with fewer samples in the class are then deleted. The following illustrates the RBF network design and training strategy created for the categorization of bipolar disorder. Within this approach, we have created two classes: BD for bipolar disorders, and CN for control patients. The structure consists of three layers: an input layer, a linear output layer, hidden layer including a non-linear RBF activation function. <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> displays the sth node&#x2019;s activity, s(p), which stands for the Euclidean norm.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mo>&#x2225;</mml:mo><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mi>p</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>&#x2225;=</mml:mo><mml:msqrt><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>where the input vector is denoted by pT &#x003D; [p1, p2, . . . , pM], and the center of the sth node is represented by pn T s &#x003D; h pn T s,1, pn, T s,2, . . . pn T s, M i. A radial symmetric function was applied to the node output. Moreover, a Gaussian function may be used:</p>
<p><inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mfrac><mml:mi>z</mml:mi><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mrow></mml:msup></mml:math></inline-formula> where the node&#x2019;s width is represented by w 2 s. A set of well-known inputs as well as outputs presented as (pk; fk) where (k &#x003D; 1, 2, . . . , K) were utilized to train NN. The neural network in the suggested system was trained in two stages: 1. Hidden layer&#x2019;s parameters, cs(p), were first computed; 2. The hidden layer&#x2019;s parameters are derived from junction weights connecting the hidden layer and to the output. Input space&#x2019;s FP, where several fuzzy sets were described for every input variable, was employed by the suggested approach. For its input pj (j &#x003D; 1, 2, . . . , M), the novel RBF approach applied a uniform split of discourse universe into cj fuzzy sets F 1 j, F 1 j, . . . , F cj j with functions of form as follows by <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msubsup><mml:mi>F</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>|</mml:mo></mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</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:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is half of the corresponding width and <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is vital, and the membership value of the unit is set. For every input variable, the correspondence degrees at each given location in context to approaches 1. After exanimating the <italic>k</italic> &#x02212; 1 input vectors, <italic>S</italic> diffuse subspaces are created, where 1 <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mo>&#x2264;</mml:mo></mml:math></inline-formula> <italic>S</italic> <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mo>&#x2264;</mml:mo></mml:math></inline-formula> <italic>k</italic> &#x02212; 1. After inserting the <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> input vector, <italic>p</italic>(<italic>k</italic>), Euclidean relative distances <italic>zls</italic> (<italic>p</italic>(<italic>k</italic>)) (s &#x003D; 1, . . . , S) between <italic>p</italic>(<italic>k</italic>) and each fuzzy subspace <italic>S</italic> generated by <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> are determined.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>z</mml:mi><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mi>r</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mfrac><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo>[</mml:mo><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>M</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mfrac></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><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>M</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Examine the combined probability distribution of the energy function E for the DBM that comprises two hidden layers, <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, and one visible layer. Below is the probability distribution by <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>.
<disp-formula id="ueqn-5"><mml:math id="mml-ueqn-5" display="block"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>Z</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>;</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>b</mml:mi></mml:math></disp-formula></p>
<p>By contrasting with alternative generative models, DBM offers a bipartition structure for the categorization of spectral-spatial images. Each neighboring layer uses the Bernoulli parameter to determine the DBM condition distribution, causing each unit&#x2019;s distribution to be active. Most classification in deep learning models involves an autoencoder for feature extraction. It includes encoders as well as decoders in its structure and matrix multiplication is applied in both. The normalizing function is the encoder&#x2019;s gradient function. Following the correction of weights and biases in the autoencoder, the network&#x2019;s training is carried out by <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.
<disp-formula id="ueqn-7"><mml:math id="mml-ueqn-7" display="block"><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mtext>&#xA0;where&#xA0;</mml:mtext></mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:math></disp-formula></p>
<p>Examine the following example of training an HSI datacube that has two hidden layers by <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>n</mml:mi><mml:mo>;</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Below is the mean-field value by <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>h</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:munder><mml:mi>Q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where the following is the Gibbs energy by <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>.
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>Z</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-10">Eqs. (10)</xref> and <xref ref-type="disp-formula" rid="eqn-11">(11)</xref> provide the weight change and are used to calculate the new weight value. Every layer uses the bias b &#x003D; 0.
<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:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" 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:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The DBM&#x2019;s suggested bipartition structure enables Gibbs sampling, which updates a single variable at a time, contrasting CNN. Accurate classification of images in spatial-spectral variations is thus made possible. Two update blocks can be created from one image patch using Gibbs sampling. It requires n &#x003D; L &#x002B; 1 maximum possible limits for each image patch in the l layer. There are two hidden processing layers. Therefore, each layer was sampled independently and concurrently. First, we investigate the scenario when <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>l</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> follow Gaussian Processes as a realistic illustration of the framework (1). Please take note that this formulation only serves to connect our framework to current multi-task general practitioners that each patient uses a unique GP. By the end of this subsection, it should be evident that when the number of patients increases, this direction of individualization will need nearly unmanageable computations. In particular, the two halves are shown as follows by <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>g</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:mrow><mml:mo>&#x223C;</mml:mo><mml:mi>G</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2018;</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>l</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x223C;</mml:mo><mml:mi>G</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2018;</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>k</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>k</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are appropriate covariance functions, such as the squared exponential kernel (RBF), and we assume that both GPs have a zero mean for simplicity. Knowledge sharing takes place using the global GP covariance function <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>k</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Assuming further that <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>l</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are independent for every patient, we can construct the overall covariance function as follows by <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>.
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo>&#x02D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where the Kronecker delta function, denoted by <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula><sub><italic>ij</italic></sub>, is as follows: <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula><sub><italic>ij</italic></sub> &#x003D; 1 for the same patient if <italic>i</italic> &#x003D; <italic>j</italic>, and 0 otherwise. It&#x2019;s interesting to note that for all function variables f(1), <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mo>&#x22EF;</mml:mo></mml:math></inline-formula>, and f(P), personalized GPs from this construction really reduce to a single GP with the covariance function <sup>&#x223C;</sup><italic>k</italic><inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> by <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>.
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center center center center center center center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mtext mathvariant="bold">f</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mtext mathvariant="bold">f</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x223C;</mml:mo><mml:mrow><mml:mi>&#x1D4A2;</mml:mi><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center center center center center center center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>K</mml:mi><mml:mrow><mml:mn>14</mml:mn></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msubsup><mml:mi>K</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>K</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msubsup><mml:mi>K</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>To be more precise, we consider <italic>l</italic><sup>(<italic>i</italic>)</sup> to be GP and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x22C5;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> to be a deep network as follows by <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>.
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi>g</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:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</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:mrow><mml:mo>,</mml:mo><mml:msup><mml:mi>l</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><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:mrow><mml:mo>&#x223C;</mml:mo><mml:mrow><mml:mi>&#x1D4A2;</mml:mi><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><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:mi>x</mml:mi><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Both the individual function <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msup><mml:mi>l</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and the shared function <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> have desired qualities of their own. <italic>X &#x003D;</italic> <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mi>n</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> indicates vector set of <italic>n</italic> elements and <italic>X</italic> indicates a random vector. A feature vector with k dimensions, or each <italic>x<sub><italic>h</italic></sub></italic>, is taken from the patient data that was submitted. There is statistical independence among those vectors. Given the model <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>, the probability distribution of the set <italic>X</italic> can be written as <xref ref-type="disp-formula" rid="eqn-16">Eq. (16)</xref>.
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>h</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:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Due to the fact that these vectors&#x2019; distributions are unknown. Thus, a combination of Gaussian probability distributions, that is calculated as weighted sum of <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>l</mml:mi></mml:math></inline-formula> component densities using the <xref ref-type="disp-formula" rid="eqn-17">Eq. (17)</xref>.
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>As <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>, where <italic>w<sub><italic>i</italic></sub></italic> denotes the mixture weight and <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>N</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the density of the <italic>k</italic>-th Gaussian component with mean vector <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and covariance matrix <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder></mml:math></inline-formula>, <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> serves as the prototype composed of a set of model parameters. For the random vector <italic>X</italic> or the extracted feature vectors, the probability distribution is given by <xref ref-type="disp-formula" rid="eqn-18">Eq. (18)</xref>.
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi mathvariant="normal">&#x03A0;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> in this case The component <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is now transposed as <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>/, while the inverse of (<inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:math></inline-formula>) is <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. In contrast, the doctor cluster <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>C</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>C</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> is represented by the typical GMM model <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>G</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>G</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>, i.e., the Gi model, which describes Ci cluster. Let G&#x002A; represent the Gaussian Mixture Model (GMM) for each patient whose data was entered via the Android app. <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mfrac><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi></mml:mfrac><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2248;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mfrac><mml:mi>X</mml:mi><mml:mi>&#x03BB;</mml:mi></mml:mfrac><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the probability function that stock parameter vector as well as data vector. Initialization will work for components like the convolutional and fuzzy neural networks. The weights between each layer are found at the bottom. We will then prepare the classification function as well as the hybridization. Every node&#x2019;s bias (b) is set to zero. Following this, the weight between the layers is initialized according to the rule, and it is provided as <xref ref-type="disp-formula" rid="eqn-19">Eq. (19)</xref>.
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msqrt><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:msqrt></mml:mfrac><mml:mo>,</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msqrt><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:msqrt></mml:mfrac><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> is the <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> level, and <italic>Un</italic> is the even dispersal. <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> determines number of nodules on final levels of fuzzy as well as convolutional features for the hybridization level.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Remora Colony Swarm Optimization (RCSO)</title>
<p>The global search is carried out by the ROA using the SFO approach, which is based on the elite technique employed in the swordfish algorithm. The following is an expression for the position updating <xref ref-type="disp-formula" rid="eqn-20">Formula (20)</xref>:
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><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>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>best&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>best&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>rand&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>rand&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>And <italic>V</italic><sub><italic>i</italic></sub>(<italic>t</italic>&#x002B;1) indicates the position of ith remora&#x2019;s candidate. The best position as of right now is <italic>X</italic><sub>best</sub>(<italic>t</italic>). Remora&#x2019;s random position is denoted by <italic>X</italic><sub>rand</sub>(<italic>t</italic>). Iteration number <italic>t</italic> is what we&#x2019;re talking about. A random number between 0 and 1 is called a rand. Furthermore, remora can to switch hosts based on its experiences by <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:msubsup><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><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>=</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>And <italic>V</italic><sub><italic>i</italic></sub><sup>&#x2032;</sup>(<italic>t</italic> &#x002B; 1), indicates the position of ith remora&#x2019;s candidate. Its prior location is represented using <italic>X<sub><italic>i</italic></sub>(t)</italic>. Also, &#x02018;randn&#x2019; is used to generate an accurately distributed random number. The WOA bubble-net assault technique is utilized. These are the updated position updating formulas with modifications by <xref ref-type="disp-formula" rid="eqn-22">Eq. (22)</xref>:
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" 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:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>a</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>best&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>D</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>best&#xA0;</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>a</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>b</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mfrac><mml:mi>t</mml:mi><mml:mi>T</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>D</italic> indicates food separation from the remora. It is evident from <xref ref-type="disp-formula" rid="eqn-22">Eq. (22)</xref> that an is a random number between &#x2212;2 and 1. Additionally, b drops linearly from &#x2212;1 to &#x2212;2. Ants use their avarice to choose which towns to visit according to the number and distance of pheromones between them. The shortest path is considered to be the optimal answer in this iterative procedure. <xref ref-type="disp-formula" rid="eqn-23">Eq. (23)</xref> is used to select the city <italic>j</italic> that an ant in city <italic>i</italic> will travel to in iteration <italic>t</italic>.
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:munder><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:mi>j</mml:mi><mml:mrow><mml:mtext>&#xA0;is allowed city&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-24">Eq. (24)</xref> uses <italic>ij</italic> and (1/<italic>dij</italic>) to represent the number of pheromones and distance respectively between <italic>i</italic> and <italic>j</italic> cities, <italic>j</italic> to illustrate the cities that may be travelled by <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> ant. Ants in the typical ACO updates pheromones on their trail to a food source before making a probabilistic decision based on transition probability. The transition probability for <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> ant at time step <italic>t</italic> from City <italic>i</italic> to City <italic>j</italic> in the TSP problem is written as follows:
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:munder><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if&#xA0;</mml:mtext></mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The pheromone trails are updated once each ant has finished a tour by first decreasing them at a consistent rate of evaporation and then enabling every ant to drop pheromone over the arcs belonging to its tour, shown 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:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula> is the rate at which the pheromone trail evaporates (0 &#x003C;&#x003C; 1) and <italic>M</italic> is the total number of ants. <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula> value allows the algorithm to &#x201C;forget&#x201D; past incorrect decisions and prevent the pheromone trails from building up infinitely. The corresponding pheromone strength on arcs that are not chosen by the ants decreases exponentially with many iterations. The amount of trial substance placed on edge <italic>(i, j)</italic> by <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> ant, expressed as a quantity per unit of length <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, is described as follows by <xref ref-type="disp-formula" rid="eqn-26">Eq. (26)</xref>:
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mfrac><mml:mi>Q</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;if ant&#xA0;</mml:mtext></mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mtext>&#xA0;uses edge&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#xA0;in its tour&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#xA0;otherwise&#xA0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <italic>Q</italic> is a preset constant and <italic>L<sub><italic>k</italic></sub></italic> represents tour length. PSO the algorithm runs iteration by iteration, comparing the solutions generated in each iteration against the global best of the swarm and the self-local best. The following equations are utilized to evaluate the new position of the particle given its velocity (V), number (N), and vector (X) of particles by <xref ref-type="disp-formula" rid="eqn-27">Eq. (27)</xref>:
<disp-formula id="ueqn-29"><mml:math id="mml-ueqn-29" 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:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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>=</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi><mml:mi>b</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>g</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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 stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x22EF;</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>In the interval [0, 1], two random numbers are evenly distributed, and <italic>rand</italic><sub>1</sub> and <italic>rand</italic><sub>2</sub> reflect the relative influence of the social and cognitive components (learning elements) based on these determinations. The inertia weight, or <italic>w</italic>, parameter regulates how much the velocities from before affect the current one. We now recast the original optimization issue <xref ref-type="disp-formula" rid="eqn-28">(28)</xref> in the following way to adhere to mathematical conventions:
<disp-formula id="eqn-28"><label>(28)</label><mml:math id="mml-eqn-28" 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></mml:mi><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22EF;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</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:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><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:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mtext>&#xA0;s. t.&#xA0;</mml:mtext></mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</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:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</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:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where the function <italic>f</italic><sub><italic>i</italic></sub>(<italic>x</italic><sub><italic>i</italic></sub>) &#x003D; &#x02212;<italic>h</italic><sub><italic>i</italic></sub>(<italic>x</italic><sub><italic>i</italic></sub>) is convex. The following is how (3)&#x2019;s Lagrange equation is displayed in <xref ref-type="disp-formula" rid="eqn-29">Eq. (29)</xref>:
<disp-formula id="eqn-29"><label>(29)</label><mml:math id="mml-eqn-29" display="block"><mml:mrow><mml:mtext mathvariant="bold">L</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</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:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>and for optimality, the KKT criteria demand that the following hold true by <xref ref-type="disp-formula" rid="eqn-30">Eq. (30)</xref>:
<disp-formula id="eqn-30"><label>(30)</label><mml:math id="mml-eqn-30" 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:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mtext mathvariant="bold">L</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi mathvariant="normal">&#x2202;</mml:mi></mml:math></inline-formula> is operation of partial derivative, <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> are Lagrange coefficients for <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><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>c</mml:mi><mml:mtext>&#xA0;and&#xA0;</mml:mtext><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><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>d</mml:mi></mml:math></inline-formula> which represents constraint in issue with <xref ref-type="disp-formula" rid="eqn-31">Eq. (31)</xref>:
<disp-formula id="eqn-31"><label>(31)</label><mml:math id="mml-eqn-31" 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:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>d</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Due to system limitations, the optimal converged solution will fall into any of the subsequent scenarios.</p>
</sec>
<sec id="s6">
<label>6</label>
<title>Simulation Analysis</title>
<p>Experimental setup-Version 3.1 was used to examine and monitor the situation, and the configuration was done using virtual machines-based open-source broker software packages. Oracle Virtual Box (Oracle, 2018) housed in Windows 10 PC having three virtual machines and Intel Core i7-5820K, 64 GB RAM, 3.30 GHz, 6 physical CPUs, and 12vCPU for installing broker setup. Each virtual computer contains 8 GB RAM, 15 GB hard drive, and a single CPU.</p>
<p>Dataset description Deep learning-based intrusion detection systems require access to a dataset to assess intrusions. Properly produced data is crucial and difficult to train the model because it includes labeled regular and abnormal communication along with extra factors like IP address. Furthermore, for security concerns, few network packet-based analytic datasets are released publicly. Freely available datasets described in this section are commonly used. The Defence Advanced Research Project Agency (DARPA) produced the dataset in 1998. The test data for network-based assaults spanning two weeks is included along with network traffic and audit records spanning seven weeks. However, a drawback of the DARPA dataset is its lack of real network activity. The KDD CUP (Knowledge Discovery and Data Mining) dataset originated with the original DARPA dataset, which disclosed approximately 5 million suspicious behavior evaluations of network traffic within seven weeks.</p>
<p>Versions DEFCON-8 and DEFCON-10 of the DEFCON Dataset were suggested in 2000 and 2002, respectively. One version of DEFCON-8 contains attacks based on buffer overflows and port scanning, while another version includes attacks related to the FTP protocol, malformed packets, port scanning, and sweeps. The difference between regular and real-time traffic during the CTF (Capture the Flag) tournament, which results in IDS evaluation limits the size of this dataset. Three distinct datasets are covered under the Centre of Applied Internet Data Analysis&#x2019;s (CAIDAs) dataset: RSDoS Attack Metadata (2018-09), CAIDA DDOS, and CAIDA Internet traces (2016).</p>
</sec>
<sec id="s7">
<label>7</label>
<title>Comparative Analysis</title>
<p>The hidden Markov models (HMMs) and an LR- multilayer perceptron (MLP) based classifier are used as a comparative experimental result with the proposed Explainable AI (ExAI) fuzzy network-based technique RBGTFN blended approach RCSO with all three datasets in <xref ref-type="table" rid="table-2">Tables 2</xref>&#x2013;<xref ref-type="table" rid="table-4">4</xref> helps to explain its false detection:</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparative analysis of DARPA dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Technique</th>
<th>Detection accuracy</th>
<th>QOS</th>
<th>Precision</th>
<th>Latency</th>
<th>Scalability</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>HMM</bold></td>
<td>82</td>
<td>80</td>
<td>73</td>
<td>70</td>
<td>79</td>
</tr>
<tr>
<td><bold>LR-MLP</bold></td>
<td>87</td>
<td>84</td>
<td>80</td>
<td>79</td>
<td>85</td>
</tr>
<tr>
<td><bold>RBGTFN_RCSO</bold></td>
<td>94</td>
<td>89</td>
<td>90</td>
<td>87</td>
<td>91</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparative analysis of DEFCON dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Technique</th>
<th>Detection accuracy</th>
<th>QOS</th>
<th>Precision</th>
<th>Latency</th>
<th>Scalability</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>HMM</bold></td>
<td>74</td>
<td>77</td>
<td>78</td>
<td>80</td>
<td>76</td>
</tr>
<tr>
<td><bold>LR-MLP</bold></td>
<td>82</td>
<td>79</td>
<td>82</td>
<td>87</td>
<td>78</td>
</tr>
<tr>
<td><bold>RBGTFN_RCSO</bold></td>
<td>92</td>
<td>87</td>
<td>94</td>
<td>96</td>
<td>90</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Comparative analysis of the CAIDAS dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Technique</th>
<th>Detection accuracy</th>
<th>QOS</th>
<th>Precision</th>
<th>Latency</th>
<th>Scalability</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>HMM</bold></td>
<td>82</td>
<td>79</td>
<td>74</td>
<td>78</td>
<td>81</td>
</tr>
<tr>
<td><bold>LR-MLP</bold></td>
<td>90</td>
<td>83</td>
<td>80</td>
<td>84</td>
<td>85</td>
</tr>
<tr>
<td><bold>RBGTFN_RCSO</bold></td>
<td>98</td>
<td>89</td>
<td>95</td>
<td>93</td>
<td>96</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-2">Tables 2</xref>&#x2013;<xref ref-type="table" rid="table-4">4</xref> present a Cross-comparison of smart grid security using a variety of datasets. The datasets analyzed are MIMIC-IV, DEFCON, and CAIDAS datasets in terms of detection accuracy, QOS, precision, latency, and scalability.</p>

<p><xref ref-type="fig" rid="fig-2">Fig. 2a</xref>&#x2013;<xref ref-type="fig" rid="fig-2">c</xref> shows an analysis of the existing parameters of HMM in the DARPA dataset. For the DARPA dataset existing HMM precision is 73%, latency 70%, QOS 80%, detection accuracy 82%, and scalability 79%. precision 78%, latency 80%, QOS 77%, detection accuracy 74%, scalability 76% for DEFCON; existing HMM attained precision of 74%, latency of 78%, QOS of 79%, detection accuracy of 82%, and scalability of 81% for the CAIDAS dataset.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Analysis of existing parameters of HMM for (<bold>a</bold>) MIMIC-IV, (<bold>b</bold>) DEFCON, (<bold>c</bold>) CAIDAS dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63242-fig-2a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63242-fig-2b.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-3">Fig. 3a</xref>&#x2013;<xref ref-type="fig" rid="fig-3">c</xref> indicates the analysis of existing parameters of LR-MLP that are currently in use in the DARPA dataset. Current LR-MLP achieved precision 80%, latency 85%, QOS 84%, detection accuracy 87%, and scalability 85% on the DARPA dataset. For DEFCON, existing LR-MLP precision 82%, latency 87%, QOS 79%, detection accuracy 82%, scalability 78%; precision 80%, latency 84%, QOS 83%, detection accuracy 90%, scalability 85% for the CAIDAS dataset.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Analysis of existing parameters of LR-MLP for (<bold>a</bold>) MIMIC-IV, (<bold>b</bold>) DEFCON, (<bold>c</bold>) CAIDAS dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63242-fig-3.tif"/>
</fig>
<p>The analysis of existing parameters of RBGTFN_RCSO in DARPA dataset is displayed in <xref ref-type="fig" rid="fig-4">Fig. 4a</xref>&#x2013;<xref ref-type="fig" rid="fig-4">c</xref>. RBGTFN_RCSO 90% precision, 87% latency, 89% QOS, 94% detection accuracy, and 91% scalability for the DARPA dataset. For the DEFCON, precision was 94%, latency was 96%, QOS was 87%, detection accuracy was 92%, scalability was 90%. For CAIDAS dataset, precision was 95%, latency was 93%, QOS was 89%, detection accuracy was 98%, and scalability was 96%.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Analysis of existing parameters of RBGTFN_RCSO for (<bold>a</bold>) MIMIC-IV, (<bold>b</bold>) DEFCON, (<bold>c</bold>) CAIDAS dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63242-fig-4.tif"/>
</fig>
</sec>
<sec id="s8">
<label>8</label>
<title>Discussion</title>
<p>In the proposed data security technique, a random hash value and signature pattern of the data matrix are used to generate a random key for the input data stream. As a result, it facilitates quicker and less time-consuming data encryption and decryption. Keep in mind that anomalies can occur on any device, and we base our evaluation of the anomaly detection on the abnormalities that have happened on device number one. This takes into account a plausible situation in an actual Internet of Things network, in which a small number of devices in our method, for example, are outperformed the ones that were published. Because of the initial imbalance in the dataset, the models produced have low recall values. The enhanced recall values can be attributed to the data samples being evenly distributed throughout the various categorization jobs. These tables demonstrate how much better the suggested solution is than the current schemes in terms of accuracy in anomaly detection, system throughput and scheme efficiency. It is not necessary to classify this communivation because it has already been identified as intrusive and can be stopped without repercussions. Traffic identified as harmful at the first level may be routed to the cloud for a more thorough investigation, which would relieve demand on edge resources, thanks to the second level&#x2019;s customizable reaction time.</p>
</sec>
<sec id="s9">
<label>9</label>
<title>Conclusion</title>
<p>This study proposes a novel method for anomaly detection in cloud-based IoT networks utilizing explainable artificial intelligence and privacy analysis of healthcare data. A Radial Boltzmann Gaussian temporal fuzzy network has been used in anomaly detection to assess the privacy of healthcare data in this case. Remora colony swarm optimization was then used to examine network optimization. The suggested AI-based security mechanism offers several important benefits, including less computational complexity, a quick and easy process, low time consumption, precise attack detection, and optimal performance results. During performance analysis, suggested AI-based security method outcomes are verified as well as contrasted using a variety of assessment metrics with feature learning, classification, and data security models. The acquired results indicate that the suggested technique performs better than other techniques. Attackers may modify the transmission frequency of IoT edge devices and transmit data streams at an irregular cadence. Given the variety of manipulations available to alter transmission frequency, the rule-based method illustrates internal workings during an anomaly event but is not able to accurately identify anomalies in real-world settings.</p>
</sec>
</body>
<back>
<ack>
<p>The authors thank the Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah for supporting this study.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This project was funded by Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah under grant No. (RG-6-611-43), the authors, therefore, acknowledge with thanks DSR technical and financial support.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Final manuscript revision, funding, supervision: Brij B. Gupta, Wadee Alhalabi; study conception and design, analysis and interpretation of results, methodology development: Jitendra Kumar Samriya, Virendra Singh; data collection, draft manuscript preparation, figures and tables: Gourav Bathla, Meena Malik, Varsha Arya. 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>All data generated or analysed during this study are included in this published article.</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="journal"><person-group person-group-type="author"><string-name><surname>Saraswat</surname> <given-names>D</given-names></string-name>, <string-name><surname>Bhattacharya</surname> <given-names>P</given-names></string-name>, <string-name><surname>Verma</surname> <given-names>A</given-names></string-name>, <string-name><surname>Prasad</surname> <given-names>VK</given-names></string-name>, <string-name><surname>Tanwar</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>G</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Explainable AI for Healthcare 5.0: opportunities and challenges</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>13</volume>:<fpage>84486</fpage>&#x2013;<lpage>517</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2022.3197671</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>Albahri</surname> <given-names>AS</given-names></string-name>, <string-name><surname>Duhaim</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Fadhel</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Alnoor</surname> <given-names>A</given-names></string-name>, <string-name><surname>Baqer</surname> <given-names>NS</given-names></string-name>, <string-name><surname>Alzubaidi</surname> <given-names>L</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>A systematic review of trustworthy and explainable artificial intelligence in healthcare: assessment of quality, bias risk, and data fusion</article-title>. <source>Inf Fusion</source>. <year>2023</year>;<volume>96</volume>:<fpage>156</fpage>&#x2013;<lpage>91</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2023.03.008</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yang</surname> <given-names>CC</given-names></string-name></person-group>. <article-title>Explainable artificial intelligence for predictive modeling in healthcare</article-title>. <source>J Healthcare Inform Res</source>. <year>2022</year>;<volume>6</volume>(<issue>2</issue>):<fpage>228</fpage>&#x2013;<lpage>39</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s41666-022-00114-1</pub-id>; <pub-id pub-id-type="pmid">35194568</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>Gupta</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Gaurav</surname> <given-names>A</given-names></string-name>, <string-name><surname>Attar</surname> <given-names>RW</given-names></string-name>, <string-name><surname>Arya</surname> <given-names>V</given-names></string-name>, <string-name><surname>Alhomoud</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chui</surname> <given-names>KT</given-names></string-name></person-group>. <article-title>A sustainable W-RLG model for attack detection in healthcare IoT systems</article-title>. <source>Sustainability</source>. <year>2024</year>;<volume>16</volume>(<issue>8</issue>):<fpage>3103</fpage>. doi:<pub-id pub-id-type="doi">10.3390/su16083103</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>Liu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>F</given-names></string-name>, <string-name><surname>Shankar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Maple</surname> <given-names>C</given-names></string-name>, <string-name><surname>Peter</surname> <given-names>JD</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>B-G</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Explainable AI for medical image analysis in medical cyber-physical systems: enhancing transparency and trustworthiness of iomt</article-title>. <source>IEEE J Biomed Health Inform</source>. <year>2023</year>;<volume>29</volume>(<issue>4</issue>):<fpage>2365</fpage>&#x2013;<lpage>76</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jbhi.2023.3336721</pub-id>; <pub-id pub-id-type="pmid">38010935</pub-id></mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sangaiah</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Rezaei</surname> <given-names>S</given-names></string-name>, <string-name><surname>Javadpour</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Explainable AI in big data intelligence of community detection for digitalization e-healthcare services</article-title>. <source>Appl Soft Comput</source>. <year>2023</year>;<volume>136</volume>:<fpage>110119</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asoc.2023.110119</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Ahmed</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zubair</surname> <given-names>S</given-names></string-name></person-group>. <chapter-title>Explainable artificial intelligence in sustainable smart healthcare</chapter-title>. In: <source>Explainable artificial intelligence for cyber security: next generation artificial intelligenc</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>; <year>2022</year>. p. <fpage>265</fpage>&#x2013;<lpage>80</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gupta</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Lytras</surname> <given-names>MD</given-names></string-name></person-group>. <article-title>Fog-enabled secure and efficient fine-grained searchable data sharing and management scheme for IoT-based healthcare systems</article-title>. <source>IEEE Trans Eng Manag</source>. <year>2022</year>;<volume>71</volume>:<fpage>12566</fpage>&#x2013;<lpage>78</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tem.2022.3143661</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Raza</surname> <given-names>A</given-names></string-name>, <string-name><surname>Tran</surname> <given-names>KP</given-names></string-name>, <string-name><surname>Koehl</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Designing ECG monitoring healthcare system with federated transfer learning and explainable AI</article-title>. <source>Knowl Based Syst</source>. <year>2022</year>;<volume>236</volume>(<issue>4</issue>):<fpage>107763</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.knosys.2021.107763</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>Alsalman</surname> <given-names>D</given-names></string-name></person-group>. <article-title>A comparative study of anomaly detection techniques for IoT security using AMoT (adaptive machine learning for IoT threats)</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>:<fpage>14719</fpage>&#x2013;<lpage>30</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2024.3359033</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>Rathee</surname> <given-names>G</given-names></string-name>, <string-name><surname>Saini</surname> <given-names>H</given-names></string-name>, <string-name><surname>Garg</surname> <given-names>S</given-names></string-name>, <string-name><surname>Choi</surname> <given-names>BJ</given-names></string-name>, <string-name><surname>Hassan</surname> <given-names>MM</given-names></string-name></person-group>. <article-title>A secure data e-governance for healthcare application in cyber physical systems</article-title>. <source>Int J Sem Web Inform Syst</source>. <year>2024</year>;<volume>20</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>17</lpage>. doi:<pub-id pub-id-type="doi">10.4018/IJSWIS.345934</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Samriya</surname> <given-names>JK</given-names></string-name>, <string-name><surname>Chakraborty</surname> <given-names>C</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Adversarial ML-based secured cloud architecture for consumer Internet of Things of smart healthcare</article-title>. <source>IEEE Transact Consum Electr</source>. <year>2023</year>;<volume>70</volume>:<fpage>2058</fpage>&#x2013;<lpage>65</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCE.2023.3341696</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Bilal</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A data-driven approach for intrusion and anomaly detection using automated machine learning for the Internet of Things</article-title>. <source>Soft Comput</source>. <year>2023</year>;<volume>32</volume>(<issue>19</issue>):<fpage>14469</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00500-023-09037-4</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yaqoob</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hussain</surname> <given-names>A</given-names></string-name>, <string-name><surname>Subhan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Pappalardo</surname> <given-names>G</given-names></string-name>, <string-name><surname>Awais</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Deep learning based anomaly detection for fog-assisted IoVs network</article-title>. <source>IEEE Access</source>. <year>2023</year>;<volume>14</volume>:<fpage>19024</fpage>&#x2013;<lpage>38</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3246660</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>Patel</surname> <given-names>SK</given-names></string-name></person-group>. <article-title>Improving intrusion detection in cloud-based healthcare using neural network</article-title>. <source>Biomed Signal Process Control</source>. <year>2023</year>;<volume>83</volume>(<issue>1</issue>):<fpage>104680</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.bspc.2023.104680</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khatun</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Memon</surname> <given-names>SF</given-names></string-name>, <string-name><surname>Eising</surname> <given-names>C</given-names></string-name>, <string-name><surname>Dhirani</surname> <given-names>LL</given-names></string-name></person-group>. <article-title>Machine learning for healthcare-IoT security: a review and risk mitigation</article-title>. <source>IEEE Access</source>. <year>2023</year>;<volume>11</volume>:<fpage>145869</fpage>&#x2013;<lpage>96</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3346320</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bezanjani</surname> <given-names>BR</given-names></string-name>, <string-name><surname>Ghafouri</surname> <given-names>SH</given-names></string-name>, <string-name><surname>Gholamrezaei</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Fusion of machine learning and blockchain-based privacy-preserving approach for healthcare data in the Internet of Things</article-title>. <source>J Supercomput</source>. <year>2024</year>;<volume>80</volume>(<issue>17</issue>):<fpage>24975</fpage>&#x2013;<lpage>5003</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11227-024-06392-3</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>Wei</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Semantic-based optimization of deep learning for efficient real-time medical image segmentation</article-title>. <source>Int J Sem Web Informat Syst (IJSWIS)</source>. <year>2024</year>;<volume>20</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>16</lpage>. doi:<pub-id pub-id-type="doi">10.4018/IJSWIS.340938</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Rai</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Verma</surname> <given-names>DK</given-names></string-name>, <string-name><surname>Dwivedi</surname> <given-names>RK</given-names></string-name></person-group>. <article-title>Detecting deviations: anomaly detection in healthcare IoT data streams using advanced machine learning techniques</article-title>. In: <conf-name>International Conference on Emerging Trends in Expert Applications &#x0026; Security</conf-name>; <year>2024</year>; <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer Nature Singapore</publisher-name>. p. <fpage>427</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Namratha</surname> <given-names>M</given-names></string-name>, <string-name><surname>Anusree</surname> <given-names>MK</given-names></string-name>, <collab>Niha</collab>, <string-name><surname>Pooja</surname> <given-names>S</given-names></string-name>, <string-name><surname>Arpana</surname> <given-names>MR</given-names></string-name></person-group>. <article-title>Anomaly detection in medical IoT devices using federated learning</article-title>. In: <conf-name>International Conference on Smart Trends in Computing and Communications</conf-name>; <year>2023</year>; <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer Nature Singapore</publisher-name>. p. <fpage>259</fpage>&#x2013;<lpage>70</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Krishnamoorthy</surname> <given-names>R</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>M</given-names></string-name>, <string-name><surname>Swathi</surname> <given-names>G</given-names></string-name>, <string-name><surname>Tanaka</surname> <given-names>K</given-names></string-name>, <string-name><surname>Raja</surname> <given-names>C</given-names></string-name>, <string-name><surname>Ramesh</surname> <given-names>JVN</given-names></string-name></person-group>. <chapter-title>An intelligent IoT-based smart healthcare monitoring system using machine learning</chapter-title>. In: <source>5G-based smart hospitals and healthcare systems</source>. <publisher-loc>Boca Raton, FL, USA</publisher-loc>: <publisher-name>CRC Press</publisher-name>; <year>2023</year>. p. <fpage>230</fpage>&#x2013;<lpage>47</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ioannou</surname> <given-names>I</given-names></string-name>, <string-name><surname>Nagaradjane</surname> <given-names>P</given-names></string-name>, <string-name><surname>Angin</surname> <given-names>P</given-names></string-name>, <string-name><surname>Balasubramanian</surname> <given-names>P</given-names></string-name>, <string-name><surname>Kavitha</surname> <given-names>KJ</given-names></string-name>, <string-name><surname>Murugan</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>GEMLIDS-MIOT: a green effective machine learning intrusion detection system based on federated learning for medical IoT network security hardening</article-title>. <source>Comput Commun</source>. <year>2024</year>;<volume>218</volume>(<issue>6</issue>):<fpage>209</fpage>&#x2013;<lpage>39</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2024.02.023</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tewari</surname> <given-names>A</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>BB</given-names></string-name></person-group>. <article-title>An internet-of-things-based security scheme for healthcare environment for robust location privacy</article-title>. <source>Int J Computat Sci Eng</source>. <year>2020</year>;<volume>21</volume>(<issue>2</issue>):<fpage>298</fpage>&#x2013;<lpage>303</lpage>. doi:<pub-id pub-id-type="doi">10.1504/ijcse.2020.10574</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>Inuwa</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Das</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A comparative analysis of various machine learning methods for anomaly detection in cyber attacks on IoT networks</article-title>. <source>Int Things</source>. <year>2024</year>;<volume>31</volume>(<issue>71</issue>):<fpage>101162</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.iot.2024.101162</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>Khan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Jan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Alturki</surname> <given-names>R</given-names></string-name>, <string-name><surname>Alshehri</surname> <given-names>MD</given-names></string-name>, <string-name><surname>Shah</surname> <given-names>ST</given-names></string-name>, <string-name><surname>ur Rehman</surname> <given-names>A</given-names></string-name></person-group>. <article-title>A secure ensemble learning-based fog-cloud approach for cyberattack detection in IoMT</article-title>. <source>IEEE Trans Ind Inform</source>. <year>2023</year>;<volume>19</volume>(<issue>10</issue>):<fpage>10125</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TII.2022.3231424</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>Hossain</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Muhammad</surname> <given-names>G</given-names></string-name>, <string-name><surname>Guizani</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Explainable AI and mass surveillance system-based healthcare framework to combat COVID-I9 like pandemics</article-title>. <source>IEEE Netw</source>. <year>2020</year>;<volume>34</volume>(<issue>4</issue>):<fpage>126</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1109/mnet.011.2000458</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gupta</surname> <given-names>BB</given-names></string-name>, <string-name><surname>Gaurav</surname> <given-names>A</given-names></string-name>, <string-name><surname>Panigrahi</surname> <given-names>PK</given-names></string-name></person-group>. <article-title>Analysis of security and privacy issues of information management of big data in B2B based healthcare systems</article-title>. <source>J Bus Res</source>. <year>2023</year>;<volume>162</volume>:<fpage>113859</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jbusres.2023.113859</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>Srinivasu</surname> <given-names>PN</given-names></string-name>, <string-name><surname>Sandhya</surname> <given-names>N</given-names></string-name>, <string-name><surname>Jhaveri</surname> <given-names>RH</given-names></string-name>, <string-name><surname>Raut</surname> <given-names>R</given-names></string-name></person-group>. <article-title>From blackbox to explainable AI in healthcare: existing tools and case studies</article-title>. <source>Mob Inf Syst</source>. <year>2022</year>;<volume>2022</volume>(<issue>1</issue>):<fpage>8167821</fpage>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nazar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alam</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Yafi</surname> <given-names>E</given-names></string-name>, <string-name><surname>Su&#x2019;ud</surname> <given-names>MM</given-names></string-name></person-group>. <article-title>A systematic review of human-computer interaction and explainable artificial intelligence in healthcare with artificial intelligence techniques</article-title>. <source>IEEE Access</source>. <year>2021</year>;<volume>9</volume>:<fpage>153316</fpage>&#x2013;<lpage>48</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2021.3127881</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Patel</surname> <given-names>N</given-names></string-name>, <string-name><surname>Ramoliya</surname> <given-names>F</given-names></string-name>, <string-name><surname>Jadav</surname> <given-names>NK</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>R</given-names></string-name>, <string-name><surname>Tanwar</surname> <given-names>S</given-names></string-name>, <string-name><surname>Aujla</surname> <given-names>GS</given-names></string-name></person-group>. <article-title>X-NET: explainable AI-based network data security framework for Healthcare 4.0</article-title>. In: <conf-name>2024 IEEE International Conference on Communications Workshops (ICC Workshops)</conf-name>; <year>2024 Jun 9&#x2013;13</year>; <publisher-loc>Denver, CO, USA</publisher-loc>. p. <fpage>481</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Lippmann</surname> <given-names>R</given-names></string-name>, <string-name><surname>Cunningham</surname> <given-names>RK</given-names></string-name>, <string-name><surname>Fried</surname> <given-names>DJ</given-names></string-name>, <string-name><surname>Graf</surname> <given-names>I</given-names></string-name>, <string-name><surname>Kendall</surname> <given-names>KR</given-names></string-name>, <string-name><surname>Webster</surname> <given-names>SE</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Results of the darpa 1998 offline intrusion detection evaluation</article-title>. In: <conf-name>Recent Advances in Intrusion Detection, RAID 99 Conference</conf-name>; <year>1999 Sep 7&#x2013;9</year>; <publisher-loc>West Lafayette, IN, USA</publisher-loc>. p. <fpage>829</fpage>&#x2013;<lpage>35</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shirsath</surname> <given-names>V</given-names></string-name></person-group>. <article-title>CAIDA UCSD DDoS 2007 Attack Dataset</article-title>. <source>IEEE Dataport</source>. <year>2023</year>. doi:<pub-id pub-id-type="doi">10.21227/dvp9-s124</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Nehinbe</surname> <given-names>JO</given-names></string-name></person-group>. <chapter-title>A simple method for improving intrusion detections in corporate networks</chapter-title>. In: <source>Information security and digital forensics (ISDF 2009)</source>. <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2009</year>. p. <fpage>111</fpage>&#x2013;<lpage>22</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-642-11530-1_13</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>







