<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Oncol.</journal-id>
<journal-title>Frontiers in Oncology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Oncol.</abbrev-journal-title>
<issn pub-type="epub">2234-943X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fonc.2025.1618349</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Oncology</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Enhancing clinical diagnosis of laryngeal cancer through fusion-based transfer learning with Osprey Optimisation Algorithm using histology images</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Al-Kahtani</surname>
<given-names>Nouf</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1639175/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Jamjoom</surname>
<given-names>Mona M.</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2600925/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Khairi Ishak</surname>
<given-names>Mohamad</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Mostafa</surname>
<given-names>Samih M.</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2116556/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Department of Health Information Management and Technology, College of Public Health, Imam Abdulrahman bin Faisal University</institution>, <addr-line>Dammam</addr-line>,&#xa0;<country>Saudi Arabia</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University</institution>, <addr-line>Riyadh</addr-line>,&#xa0;<country>Saudi Arabia</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Department of Electrical and Computer Engineering, College of Engineering and Information Technology, Ajman University</institution>, <addr-line>Ajman</addr-line>,&#xa0;<country>United Arab Emirates</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>Computer Science Department, Faculty of Computers and Information, South Valley University</institution>, <addr-line>Qena</addr-line>,&#xa0;<country>Egypt</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1283858/overview">Venkatesan Renugopalakrishnan</ext-link>, Harvard University, United States</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Devesh U. Kapoor, Gujarat Technological University, India</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3032163/overview">Richard Holy</ext-link>, &#xda;st&#x159;edn&#xed; Vojensk&#xe1; Nemocnice - Vojensk&#xe1; fakultn&#xed; nemocnice Praha, Czechia</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Mohamad Khairi Ishak, <email xlink:href="mailto:m.ishak@ajman.ac.ae">m.ishak@ajman.ac.ae</email>
</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>08</day>
<month>10</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>15</volume>
<elocation-id>1618349</elocation-id>
<history>
<date date-type="received">
<day>25</day>
<month>04</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>22</day>
<month>09</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2025 Al-Kahtani, Jamjoom, Khairi Ishak and Mostafa.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Al-Kahtani, Jamjoom, Khairi Ishak and Mostafa</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<sec>
<title>Background</title>
<p>Laryngeal squamous cell carcinoma is the most commonly diagnosed neck and head cancer. In contrast, the primary stage of pre-malignant and laryngeal cancer (LC) has to be handled with early diagnosis and treated with higher levels of laryngeal protection. Radiological evaluation with magnetic resonance imaging (MRI) and computed tomography (CT) techniques offers essential information on the disease in terms of the distance of the principal cancer and the existence of cervical lymph node metastasis. Recently, numerous deep learning (DL) and machine learning (ML) models have been implemented to classify the extracted features as either cancerous or healthy.</p>
</sec>
<sec>
<title>Methods</title>
<p>In this study, the Clinical Diagnosis of Laryngeal Cancer via Histology Images using the Fusion Transfer Learning and the Osprey Optimisation Algorithm (CDLCHI-FTLOOA) model is proposed. The aim is to improve the LC detection outcomes using histology image analysis to improve the patient&#x2019;s life. Initially, the CDLCHI-FTLOOA model utilizes median filtering (MF)-based noise elimination during the image pre-processing process. Furthermore, the feature extraction process is performed by using the fusion models, namely AlexNet, SqueezNet, and CapsNet. The autoencoder (AE) method is employed for classification. To improve model performance, the Osprey Optimisation Algorithm (OOA) method is used for hyperparameter tuning to choose the optimal parameters for improved accuracy.</p>
</sec>
<sec>
<title>Results</title>
<p>To exhibit the enhanced performance of the CDLCHI-FTLOOA model, a comprehensive experimental analysis is conducted under the laryngeal dataset. The comparison study of the CDLCHI-FTLOOA model portrayed a superior accuracy value of 97.16% over existing techniques.</p>
</sec>
<sec>
<title>Conclusion</title>
<p>Therefore, the proposed model can be employed for the accurate detection of the LC using the histopathological images.</p>
</sec>
</abstract>
<kwd-group>
<kwd>laryngeal cancer</kwd>
<kwd>histology images</kwd>
<kwd>fusion transfer learning</kwd>
<kwd>clinical diagnosis</kwd>
<kwd>Osprey Optimisation Algorithm</kwd>
</kwd-group>
<counts>
<fig-count count="9"/>
<table-count count="4"/>
<equation-count count="22"/>
<ref-count count="35"/>
<page-count count="17"/>
<word-count count="8195"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-in-acceptance</meta-name>
<meta-value>Cancer Imaging and Image-directed Interventions</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>Laryngeal cancer accounts for approximately 2% of all cancers globally and is thought to be one of the most aggressive types of head and neck cancer. The risk factors for laryngeal tumor growth include alcohol consumption, smoking, occupational substances, polluted environment, and heredity (<xref ref-type="bibr" rid="B1">1</xref>). The outcome for the Laryngeal tumor diagnosis is decided based on certain aspects like the cancer&#x2019;s stage, grade, the concerned place in the larynx, the patient&#x2019;s lifestyle, and well-being after the initial analysis. Both initial and precise analyses are crucial for initiating appropriate treatment and extending the patient&#x2019;s lifespan (<xref ref-type="bibr" rid="B2">2</xref>). Radiological analysis with MRI and CT provides significant information about the cancer level and the occurrence of cervical lymph node metastasis; however, it fails to recognize the superficial mucosal irregularities. Currently, white light laryngoscopy with biopsy is regarded as the gold standard for diagnosing LC and precancerous lesions. However, it generates poor-quality images and suffers from problems in classifying minute epithelial variations and distinguishing benign tumors from malignant ones.</p>
<p>Narrow band imaging (NBI) is an endoscopic imaging procedure aimed to diagnose mucosal lesions of the larynx which are invisible in white-light endoscopy, but are distinctive of pre-tumor and tumor lesions of the larynx (<xref ref-type="bibr" rid="B3">3</xref>). NBI endoscopy is an optical approach which enables in enhancing the detection of laryngeal lesions, carry out a limited a controlled perioperative biopsy, and refines the clinical scope. The NBI endoscopy is an appropriate approach to identify larynx cancerous lesions at the early state. Recently, the Orbeye&#x2122; is commonly utilized in neurosurgery; but, its likely in traditional open surgery has not yet been fully used. Because of its magnification capacity, the Orbeye&#x2122; exoscope is a valued tool for assisting surgeons detect and hold the integrity of the recurring laryngeal nerves and parathyroids in the thyroid surgery (<xref ref-type="bibr" rid="B4">4</xref>).</p>
<p>After diagnosing the patients with initial-phase cancers, organ preservation-based surgical techniques that require the maximum tumor removal while preserving normal tissues are carried out so that the patient can gain health benefits (<xref ref-type="bibr" rid="B5">5</xref>). However, it is challenging to secure a resection margin due to the complex anatomical larynx structures, while the choices concerning the amount of resection are also vital in this regard. In general, the histological changes between the squamous and healthy cell carcinoma tissues are noticeable. However, it is difficult to differentiate the tissues by examining them with the naked eye, even though by visuals like narrow-band imaging, specifically in cancer limits (<xref ref-type="bibr" rid="B6">6</xref>). At present, the typical intraoperative diagnosis by the Hematoxylin and Eosin (H&amp;E) staining process involves a series of lengthy steps, namely staining, freezing, and sectioning. Additionally, the process demands seasoned professionals to conduct the intraoperative analysis (<xref ref-type="bibr" rid="B7">7</xref>).</p>
<p>So, the medical process becomes complicated and produces inconsistencies in the results generated by different pathologists. In this background, the imaging devices that create accurate and rapid descriptions of the usual and neoplastic tissues are essential. In literature, the authors attempted to measure the LC patient&#x2019;s survival through computer-aided image analysis approaches, utilizing H&amp;E-stained microscopy images (<xref ref-type="bibr" rid="B8">8</xref>). In general, pathologists require long-term training, while the availability of skilled histopathologists is limited. On the other hand, in recent years, the convolutional neural networks (CNNs) method has been established to have the potential to diagnose diseases with high accuracy in less time than healthcare professionals. Thus, this method might support the diagnosis of LC in its early stages (<xref ref-type="bibr" rid="B9">9</xref>). DL, a type of ML technique, functions based on the neural network (NN) technique across multiple data formats. The DL-aided methods have been proven to manage both classification and detection problems. In literature (<xref ref-type="bibr" rid="B10">10</xref>), an artificial intelligence (AI)-based deep CNN (DCNN) model was utilized to diagnose the Laryngeal tumors through histology images. With this cutting-edge DL approach, the AI technique may directly provide a precise analysis using the image data, which will help in identifying the disease in its early stages and, in turn, increase the survival rate of the patient. LC pose a critical health hazard due to its aggressive nature and the threats involved in early and accurate detection. Conventional imaging techniques often struggle to detect subtle tissue anomalies that may delay diagnosis and treatment. Improving diagnostic precision is crucial for tailoring treatment strategies effectively and improving patient survival rates. Employing advanced computational methods for analyzing histology images can provide deeper insights into tumor characteristics. This can facilitate timely intervention and better management of the disease, ultimately improving clinical outcomes.</p>
<p>In this study, the Clinical Diagnosis of Laryngeal Cancer via Histology Images using the Fusion Transfer Learning and the Osprey Optimisation Algorithm (CDLCHI-FTLOOA) model is proposed. The aim is to improve the LC detection outcomes using histology image analysis to improve the patient&#x2019;s life. Initially, the CDLCHI-FTLOOA model utilizes median filtering (MF)-based noise elimination during the image pre-processing process. Furthermore, the feature extraction process is performed by using the fusion models, namely AlexNet, SqueezNet, and CapsNet. The autoencoder (AE) method is employed for classification. To improve model performance, the Osprey Optimisation Algorithm (OOA) method is used for hyperparameter tuning to choose the optimal parameters for improved accuracy. To exhibit the enhanced performance of the CDLCHI-FTLOOA model, a comprehensive experimental analysis is conducted under the laryngeal dataset. The key contribution of the CDLCHI-FTLOOA model is listed below.</p>
<list list-type="bullet">
<list-item>
<p>The CDLCHI-FTLOOA approach integrates an MF-based image pre-processing stage to suppress salt-and-pepper noise and improve image quality. This enhances the visibility of critical structural patterns within throat region images. Preserving significant anatomical details ensures more accurate feature extraction. This step significantly contributes to the robustness of the overall diagnostic process.</p>
</list-item>
<list-item>
<p>The CDLCHI-FTLOOA technique incorporates AlexNet, SqueezeNet, and CapsNet in a fusion framework for extracting multiscale and diverse features from throat images. This hybrid extraction improves the capability of the model in distinguishing subtle discrepancies in tissue characteristics. The fusion model also strengthens the representation of both low-level textures and high-level abstractions. This comprehensive feature set improves classification accuracy between cancerous and non-cancerous regions.</p>
</list-item>
<list-item>
<p>The CDLCHI-FTLOOA methodology combines an AE-based classifier for effectively compressing and reconstructing the extracted features, enhancing the learning process. This model also mitigates feature dimensionality while retaining critical data, resulting in more efficient training. It improves the capability of the technique in generalizing from intrinsic data. The model also attains a more accurate classification of LC in throat region images.</p>
</list-item>
<list-item>
<p>The CDLCHI-FTLOOA model implements the OOA technique for fine-tuning the hyperparameters of the AE classifier, improving its overall performance. This optimization improves model accuracy by effectually searching the parameter space. It also accelerates convergence during training, mitigating computational time. As a result, the model achieves more reliable and precise LC classification.</p>
</list-item>
<list-item>
<p>The novelty of the CDLCHI-FTLOOA method is in its integration of three distinct CNN models, such as AlexNet, SqueezeNet, and CapsNet, with an AE classifier, creating a robust and diverse feature representation. This hybrid approach effectually captures multiscale and intrinsic features more effectively than single models. Moreover, the integration of a biologically inspired OOA for tuning additionally refines the learning capability of the model. Altogether, these components synergistically improve classification accuracy and robustness for LC detection.</p>
</list-item>
</list>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature survey</title>
<p>In literature (<xref ref-type="bibr" rid="B11">11</xref>), a DL-aided method called SRE-YOLO was developed to provide instant support for less-skilled workers in laryngeal diagnosis by spontaneously identifying the lesions using various measures with Narrow-Band Imaging (NBI) and endoscopic White Light (WL) images. The existing methods encounter difficulties in diagnosing new types of lesions. At the same time, there exists a necessity for accurate classification of the lesions to follow a suitable disease management protocol. Traditional diagnostic procedures heavily rely upon endoscopic analysis that frequently needs seasoned professionals to execute the diagnosis, and the outcomes may suffer from bias. Meer et&#xa0;al. (<xref ref-type="bibr" rid="B12">12</xref>) developed a complete automatic framework named Self-Attention CNN and Residual Network information optimizer and fusion. The expansion procedures were executed during testing and training examples, while dual progressive deeper methods were also trained. Self-attention MobileNet-V2 techniques were introduced in this study and validated using an augmented dataset. Simultaneously, the Self-Attention DarkNet-19 methods were taught using similar datasets, while the hyperparameters were fine-tuned using the whale optimization algorithm (WOA). Albekairi et&#xa0;al. (<xref ref-type="bibr" rid="B13">13</xref>) suggested the temporal decomposition network (TDN), a fresh DL approach that enhances the multimodal medical image fusion process through adversarial learning mechanisms and feature-level temporal examination. The TDN framework integrates two essential modules: a productive adversarial system for temporal feature matching and a salient perception system to discriminate the feature extraction process. The salient perception system classifies and identifies different pixel distributions over diverse imaging modalities, while the adversarial module enables precise feature mapping and fusion. Joseph et&#xa0;al. (<xref ref-type="bibr" rid="B14">14</xref>) devised a primary laryngeal tumor classification model by integrating handmade and deep features (DF). By utilizing the handcrafted and transfer learning (TL) features and by deploying the first-order statistics (STAT) and local binary patterns (LBP), the DenseNet 201 was removed in larynx endoscopic narrow-band imaging and fusing, thus resulting in the production of many illustrative features. After hybridizing the features, the best ones were selected using recursive feature elimination with the RF (RFE- RF) model.</p>
<p>Ahmad et&#xa0;al. (<xref ref-type="bibr" rid="B15">15</xref>) suggested a fresh, novel attention-based technique named MANS-Net that used spatial, channel, and transformer-based attention models for addressing the issues mentioned earlier. The MANS-Net model effectively studied rough, spatial, color-based, and granular features and increased the nuclei segmentation. The DL techniques were suggested to deliver solutions for the medical tasks. Alrowais et&#xa0;al. (<xref ref-type="bibr" rid="B5">5</xref>) presented a novel Laryngeal Cancer Classification and Detection in which the Aquila Optimisation Algorithm was deployed along with the DL (LCDC-AOADL) technique for the classification of neck area images. This technique aimed at inspecting the histopathologic images for both classification and recognition of the Laryngeal tumors. In this approach, the Inceptionv3 method was utilized to extract the features. Also, the LCDC-AOADL approach used the DBN technique to identify and classify the LC. Krishna et&#xa0;al. (<xref ref-type="bibr" rid="B16">16</xref>) introduced a different explainable decision-making system utilizing CNN through an intelligent attention mechanism. This mechanism leveraged the response-based feed-forward graphical justification method. In this study, diverse DarkNet19 CNN methods were used to identify the histopathology images. To enhance visual processing and improve the performance of the DarkNet19 model, an attention branch was combined with the DarkNet19 model, thus creating an attention branch network (ABN). In literature (<xref ref-type="bibr" rid="B17">17</xref>), specific DL approaches are proposed for nuclei segmentation. Nevertheless, such techniques seldom resolved the issues mentioned earlier. Further, information regarding the problems encountered in H&amp;E-stained histology images is available in public space for reference, while the rest of the data is within the spatial region. Several issues can be resolved by taking spatial and channel features simultaneously. Hu et&#xa0;al. (<xref ref-type="bibr" rid="B18">18</xref>) evaluated the efficiency of AI integrated with flexible nasal endoscopy and optical biopsy techniques such as narrow band imaging (NBI), Storz professional image enhancement system (SPIES), and intelligent spectral imaging color enhancement (ISCAN) for early and accurate detection of LC. Alzakari et&#xa0;al. (<xref ref-type="bibr" rid="B19">19</xref>) introduced an automated Laryngeal Cancer Diagnosis using the Dandelion Optimiser Algorithm with Ensemble Learning (LCD-DOAEL) methodology by integrating Gaussian filtering (GF), MobileNetV2 for feature extraction, DOA for hyperparameter tuning, and an ensemble of BiLSTM, extreme learning machine (ELM), and backpropagation neural network (BPNN) techniques for accurate classification of throat region images.</p>
<p>Al Khulayf et&#xa0;al. (<xref ref-type="bibr" rid="B20">20</xref>) developed a Fusion of Efficient TL Models with Pelican Optimisation for Accurate Laryngeal Cancer Detection and Classification (FETLM-POALCDC) methodology for improving automatic and precise detection of laryngeal cancer using advanced image pre-processing, DL feature fusion, and optimized classification. Sachane and Patil (<xref ref-type="bibr" rid="B21">21</xref>) proposed a hybrid Quantum Dilated Convolutional Neural Network&#x2013;Deep Neuro-Fuzzy Network (QDCNN-DNFN) technique within a federated learning (FL) model to enable early and accurate detection of LC using both image and voice data. Xie et&#xa0;al. (<xref ref-type="bibr" rid="B22">22</xref>) proposed a multiparametric magnetic resonance imaging (MRI) model integrating radiomics and DL techniques by utilizing ResNet-18 to accurately preoperatively stage laryngeal squamous cell carcinoma (LSCC) and predict progression-free survival, thereby improving clinical decision-making. Alazwari et&#xa0;al. (<xref ref-type="bibr" rid="B23">23</xref>) presented an efficient Laryngeal Cancer Detection using Chaotic Metaheuristics Integration with Deep Learning (LCD-CMDL) method integrating CLAHE for contrast enhancement, Squeeze-and-Excitation ResNet (SE-ResNet) for feature extraction, chaotic adaptive sparrow search algorithm (CSSA) for tuning, and extreme learning machine (ELM) for accurate classification. Dharani and Danesh (<xref ref-type="bibr" rid="B24">24</xref>) presented an improved DL ensemble method by incorporating enhanced EfficientNet-B5 with squeeze-and-excitation and hybrid spatial-channel attention modules and ResNet50v2, optimized by the tunicate swarm algorithm (TSA) for improving early and accurate diagnosis of oral cancer using the ORCHID histopathology image dataset. Majeed et&#xa0;al. (<xref ref-type="bibr" rid="B25">25</xref>) enhanced oral cavity squamous cell carcinoma (OCSCC) diagnosis using TL integrated with data-level imbalance handling techniques such as synthetic minority over-sampling technique (SMOTE), Deep SMOTE, ADASYN, and undersampling methods like Near Miss and Edited Nearest Neighbours to improve classification accuracy on imbalanced histopathological datasets. Song et&#xa0;al. (<xref ref-type="bibr" rid="B26">26</xref>) reviewed the role of AI in improving personalized management of head and neck squamous cell carcinoma (HNSCC) by integrating radiologic, pathologic, and molecular data for improved diagnosis, prognosis, treatment planning, and outcome prediction across the HNSCC care continuum. Kumar et&#xa0;al. (<xref ref-type="bibr" rid="B27">27</xref>) presented a Deep Learning Convolutional Neural Network (DL-CNN) model based on a modified Inception-ResNet-V2 architecture, using TL for the automated classification.</p>
<p>The existing studies exhibit various limitations, and a research gap exists in addressing diagnostic challenges under varied imaging conditions and lesion types. The NBI or WL are mainly utilized and fail to utilize multimodal data fusion effectively. Various techniques emphasize classification accuracy but lack interpretability, restricting clinical applicability. Moreover, optimization models such as WOA or TSA are not explored adequately in handling intrinsic tuning across hybrid DL techniques. Integration of spatial-channel attention and sequential learning remains inconsistent, while methods incorporating image and voice data are still in early experimentation stages. Hence, a significant research gap is in presenting robust, interpretable, and multimodal AI systems capable of real-time and accurate LC diagnosis across diverse clinical scenarios.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methods</title>
<p>The study proposed the CDLCHI-FTLOOA model for validation. The proposed method aims to improve the detection accuracy of LC using histology image analysis to increase the lifespan of the patients and their quality of life. The CDLCHI-FTLOOA model involves various steps such as the MF-based image pre-processing, feature extraction and classification, and parameter tuning. <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref> illustrates the entire workflow process of the CDLCHI-FTLOOA technique.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>Workflow process of the CDLCHI-FTLOOA model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g001.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a machine learning model training process. It begins with input training images, followed by image preprocessing using the Median Filtering method. Feature extraction employs AlexNet, SqueezeNet, and CapsNet models. Classification uses an Autoencoder model. The process includes hyperparameter tuning with the Osprey Optimization Algorithm. Performance is evaluated with metrics like accuracy, precision, recall, F1-score, and AUC score.</alt-text>
</graphic>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>MF-based image pre-processing</title>
<p>Initially, the CDLCHI-FTLOOA model utilizes the MF-based noise elimination for image pre-processing (<xref ref-type="bibr" rid="B28">28</xref>). This model is chosen for its efficiency in eliminating noise while conserving crucial edge details, making it appropriate for improving medical and microscopic images. Compared to other techniques like Gaussian or mean filtering, MF is more robust against salt-and-pepper noise and avoids blurring critical features. Furthermore, a 3&#xd7;3 kernel size was used for this method, presenting a good balance between noise reduction and detail preservation. The application of MF resulted in noticeable enhancement in image quality, highlighting improved consistency and clarity. This pre-processing step contributed to better feature extraction and, ultimately, improved classification performance.</p>
<p>MF is a nonlinear image processing model applied to eliminate the noise while preserving the edges, making it an efficient option for histology image analysis. In terms of the LC detection process, it improves the quality of the image by smoothening the smaller devices without blurring critical cellular structures. This pre-processing stage helps achieve improved visualization and segmentation of the tissue features. MF is beneficial in removing the salt-and-pepper noise that influences the outcomes from histological slides. Enhancing image clarity helps in achieving precise classification and feature extraction. Finally, this step also improves the consistency of the automated diagnostic systems for LC.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Fusion of feature extraction methods</title>
<p>After image pre-processing, the feature extraction process is performed by the fusion models, namely, AlexNet, SqueezNet, and CapsNet. The AlexNet model provides robust basic features and is prevalent for its effective hierarchical feature learning and robustness in image recognition tasks. SqueezeNet presents a lightweight model with fewer parameters, ensuring faster processing and lower computational cost without losing accuracy, making it ideal for real-time applications. The spatial associations are effectively captured by the CapsNet model and also preserve pose feature information, which is significant for discriminating subtle differences in medical images like those of the larynx. Integrating these models allows for multiscale and diverse feature representation, enhancing discrimination between cancerous and non-cancerous regions. This hybrid approach overcomes limitations of individual networks and outperforms conventional single-model techniques in both accuracy and efficiency.</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>AlexNet approach</title>
<p>AlexNet is a seminal structure in the domain of DL and is vital in transforming the tasks involved in image classification (<xref ref-type="bibr" rid="B29">29</xref>). AlexNet contains eight layers and presents an advanced procedure deploying five convolutional layers, injected with three fully connected (FC) layers. The input data of the method is designed in (64, 64, 3) sizes, representing 64 pixels in width and height, using three color channels. Then, the max-pooling layers using pool dimensions of 2&#xd7;2 and a stride of 2 are combined. The 2<sup>nd</sup> layer of the convolutional network includes 256 filters using kernel dimensions of 3&#xd7;3 size and padding fixed to &#x2018;same&#x2019;, followed by other max pooling layers using the identical conditions as the previous layer. Each layer utilizes the ReLU activation function. The structure changes to the FC layer from the 6<sup>th</sup> through the 8<sup>th</sup> layers. The 6<sup>th</sup> layer displays 4096 neurons, all using the ReLU activation functions, accompanied by a dropout layer using a standardization rate of 0.5. The 7<sup>th</sup> layer imitates the 6<sup>th</sup> framework. During the 8<sup>th</sup> layer, the number of neurons is decreased to 5 using the Softmax activation function to enable multi-class classification. The method is created using the Adam optimizer. Categorical cross-entropy acts as the loss function, whereas accuracy is accepted as the evaluation method.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>SqueezNet method</title>
<p>SqueezeNet is a special DCNN structure that is specially designed for effective and low&#x2010;power outcome (<xref ref-type="bibr" rid="B30">30</xref>). It is tailored to attain higher precision in image classification tasks while reducing computational resources and the model&#x2019;s size. The structure begins with an input tensor (64, 64, 3) and three color components (RGB). Then, it upgrades the over-layer sequences that contain pooling and convolutional processes. Particularly, the SqueezeNet method combines the distinguishing features named &#x2018;fire modules&#x2019;. This module includes parallel 1&#xd7;1 and 3&#xd7;3 convolutions that are tailored for balancing both model clarity and computational complexity. Following the fire units, the system incorporates additional convolutional layers, a dropout layer for normalization, a 1&#xd7;1 convolution layer to improve the attributes, and a global average pooling layer for reducing the dimensions. This structure results in a dense layer output using the Softmax activation function, enabling multi-class classification. Categorical cross-entropy is applied as the loss function. The performance of the method is assessed according to accuracy, a metric used to determine its efficiency in the precise categorization of the images. It outshines its capability to attain higher accuracy in image classification tasks, thus making it very important for settings where effectiveness and lower&#x2010;power conclusions are dominant. <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref> shows the architecture of the SqueezNet technique.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>Architecture of the SqueezNet technique.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g002.tif">
<alt-text content-type="machine-generated">Diagram of a convolutional neural network architecture. It begins with an input image, followed by layers labeled Conv1, Fire2, and Fire3, with numbers indicating feature map sizes. MaxPool is applied after Conv1 and Fire4. The network progresses through layers Fire4 to Fire9, with feature map sizes changing at each layer. Global average pooling follows Conv10, leading to a Softmax layer, indicating classification output. Arrows demonstrate the data flow through the network.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>CapsNet model</title>
<p>CapsNet is an advanced technology in DL methods and is specifically suitable for challenges and advantages from the hierarchical framework of information (<xref ref-type="bibr" rid="B31">31</xref>). Here, the capsule is a kind of neuron whose outputs signify diverse assets of similar entities. The dissimilar neurons are present in the CNN scalar output and the output vector of the capsules. At the same time, the positioning of the assets and the features represents the likelihood of a feature. The fundamental structure contains basic and digit capsules, succeeded by dynamic routing mechanisms. The significant parameter for the CapsNet structure remains the squashing function, <italic>S</italic>.</p>
<disp-formula id="eq1">
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq1">Equation 1</xref>, <inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mo>&#xb7;</mml:mo>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the Euclidean norm function and <inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> signifies the output vector of the capsule <inline-formula>
<mml:math display="inline" id="im3">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula>. <inline-formula>
<mml:math display="inline" id="im4">
<mml:mi>S</mml:mi>
</mml:math>
</inline-formula> guarantees the output vector length between 0 and 1. The squashing function ensures that the length of all the capsule&#x2019;s vector output lies between 0 and 1. Here, the length signifies the likelihood of the existence of the features. This function upholds the orientation of the vector encoding significant data about the recognized features, like scale or rotation.</p>
<p>The central capsule is a primary layer of capsules that carries out the primary higher&#x2010;dimension entity recognition in the images. The initial capsules produce the basic layer, which promptly connects with the raw features and is then removed by the primary convolution layer. These initial capsules acquire the scalar output from the convolution layer and modify it as the output vector, which in turn depicts the instantiating parameter of several aspects. Numerous primary capsules are usually selected based on the intricacy of the features in the database. In the case of simple databases, some primary capsules are adequate. However, complex databases with diverse spatial hierarchies can necessitate a considerable volume of capsules to acquire the relations sufficiently. The selection of the initial capsules is frequently associated with analytical outcomes and directed by the execution of the system using the benchmark data. It acquires the feature mapping process formed by classical convolution layers and modifies them into smaller vectors that transfer precise data. The vector of prediction <inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> by capsule <italic>i</italic> for capsule <italic>j</italic> is calculated as shown below.</p>
<disp-formula id="eq2">
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq2">Equation 2</xref>, <inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the output of capsule <italic>j</italic>, and <inline-formula>
<mml:math display="inline" id="im7">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> specifies the weighted matrix between capsules <italic>i</italic> and <italic>j</italic>. This equation defines the capsules in a single layer, which is then communicated to the subsequent layer. The weighted matrix <inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> mainly establishes the transition of the data and its exchange among the layers. It makes the prediction <inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> as input and employs the routing process through agreement mechanisms for generating the last output.</p>
<disp-formula id="eq3">
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>exp</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>b</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:mrow>
<mml:mrow>
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mtext>exp</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq3">Equation 3</xref>, <inline-formula>
<mml:math display="inline" id="im10">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> refers to the initial login possibilities in which the capsule <italic>i</italic> must be together with capsule <italic>j</italic>, and <italic>k</italic> represents the probable parent capsule counts in the above layer. This procedure guarantees that the capsules with aligned outputs increase their connection. The complete input of <inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the sum of weighted prediction vectors as shown in <xref ref-type="disp-formula" rid="eq4">Equation 4</xref>:</p>
<disp-formula id="eq4">
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The output of the <italic>j</italic>
<sup>th</sup> capsule has only the complete squashed input as given below.</p>
<disp-formula id="eq5">
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>After adding the inputs from low&#x2010;level capsules, the system integrates the data collected from diverse segments of the image, thus allowing the high&#x2010;level capsules to make additionally accurate and complex feature models. <xref ref-type="disp-formula" rid="eq5">Equation 5</xref> refers to the vector whose length signifies the existing features, whereas its orientation encodes the additional assets, thus preserving the crucial spatial particulars of the feature. The last phase of this method is the dynamical routing process.</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>AE-based classification process</title>
<p>In general, the AE model is employed for the classification process (<xref ref-type="bibr" rid="B32">32</xref>). This model is chosen for its robust capability in unsupervised feature learning, which effectively compresses high-dimensional data into a lower-dimensional representation while preserving essential data. The redundant features and noise are mitigated by this model, thus improving the generalization and robustness. Unlike conventional classifiers, the AE model efficiently learn complex data patterns through reconstruction, which also enhances classification accuracy, specifically in intrinsic medical images. Moreover, the ability of AE to perform dimensionality reduction minimizes computational costs and overfitting risks compared to standard deep networks. This makes AE-based classification particularly appropriate for handling the rich and complex features extracted from fusion CNN models in LC detection.</p>
<p>AE is a form of unsupervised DL method that is mainly used for feature extraction and dimensionality reduction processes. The basic concept behind the AEs is to learn a compressed format (encoder) of the input data, after which a new input is built based on the condensed representations. The structure of the AE contains dual basic elements, such as a decoder and an encoder. The encoding process condenses the input, whereas the decoding process recreates the input from the encoded information. The AEs are trained to reduce the change between the input and its rebuilt form, utilizing the loss function to calculate the reconstruction error. The structure is explained as follows.</p>
<p>Encoder: The encoder condenses the input data into a low&#x2010;dimensional space by removing the crucial attributes. It maps the input data XX to the latent area representation, denoted by <inline-formula>
<mml:math display="inline" id="im12">
<mml:mi>Z</mml:mi>
</mml:math>
</inline-formula>.</p>
<disp-formula id="eq6">
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:mi>Z</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
<mml:mi>X</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq6">Equation 6</xref>, <inline-formula>
<mml:math display="inline" id="im13">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> characterize the weights, <inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the biases and <inline-formula>
<mml:math display="inline" id="im15">
<mml:mi>&#x3c3;</mml:mi>
</mml:math>
</inline-formula> refers to the activation function, such as ReLU or sigmoid.</p>
<p>Latent Space: The compressed or the encoded representation, i.e., ZZ, represents the bottleneck in the system. This low-dimensional representation makes the AEs an efficient candidate for detecting the anomalies, as it removes the noise and unrelated characteristics.</p>
<p>Decoder: The decoding process rebuilds the new information from the condensed latent area. It maps the ZZ and reverts to the input area, thus making a reconstruction <inline-formula>
<mml:math display="inline" id="im16">
<mml:mrow>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mo>&#x2227;</mml:mo>
</mml:msup>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mo>&#x2227;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>:</p>
<disp-formula id="eq7">
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mi>g</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mi>Z</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq7">Equation 7</xref>, <inline-formula>
<mml:math display="inline" id="im17">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im18">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> characterize the biases and weights of the decoder, correspondingly. The reconstruction error that estimates the change between the new input XX and its reconstruction <inline-formula>
<mml:math display="inline" id="im19">
<mml:mrow>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mo>&#x2227;</mml:mo>
</mml:msup>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mo>&#x2227;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, is reduced during the training process. The aim is to learn the condensed representation to retain the most significant data, see <xref ref-type="disp-formula" rid="eq8">Equation 8</xref>.</p>
<disp-formula id="eq8">
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The learning procedure of the AEs includes the optimization of the biases and weights to reduce the reconstruction error. The training procedure is outlined in the succeeding phases.</p>
<p>Encoder Stage: The encoding condenses the input data into latent area representations as given below in <xref ref-type="disp-formula" rid="eq9">Equation 9</xref>.</p>
<disp-formula id="eq9">
<label>(9)</label>
<mml:math display="block" id="M9">
<mml:mrow>
<mml:mi>Z</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
<mml:mi>X</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Decoder Stage: The decoder rebuilds the data from the latent representations as given below in <xref ref-type="disp-formula" rid="eq10">Equation 10</xref>.</p>
<disp-formula id="eq10">
<label>(10)</label>
<mml:math display="block" id="M10">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mi>Z</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Loss Function: The reconstruction error is reduced during the training as given below in <xref ref-type="disp-formula" rid="eq11">Equation 11</xref>.</p>
<disp-formula id="eq11">
<label>(11)</label>
<mml:math display="block" id="M11">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Here, <inline-formula>
<mml:math display="inline" id="im20">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> embodies the new input, and <inline-formula>
<mml:math display="inline" id="im21">
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
</mml:math>
</inline-formula> refers to the reconstructed output. Meanwhile, the method is enhanced to rebuild the typical formats, while some critical changes occur in the reconstruction error. By taking the inherent architecture of the standard designs, the AEs may detect subtle anomalies often overlooked by other methods. Finally, the AEs function as a powerful and efficient approach to detecting cancer. The ability of the AEs to reduce the dimensions while preserving the essential features allows them to distinguish between standard and doubtful actions, thus making them a beneficial device in the cybersecurity area.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Parameter tuning using the OOA model</title>
<p>To further optimize the performance of the model, the OOA model is utilized for hyperparameter tuning to select the best hyperparameters for enhanced accuracy (<xref ref-type="bibr" rid="B33">33</xref>). This model is chosen for its biologically inspired search mechanism, which also effectually balances exploration and exploitation to avoid local optima. The model also shows limitations in conventional methods and improves convergence speed and accuracy when fine-tuning hyperparameters, resulting in an enhanced model performance. Compared to other metaheuristic algorithms, OOA illustrate robustness in handling complex, high-dimensional search spaces, making it appropriate for optimizing DL methods such as the AE classifier. Its efficiency in finding optimal solutions mitigates training time and computational cost, thereby improving the overall efficiency of the LC detection framework.</p>
<p>OOA is a bio&#x2010;inspired metaheuristic model that emulates the Osprey&#x2019;s approach in searching and carrying fish to an appropriate position for consumption. Primarily, the intellectual behavior of the Ospreys is mathematically expressed for resolving the optimization issues over three phases, such as the exploitation, exploration, and initialization, as briefed below.</p>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>Initialization phase</title>
<p>During OOA, all the Ospreys depict population members that establish the solutions to the issue depending on their location in the searching area. A single osprey jointly makes the OOA population described by the matrix of dimension (N Osprey<inline-formula>
<mml:math display="inline" id="im22">
<mml:mo>*</mml:mo>
</mml:math>
</inline-formula>X Position) that is initialized arbitrarily in the searching area, as shown in <xref ref-type="disp-formula" rid="eq12">Equation 12</xref>.</p>
<disp-formula id="eq12">
<label>(12)</label>
<mml:math display="block" id="M12">
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>=</mml:mo>
<mml:mo>[</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22f1;</mml:mo>
</mml:mtd>
<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:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22f1;</mml:mo>
</mml:mtd>
<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:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mi>n</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>&#x2004;</mml:mo>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mo>&#xd7;</mml:mo>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mi>m</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>m</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>var</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<p>In <xref ref-type="disp-formula" rid="eq13">Equation 13</xref>, <italic>OS<sub>i</sub>
</italic> represents the <italic>i<sup>th</sup>
</italic> location of the OS.</p>
<disp-formula id="eq13">
<label>(13)</label>
<mml:math display="block" id="M13">
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>y</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">]</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>(</mml:mo>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>B</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>&#x2004;</mml:mo>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mo>&#x2212;</mml:mo>
<mml:mo>&#x2004;</mml:mo>
<mml:mo>&#x2004;</mml:mo>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>B</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<p>Every OS in the OOA depicts a candidate solution for the optimization problem; thus, a fitness evaluation should be accomplished for every OS, as shown in <xref ref-type="disp-formula" rid="eq14">Equation 14</xref>.</p>
<disp-formula id="eq14">
<label>(14)</label>
<mml:math display="block" id="M14">
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The position of the OSs is upgraded after assessing the worst, sub-optimal, or best values based on the fitness function (FF).</p>
<sec id="s3_4_1_1">
<label>3.4.1.1</label>
<title>Exploration stage</title>
<p>Ospreys have sharp eyesight that helps them locate underwater prey. It initiates the attack by segmenting the water to capture its target. Likewise, the real behavior of the OS threat on fish in searching areas can be mimicked by upgrading the location of the OS population, as it can enhance the exploration approach of OOA. Further, it also helps in establishing the finest position by avoiding local solutions. The location of the OS in the searching space holds a superior FF value, equivalent to the individual OS in OOA, as shown in <xref ref-type="disp-formula" rid="eq15">Equation 15</xref>.</p>
<disp-formula id="eq15">
<label>(15)</label>
<mml:math display="block" id="M15">
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:munder>
<mml:munder>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xfe38;</mml:mo>
</mml:munder>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>h</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:munder>
<mml:mo>=</mml:mo>
<mml:mo stretchy="false">{</mml:mo>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>|</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mo>{</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>}</mml:mo>
<mml:mo>&#x2227;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&lt;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x222a;</mml:mo>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<p>The OS searches for its prey or underwater fish by arbitrarily establishing its positions, as shown in <xref ref-type="disp-formula" rid="eq16">Equations 16</xref> and <xref ref-type="disp-formula" rid="eq17">17</xref>.</p>
<disp-formula id="eq16">
<label>(16)</label>
<mml:math display="block" id="M16">
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:munder>
<mml:munder>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo stretchy="true">&#xfe38;</mml:mo>
</mml:munder>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>d</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>O</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:munder>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">]</mml:mo>
<mml:mo>&#xb7;</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>h</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>&#x2004;</mml:mo>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo stretchy="false">]</mml:mo>
<mml:mo>&#xb7;</mml:mo>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<disp-formula id="eq17">
<label>(17)</label>
<mml:math display="block" id="M17">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&lt;</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&gt;</mml:mo>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The novel value gets enhanced by utilizing the FF value in <xref ref-type="disp-formula" rid="eq18">Equation 18</xref>.</p>
<disp-formula id="eq18">
<label>(18)</label>
<mml:math display="block" id="M18">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>F</mml:mi>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&lt;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mi>;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
</sec>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>Exploitation phase</title>
<p>After searching, the OS decides the best location for eating the prey. The position of the OS in the searching space is modified as it holds the prey in a safe and suitable place. This approach enhances the local searching exploitation capability and converges to the finest solution. In this design stage of the OOA, <xref ref-type="disp-formula" rid="eq19">Equation 19</xref> specifies the behavior of the model and establishes its arbitrary selection location to consume the prey.</p>
<disp-formula id="eq19">
<label>(19)</label>
<mml:math display="block" id="M19">
<mml:mtable>
<mml:mtr>
  <mml:mtd>
<mml:mrow>
<mml:munder>
<mml:munder>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo stretchy="true">&#xfe38;</mml:mo>
</mml:munder>
<mml:mrow>
<mml:mtable equalrows="true" equalcolumns="true">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>w</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>S</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>p</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2004;</mml:mtext>
<mml:mi>O</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:munder>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
  <mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">]</mml:mo>
<mml:mo>&#xb7;</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
</disp-formula>
<disp-formula id="eq20">
<label>(20)</label>
<mml:math display="block" id="M20">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&lt;</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>O</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&gt;</mml:mo>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Here, <xref ref-type="disp-formula" rid="eq20">Equation 20</xref> enhances the calculated value of the FF after the previous position of the OS is updated. Fitness selection is a significant feature that prompts the performance of the OOA. The hyperparameter selection model consists of a solution encoding model to calculate the effectiveness of the candidate solutions. In this study, the OOA imitates &#x2018;accuracy&#x2019; as the leading standard to model the FF, as shown below, as shown in <xref ref-type="disp-formula" rid="eq21">Equations 21</xref> and <xref ref-type="disp-formula" rid="eq22">22</xref>.</p>
<disp-formula id="eq21">
<label>(21)</label>
<mml:math display="block" id="M21">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>=</mml:mo>
<mml:mtext>&#xa0;max&#xa0;</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>P</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="eq22">
<label>(22)</label>
<mml:math display="block" id="M22">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>P</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Here, <inline-formula>
<mml:math display="inline" id="im23">
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im24">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> depict the true and false positive rates, respectively.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental outcomes</title>
<p>This section discusses the experimental outcomes of the CDLCHI-FTLOOA model under the laryngeal dataset (<xref ref-type="bibr" rid="B34">34</xref>). This dataset comprises 1,320 patches of early-stage and healthy cancerous laryngeal tissues, classified under four classes, namely, Hypertrophic Blood Vessels (HBV), Healthy Tissue (He), Abnormal IPCL-like Vessel (IPCL), and Leukoplakia (Le). The patches (100x100 pixels) were extracted from 33 narrow-band laryngoscopic images of 33 dissimilar patients, affected by laryngeal spinocellular carcinoma (analyzed after histopathological inspection). The complete details of this dataset are shown in <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref>. <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref> illustrates a set of sample images.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Details of the dataset.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="left">Tissue classes</th>
<th valign="middle" align="left">No. of images</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">330</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">330</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">330</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">330</td>
</tr>
<tr>
<td valign="middle" align="left">Total Images</td>
<td valign="middle" align="left">1320</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>Sample images of <bold>(A)</bold> Hbv, <bold>(B)</bold> He, <bold>(C)</bold> IPCL and <bold>(D)</bold> Le.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g003.tif">
<alt-text content-type="machine-generated">A grid of 16 square images in four rows labeled A, B, C, and D, each with four images. Row A shows close-ups of vascular structures. Row B displays blurry, pink surfaces. Row C features dark, branching patterns on a reddish background. Row D presents pale, blurry textures with some greenish hues. Each row exhibits variations in texture and color.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref> shows the confusion matrices generated by the CDLCHI-FTLOOA method under a diverse number of epochs. The results infer that the CDLCHI-FTLOOA method successfully identified and detected all four classes accurately. The LC detection result of the CDLCHI-FTLOOA approach is defined in terms of different numbers of epochs in <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref>.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>Confusion matrices of the CDLCHI-FTLOOA model <bold>(A&#x2013;F)</bold>, Epochs 500-3000.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g004.tif">
<alt-text content-type="machine-generated">Six confusion matrices, labeled A to F, show classification results for epochs 500 to 3000. Each matrix compares actual vs. predicted categories (Hbv, He, IPCL, Le). Accuracy improves across epochs, with more correct classifications along the diagonal, indicating learning progress. Non-diagonal values represent misclassifications.</alt-text>
</graphic>
</fig>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>LC detection outcomes of the CDLCHI-FTLOOA model under a distinct number of epochs.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="left">Class labels</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im25">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im26">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im27">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im28">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im29">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
</tr>
</thead>
<tbody>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 500</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">92.20</td>
<td valign="middle" align="left">87.71</td>
<td valign="middle" align="left">80.00</td>
<td valign="middle" align="left">83.68</td>
<td valign="middle" align="left">88.13</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">87.73</td>
<td valign="middle" align="left">72.46</td>
<td valign="middle" align="left">82.12</td>
<td valign="middle" align="left">76.99</td>
<td valign="middle" align="left">85.86</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">92.88</td>
<td valign="middle" align="left">92.45</td>
<td valign="middle" align="left">77.88</td>
<td valign="middle" align="left">84.54</td>
<td valign="middle" align="left">87.88</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">92.20</td>
<td valign="middle" align="left">80.93</td>
<td valign="middle" align="left">90.00</td>
<td valign="middle" align="left">85.22</td>
<td valign="middle" align="left">91.46</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">91.25</td>
<td valign="middle" align="left">83.39</td>
<td valign="middle" align="left">82.50</td>
<td valign="middle" align="left">82.61</td>
<td valign="middle" align="left">88.33</td>
</tr>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 1000</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">94.55</td>
<td valign="middle" align="left">89.57</td>
<td valign="middle" align="left">88.48</td>
<td valign="middle" align="left">89.02</td>
<td valign="middle" align="left">92.53</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">91.52</td>
<td valign="middle" align="left">83.03</td>
<td valign="middle" align="left">83.03</td>
<td valign="middle" align="left">83.03</td>
<td valign="middle" align="left">88.69</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">92.58</td>
<td valign="middle" align="left">90.00</td>
<td valign="middle" align="left">79.09</td>
<td valign="middle" align="left">84.19</td>
<td valign="middle" align="left">88.08</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">94.70</td>
<td valign="middle" align="left">84.76</td>
<td valign="middle" align="left">96.06</td>
<td valign="middle" align="left">90.06</td>
<td valign="middle" align="left">95.15</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">93.33</td>
<td valign="middle" align="left">86.84</td>
<td valign="middle" align="left">86.67</td>
<td valign="middle" align="left">86.58</td>
<td valign="middle" align="left">91.11</td>
</tr>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 1500</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">95.00</td>
<td valign="middle" align="left">90.24</td>
<td valign="middle" align="left">89.70</td>
<td valign="middle" align="left">89.97</td>
<td valign="middle" align="left">93.23</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">93.11</td>
<td valign="middle" align="left">87.46</td>
<td valign="middle" align="left">84.55</td>
<td valign="middle" align="left">85.98</td>
<td valign="middle" align="left">90.25</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">93.71</td>
<td valign="middle" align="left">90.49</td>
<td valign="middle" align="left">83.64</td>
<td valign="middle" align="left">86.93</td>
<td valign="middle" align="left">90.35</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">95.15</td>
<td valign="middle" align="left">86.14</td>
<td valign="middle" align="left">96.06</td>
<td valign="middle" align="left">90.83</td>
<td valign="middle" align="left">95.45</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">94.24</td>
<td valign="middle" align="left">88.58</td>
<td valign="middle" align="left">88.48</td>
<td valign="middle" align="left">88.43</td>
<td valign="middle" align="left">92.32</td>
</tr>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 2000</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">95.61</td>
<td valign="middle" align="left">91.21</td>
<td valign="middle" align="left">91.21</td>
<td valign="middle" align="left">91.21</td>
<td valign="middle" align="left">94.14</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">94.47</td>
<td valign="middle" align="left">89.06</td>
<td valign="middle" align="left">88.79</td>
<td valign="middle" align="left">88.92</td>
<td valign="middle" align="left">92.58</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">94.55</td>
<td valign="middle" align="left">92.43</td>
<td valign="middle" align="left">85.15</td>
<td valign="middle" align="left">88.64</td>
<td valign="middle" align="left">91.41</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">95.53</td>
<td valign="middle" align="left">87.96</td>
<td valign="middle" align="left">95.15</td>
<td valign="middle" align="left">91.41</td>
<td valign="middle" align="left">95.40</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">95.04</td>
<td valign="middle" align="left">90.16</td>
<td valign="middle" align="left">90.08</td>
<td valign="middle" align="left">90.05</td>
<td valign="middle" align="left">93.38</td>
</tr>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 2500</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">96.14</td>
<td valign="middle" align="left">92.40</td>
<td valign="middle" align="left">92.12</td>
<td valign="middle" align="left">92.26</td>
<td valign="middle" align="left">94.80</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">96.06</td>
<td valign="middle" align="left">90.88</td>
<td valign="middle" align="left">93.64</td>
<td valign="middle" align="left">92.24</td>
<td valign="middle" align="left">95.25</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">96.21</td>
<td valign="middle" align="left">94.59</td>
<td valign="middle" align="left">90.00</td>
<td valign="middle" align="left">92.24</td>
<td valign="middle" align="left">94.14</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">97.35</td>
<td valign="middle" align="left">93.77</td>
<td valign="middle" align="left">95.76</td>
<td valign="middle" align="left">94.75</td>
<td valign="middle" align="left">96.82</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">96.44</td>
<td valign="middle" align="left">92.91</td>
<td valign="middle" align="left">92.88</td>
<td valign="middle" align="left">92.87</td>
<td valign="middle" align="left">95.25</td>
</tr>
<tr>
<th valign="middle" colspan="6" align="left">Epoch - 3000</th>
</tr>
<tr>
<td valign="middle" align="left">Hbv</td>
<td valign="middle" align="left">96.97</td>
<td valign="middle" align="left">93.67</td>
<td valign="middle" align="left">94.24</td>
<td valign="middle" align="left">93.96</td>
<td valign="middle" align="left">96.06</td>
</tr>
<tr>
<td valign="middle" align="left">He</td>
<td valign="middle" align="left">97.20</td>
<td valign="middle" align="left">94.26</td>
<td valign="middle" align="left">94.55</td>
<td valign="middle" align="left">94.40</td>
<td valign="middle" align="left">96.31</td>
</tr>
<tr>
<td valign="middle" align="left">IPCL</td>
<td valign="middle" align="left">96.82</td>
<td valign="middle" align="left">95.00</td>
<td valign="middle" align="left">92.12</td>
<td valign="middle" align="left">93.54</td>
<td valign="middle" align="left">95.25</td>
</tr>
<tr>
<td valign="middle" align="left">Le</td>
<td valign="middle" align="left">97.65</td>
<td valign="middle" align="left">94.36</td>
<td valign="middle" align="left">96.36</td>
<td valign="middle" align="left">95.35</td>
<td valign="middle" align="left">97.22</td>
</tr>
<tr>
<td valign="middle" align="left">Average</td>
<td valign="middle" align="left">97.16</td>
<td valign="middle" align="left">94.32</td>
<td valign="middle" align="left">94.32</td>
<td valign="middle" align="left">94.31</td>
<td valign="middle" align="left">96.21</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref> portrays the average outcomes achieved by the CDLCHI-FTLOOA technique under 500 to 1500 epochs. On 500 epochs, the CDLCHI-FTLOOA technique achieved the average <inline-formula>
<mml:math display="inline" id="im30">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im31">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im32">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im33">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im34">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 91.25%, 83.39%, 82.50%, 82.61%, and 88.33% respectively. Moreover, on 1,000 epochs, the CDLCHI-FTLOOA technique attained an average <inline-formula>
<mml:math display="inline" id="im35">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im36">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im37">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im38">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im39">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 93.33%, 86.84%, 86.67%, 86.58%, 91.11% correspondingly. Additionally, on 1,500 epochs, the CDLCHI-FTLOOA method achieved an average <inline-formula>
<mml:math display="inline" id="im40">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im41">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im42">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im43">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im44">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 94.24%, 88.58%, 88.48%, 88.43%, 92.32% respectively.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Average outcomes of the CDLCHI-FTLOOA model <bold>(A&#x2013;C)</bold>, Epochs 500-1500.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g005.tif">
<alt-text content-type="machine-generated">Three bar graphs labeled A, B, and C show average values in percentages for accuracy, precision, recall, F1-score, and AUC score at different epochs (500, 1000, 1500). Graph A shows accuracy at 91.25%, Graph B at 93.33%, and Graph C at 94.24%. AUC score is highest in each graph, reaching 88.33%, 91.11%, and 92.32% respectively.</alt-text>
</graphic>
</fig>
<p>In <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref> and <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref>, the average outcomes of the CDLCHI-FTLOOA technique under 2000 to 3000 epochs are shown. On 2,000 epochs, the CDLCHI-FTLOOA model attained an average <inline-formula>
<mml:math display="inline" id="im45">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im46">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im47">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im48">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im49">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 95.04%, 90.16%, 90.08%, 90.05%, 93.38% respectively. In addition to this, on 2,500 epochs, the CDLCHI-FTLOOAs model attained an average <inline-formula>
<mml:math display="inline" id="im50">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im51">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im52">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im53">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im54">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 96.44%, 92.91%, 92.88%, 92.87%, 95.25% correspondingly. Furthermore, on 3,000 epochs, the CDLCHI-FTLOOAs model attained an average <inline-formula>
<mml:math display="inline" id="im55">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im56">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im57">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im58">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im59">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>U</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 97.16%, 94.32%, 94.32%, 94.31%, 96.21%, respectively.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>Average outcomes of the CDLCHI-FTLOOA model <bold>(A&#x2013;C)</bold>, Epochs 2000-3000.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g006.tif">
<alt-text content-type="machine-generated">Three pie charts labeled A, B, and C representing machine learning metrics for different epochs. Chart A (epoch 2000): accuracy 95.04, precision 93.38, recall 90.08, F1-score 90.05, AUC score 90.16. Chart B (epoch 2500): accuracy 96.44, precision 95.25, recall 92.88, F1-score 92.87, AUC score 92.91. Chart C (epoch 3000): accuracy 97.16, precision 96.21, recall 94.32, F1-score 94.31, AUC score 94.32.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> exhibits the classification outcomes of the CDLCHI-FTLOOA model. <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7A</bold>
</xref> depicts the accuracy analysis results attained by the CDLCHI-FTLOOA model. The figure infers that the CDLCHI-FTLOOA method achieved increasing values over an increasing number of epochs. Next, <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7B</bold>
</xref> exemplifies the result from the loss analysis of the CDLCHI-FTLOOA method. The outcomes specify that the proposed method accomplished closer training and validation loss values. <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7C</bold>
</xref> reveals the PR examination outcome of the CDLCHI-FTLOOA technique. The findings indicate that the CDLCHI-FTLOOA technique produced an increase in the PR values. Lastly, <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7D</bold>
</xref> portrays the ROC analysis outcome of the CDLCHI-FTLOOA technique. The figure infers that the projected system increased the ROC values.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>CDLCHI-FTLOOA technique of <bold>(A)</bold> Accuracy, <bold>(B)</bold> Loss, <bold>(C)</bold> PR curve, and <bold>(D)</bold> ROC curve.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g007.tif">
<alt-text content-type="machine-generated">Panel A displays a line graph comparing training and validation accuracy over 3000 epochs, showing an overall increase. Panel B illustrates training and validation loss over the same epochs, indicating a decrease. Panel C depicts a precision-recall curve for four models: Hbv, He, IPCL, and Le, with high precision across varying recall levels. Panel D shows the ROC curve for the same models, revealing high true positive rates across various false positive rates.</alt-text>
</graphic>
</fig>
<p>A comparative analysis was conducted between the CDLCHI-FTLOOA method and other advanced techniques, and the outcomes are shown in <xref ref-type="table" rid="T3">
<bold>Table&#xa0;3</bold>
</xref> and <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref> (<xref ref-type="bibr" rid="B5">5</xref>, <xref ref-type="bibr" rid="B35">35</xref>). In terms of <inline-formula>
<mml:math display="inline" id="im60">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, the CDLCHI-FTLOOA method achieved a maximum <inline-formula>
<mml:math display="inline" id="im61">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 97.16%. In contrast, the LCDC-AOADL, DCNN, LDA, ResNet50, SVM, VGG16, and AlexNet models attained lower <inline-formula>
<mml:math display="inline" id="im62">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> values such as 96.21%, 84.20%, 90.27%, 91.22%, 85.28%, 85.50%, and 87.71%, correspondingly. Similarly, in terms of <inline-formula>
<mml:math display="inline" id="im63">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, the CDLCHI-FTLOOA method accomplished a maximum <inline-formula>
<mml:math display="inline" id="im64">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 94.32% while the LCDC-AOADL, DCNN, LDA, ResNet50, SVM, VGG16, and AlexNet models achieved the least <inline-formula>
<mml:math display="inline" id="im65">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> values, such as 92.31%, 89.43%, 87.79%, 89.68%, 86.02%, 90.05%, and 87.51%, respectively. In terms of <inline-formula>
<mml:math display="inline" id="im66">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, the CDLCHI-FTLOOA technique attained the highest <inline-formula>
<mml:math display="inline" id="im67">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of 94.31% while the LCDC-AOADL, DCNN, LDA, ResNet50, SVM, VGG16, and AlexNet models attained lower <inline-formula>
<mml:math display="inline" id="im68">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> values, such as 92.06%, 87.10%, 86.35%, 86.65%, 87.37%, 85.41%, and 86.15%, correspondingly.</p>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>Comparative analysis outcomes of the CDLCHI-FTLOOA model with existing methodologies.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="left">Methodology</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im69">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im70">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im71">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th valign="middle" align="left">
<inline-formula>
<mml:math display="inline" id="im72">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="left">CDLCHI-FTLOOA</td>
<td valign="middle" align="left">97.16</td>
<td valign="middle" align="left">94.32</td>
<td valign="middle" align="left">94.32</td>
<td valign="middle" align="left">94.31</td>
</tr>
<tr>
<td valign="middle" align="left">LCDC-AOADL</td>
<td valign="middle" align="left">96.21</td>
<td valign="middle" align="left">92.31</td>
<td valign="middle" align="left">92.09</td>
<td valign="middle" align="left">92.06</td>
</tr>
<tr>
<td valign="middle" align="left">DCNN Algorithm</td>
<td valign="middle" align="left">84.20</td>
<td valign="middle" align="left">89.43</td>
<td valign="middle" align="left">86.12</td>
<td valign="middle" align="left">87.10</td>
</tr>
<tr>
<td valign="middle" align="left">LDA Model</td>
<td valign="middle" align="left">90.27</td>
<td valign="middle" align="left">87.79</td>
<td valign="middle" align="left">87.02</td>
<td valign="middle" align="left">86.35</td>
</tr>
<tr>
<td valign="middle" align="left">ResNet50</td>
<td valign="middle" align="left">91.22</td>
<td valign="middle" align="left">89.68</td>
<td valign="middle" align="left">85.30</td>
<td valign="middle" align="left">86.65</td>
</tr>
<tr>
<td valign="middle" align="left">SVM Model</td>
<td valign="middle" align="left">85.28</td>
<td valign="middle" align="left">86.02</td>
<td valign="middle" align="left">88.37</td>
<td valign="middle" align="left">87.37</td>
</tr>
<tr>
<td valign="middle" align="left">VGG16 Method</td>
<td valign="middle" align="left">85.50</td>
<td valign="middle" align="left">90.05</td>
<td valign="middle" align="left">88.28</td>
<td valign="middle" align="left">85.41</td>
</tr>
<tr>
<td valign="middle" align="left">AlexNet</td>
<td valign="middle" align="left">87.71</td>
<td valign="middle" align="left">87.51</td>
<td valign="middle" align="left">89.83</td>
<td valign="middle" align="left">86.15</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Comparative analysis outcomes of the CDLCHI-FTLOOA model with existing methodologies.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g008.tif">
<alt-text content-type="machine-generated">Bar chart comparing performance metrics for different algorithms: CDLCCHI-FTLOOA, LCDC-AOADL, DCNN, LDA, ResNet50, SVM, VGG16, and AlexNet. Metrics displayed: Accuracy, Precision, Recall, and F1-Score, with values mostly ranging from seventy to ninety-five percent.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T4">
<bold>Table&#xa0;4</bold>
</xref> and <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref> demonstrate the comparative analysis outcomes of the CDLCHI-FTLOOA method and other methods in terms of execution time. The introduced CDLCHI-FTLOOA technique consumed the least possible time, i.e., 1.90min, whereas the LCDC-AOADL, DCNN, LDA, ResNet50, SVM, VGG16, and AlexNet methods took larger times, such as 3.09min, 5.42min, 6.50min, 7.77min, 5.66min, 4.04min, and 7.02min, respectively.</p>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>Time outcome of the CDLCHI-FTLOOA technique with existing methods.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="left">Methodology</th>
<th valign="middle" align="left">Time (min)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="left">CDLCHI-FTLOOA</td>
<td valign="middle" align="left">1.90</td>
</tr>
<tr>
<td valign="middle" align="left">LCDC-AOADL</td>
<td valign="middle" align="left">3.09</td>
</tr>
<tr>
<td valign="middle" align="left">DCNN Algorithm</td>
<td valign="middle" align="left">5.42</td>
</tr>
<tr>
<td valign="middle" align="left">LDA Model</td>
<td valign="middle" align="left">6.50</td>
</tr>
<tr>
<td valign="middle" align="left">ResNet50</td>
<td valign="middle" align="left">7.77</td>
</tr>
<tr>
<td valign="middle" align="left">SVM Model</td>
<td valign="middle" align="left">5.66</td>
</tr>
<tr>
<td valign="middle" align="left">VGG16 Method</td>
<td valign="middle" align="left">4.04</td>
</tr>
<tr>
<td valign="middle" align="left">AlexNet</td>
<td valign="middle" align="left">7.02</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>Time outcomes of the CDLCHI-FTLOOA technique with existing methods.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fonc-15-1618349-g009.tif">
<alt-text content-type="machine-generated">Bar chart comparing processing times for various algorithms and models. CDLCI-FTLOOA takes 1.90 minutes, LCDC-AOADL 3.09 minutes, DCNN Algorithm 5.42 minutes, LDA Model 6.50 minutes, ResNet50 7.77 minutes, SVM Model 5.66 minutes, VGG16 Method 4.04 minutes, and AlexNet 7.02 minutes.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s5" sec-type="conclusions">
<label>5</label>
<title>Conclusion</title>
<p>In this study, the CDLCHI-FTLOOA model was proposed. The model aimed to improve the detection accuracy of LC using histology image analysis to improve patient outcomes. Initially, the CDLCHI-FTLOOA model utilized MF-based noise elimination during the image pre-processing stage. Furthermore, the feature extraction process was conducted using fusion models, namely AlexNet, SqueezNet, and CapsNet. The AE model, used for classification, was further optimized using OOA for hyperparameter tuning to enhance accuracy by choosing the best parameters. To exhibit the improved performance of the CDLCHI-FTLOOA model, a comprehensive experimental analysis was conducted under the laryngeal dataset. The comparison study of the CDLCHI-FTLOOA model portrayed a superior accuracy value of 97.16% over existing techniques.</p>
</sec>
</body>
<back>
<sec id="s6" sec-type="data-availability">
<title>Data availability statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec id="s7" sec-type="author-contributions">
<title>Author contributions</title>
<p>NA-K: Investigation, Software, Writing &#x2013; original draft. MJ: Data curation, Formal Analysis, Funding acquisition, Writing &#x2013; original draft. MK: Formal Analysis, Validation, Writing &#x2013; original draft, Writing &#x2013; review &amp; editing. SM: Methodology, Supervision, Writing &#x2013; original draft, Writing &#x2013; review &amp; editing.</p>
</sec>
<sec id="s8" sec-type="funding-information">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research and/or publication of this article. Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R104), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.</p>
</sec>
<sec id="s9" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s10" sec-type="ai-statement">
<title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec id="s11" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>L</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>B</given-names>
</name>
<name>
<surname>Su</surname> <given-names>L</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>S</given-names>
</name>
<etal/>
</person-group>. <article-title>Rapid histology of laryngeal squamous cell carcinoma with deep-learning based stimulated Raman scattering microscopy</article-title>. <source>Theranostics</source>. (<year>2019</year>) <volume>9</volume>:<fpage>2541</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.7150/thno.32655</pub-id>, PMID: <pub-id pub-id-type="pmid">31131052</pub-id></citation></ref>
<ref id="B2">
<label>2</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiong</surname> <given-names>H</given-names>
</name>
<name>
<surname>Lin</surname> <given-names>P</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>JG</given-names>
</name>
<name>
<surname>Ye</surname> <given-names>J</given-names>
</name>
<name>
<surname>Xiao</surname> <given-names>L</given-names>
</name>
<name>
<surname>Tao</surname> <given-names>Y</given-names>
</name>
<etal/>
</person-group>. <article-title>Computer-aided diagnosis of laryngeal cancer via deep learning based on laryngoscopic images</article-title>. <source>EBioMedicine</source>. (<year>2019</year>) <volume>48</volume>:<page-range>92&#x2013;9</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ebiom.2019.08.075</pub-id>, PMID: <pub-id pub-id-type="pmid">31594753</pub-id></citation></ref>
<ref id="B3">
<label>3</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Filipovsk&#xfd;</surname> <given-names>T</given-names>
</name>
<name>
<surname>Kalfe&#x159;t</surname> <given-names>D</given-names>
</name>
<name>
<surname>Lukavcov&#xe1;</surname> <given-names>E</given-names>
</name>
<name>
<surname>Zav&#xe1;zalov&#xe1;</surname> <given-names>&#x160;</given-names>
</name>
<name>
<surname>Hlo&#x17e;ek</surname> <given-names>J</given-names>
</name>
<name>
<surname>Kov&#xe1;&#x159;</surname> <given-names>D</given-names>
</name>
<etal/>
</person-group>. <article-title>The importance of preoperative and perioperative Narrow Band Imaging endoscopy in the diagnosis of pre-tumor and tumor lesions of the larynx</article-title>. <source>J Appl Biomedicine</source>. (<year>2023</year>) <volume>21</volume>:<page-range>107&#x2013;12</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.32725/jab.2023.015</pub-id>, PMID: <pub-id pub-id-type="pmid">37747310</pub-id></citation></ref>
<ref id="B4">
<label>4</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>D&#x2019;Ambra</surname> <given-names>M</given-names>
</name>
<name>
<surname>Tedesco</surname> <given-names>A</given-names>
</name>
<name>
<surname>Iacone</surname> <given-names>B</given-names>
</name>
<name>
<surname>Bracale</surname> <given-names>U</given-names>
</name>
<name>
<surname>Corcione</surname> <given-names>F</given-names>
</name>
<name>
<surname>Peltrini</surname> <given-names>R</given-names>
</name>
</person-group>. <article-title>First application of the Orbeye&#x2122; 4K 3D exoscope in recurrent papillary thyroid cancer surgery</article-title>. <source>J Clin Med</source>. (<year>2023</year>) <volume>12</volume>:<fpage>2492</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/jcm12072492</pub-id>, PMID: <pub-id pub-id-type="pmid">37048576</pub-id></citation></ref>
<ref id="B5">
<label>5</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alrowais</surname> <given-names>F</given-names>
</name>
<name>
<surname>Mahmood</surname> <given-names>K</given-names>
</name>
<name>
<surname>Alotaibi</surname> <given-names>SS</given-names>
</name>
<name>
<surname>Hamza</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Marzouk</surname> <given-names>R</given-names>
</name>
<name>
<surname>Mohamed</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Laryngeal cancer detection and classification using aquila optimization algorithm with deep learning on throat region images</article-title>. <source>IEEE Access</source>. (<year>2023</year>) <volume>11</volume>:<page-range>115306&#x2013;15</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3324880</pub-id>
</citation></ref>
<ref id="B6">
<label>6</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohamed</surname> <given-names>N</given-names>
</name>
<name>
<surname>Almutairi</surname> <given-names>RL</given-names>
</name>
<name>
<surname>Abdelrahim</surname> <given-names>S</given-names>
</name>
<name>
<surname>Alharbi</surname> <given-names>R</given-names>
</name>
<name>
<surname>Alhomayani</surname> <given-names>FM</given-names>
</name>
<name>
<surname>Elamin Elnaim</surname> <given-names>BM</given-names>
</name>
<etal/>
</person-group>. <article-title>Automated Laryngeal cancer detection and classification using dwarf mongoose optimization algorithm with deep learning</article-title>. <source>Cancers</source>. (<year>2023</year>) <volume>16</volume>:<fpage>181</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/cancers16010181</pub-id>, PMID: <pub-id pub-id-type="pmid">38201608</pub-id></citation></ref>
<ref id="B7">
<label>7</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname> <given-names>ZH</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>DG</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>JQ</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>JW</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Li</surname> <given-names>YZ</given-names>
</name>
</person-group>. <article-title>Computer-aided diagnosis of laryngeal cancer based on deep learning with laryngoscopic images</article-title>. <source>Diagnostics</source>. (<year>2023</year>) <volume>13</volume>:<fpage>3669</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/diagnostics13243669</pub-id>, PMID: <pub-id pub-id-type="pmid">38132254</pub-id></citation></ref>
<ref id="B8">
<label>8</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>He</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Cheng</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>Z</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>W</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>R</given-names>
</name>
<name>
<surname>Cheng</surname> <given-names>L</given-names>
</name>
<etal/>
</person-group>. <article-title>A deep convolutional neural network-based method for laryngeal squamous cell carcinoma diagnosis</article-title>. <source>Ann Trans Med</source>. (<year>2021</year>) <volume>9</volume>:<fpage>1797</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.21037/atm-21-6458</pub-id>, PMID: <pub-id pub-id-type="pmid">35071491</pub-id></citation></ref>
<ref id="B9">
<label>9</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Esmaeili</surname> <given-names>N</given-names>
</name>
<name>
<surname>Sharaf</surname> <given-names>E</given-names>
</name>
<name>
<surname>Gomes Ataide</surname> <given-names>EJ</given-names>
</name>
<name>
<surname>Illanes</surname> <given-names>A</given-names>
</name>
<name>
<surname>Boese</surname> <given-names>A</given-names>
</name>
<name>
<surname>Davaris</surname> <given-names>N</given-names>
</name>
<etal/>
</person-group>. <article-title>Deep convolution neural network for laryngeal cancer classification on contact endoscopy-narrow band imaging</article-title>. <source>Sensors</source>. (<year>2021</year>) <volume>21</volume>:<fpage>8157</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/s21238157</pub-id>, PMID: <pub-id pub-id-type="pmid">34884166</pub-id></citation></ref>
<ref id="B10">
<label>10</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bakhvalov</surname> <given-names>S</given-names>
</name>
<name>
<surname>Osadchy</surname> <given-names>E</given-names>
</name>
<name>
<surname>Bogdanova</surname> <given-names>I</given-names>
</name>
<name>
<surname>Shichiyakh</surname> <given-names>R</given-names>
</name>
<name>
<surname>Lydia</surname> <given-names>EL</given-names>
</name>
</person-group>. <article-title>Intelligent system for customer churn prediction using dipper throat optimization with deep learning on telecom industries</article-title>. <source>Fusion: Pract Appl</source>. (<year>2024</year>) <volume>14</volume>:<page-range>172&#x2013;85</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.54216/FPA.140214</pub-id>
</citation></ref>
<ref id="B11">
<label>11</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Baldini</surname> <given-names>C</given-names>
</name>
<name>
<surname>Migliorelli</surname> <given-names>L</given-names>
</name>
<name>
<surname>Berardini</surname> <given-names>D</given-names>
</name>
<name>
<surname>Azam</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Sampieri</surname> <given-names>C</given-names>
</name>
<name>
<surname>Ioppi</surname> <given-names>A</given-names>
</name>
<etal/>
</person-group>. <article-title>Improving real-time detection of laryngeal lesions in endoscopic images using a decoupled super-resolution enhanced YOLO</article-title>. <source>Comput Methods Programs Biomedicine</source>. (<year>2025</year>) <volume>260</volume>:<fpage>108539</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.cmpb.2024.108539</pub-id>, PMID: <pub-id pub-id-type="pmid">39689500</pub-id></citation></ref>
<ref id="B12">
<label>12</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Meer</surname> <given-names>M</given-names>
</name>
<name>
<surname>Khan</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Jabeen</surname> <given-names>K</given-names>
</name>
<name>
<surname>Alzahrani</surname> <given-names>AI</given-names>
</name>
<name>
<surname>Alalwan</surname> <given-names>N</given-names>
</name>
<name>
<surname>Shabaz</surname> <given-names>M</given-names>
</name>
<etal/>
</person-group>. <article-title>Deep convolutional neural networks information fusion and improved whale optimization algorithm based smart oral squamous cell carcinoma classification framework using histopathological images</article-title>. <source>Expert Syst</source>. (<year>2025</year>) <volume>42</volume>:<elocation-id>e13536</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1111/exsy.13536</pub-id>
</citation></ref>
<ref id="B13">
<label>13</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Albekairi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Mohamed</surname> <given-names>MVO</given-names>
</name>
<name>
<surname>Kaaniche</surname> <given-names>K</given-names>
</name>
<name>
<surname>Abbas</surname> <given-names>G</given-names>
</name>
<name>
<surname>Alanazi</surname> <given-names>MD</given-names>
</name>
<name>
<surname>Alanazi</surname> <given-names>TM</given-names>
</name>
<etal/>
</person-group>. <article-title>Multimodal medical image fusion combining saliency perception and generative adversarial network</article-title>. <source>Sci Rep</source>. (<year>2025</year>) <volume>15</volume>:<fpage>10609</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-025-95147-y</pub-id>, PMID: <pub-id pub-id-type="pmid">40148552</pub-id></citation></ref>
<ref id="B14">
<label>14</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Joseph</surname> <given-names>JS</given-names>
</name>
<name>
<surname>Vidyarthi</surname> <given-names>A</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>VP</given-names>
</name>
</person-group>. <article-title>An improved approach for initial stage detection of laryngeal cancer using effective hybrid features and ensemble learning method</article-title>. <source>Multimedia Tools Appl</source>. (<year>2024</year>) <volume>83</volume>:<page-range>17897&#x2013;919</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11042-023-16077-3</pub-id>
</citation></ref>
<ref id="B15">
<label>15</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmad</surname> <given-names>I</given-names>
</name>
<name>
<surname>Islam</surname> <given-names>ZU</given-names>
</name>
<name>
<surname>Riaz</surname> <given-names>S</given-names>
</name>
<name>
<surname>Xue</surname> <given-names>F</given-names>
</name>
</person-group>. <article-title>MANS-net: multiple attention-based nuclei segmentation in multi organ digital cancer histopathology images</article-title>. <source>IEEE Access</source>. (<year>2024</year>) <volume>12</volume>:<page-range>173530&#x2013;9</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ACCESS.2024.3502766</pub-id>
</citation></ref>
<ref id="B16">
<label>16</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Krishna</surname> <given-names>S</given-names>
</name>
<name>
<surname>Suganthi</surname> <given-names>SS</given-names>
</name>
<name>
<surname>Bhavsar</surname> <given-names>A</given-names>
</name>
<name>
<surname>Yesodharan</surname> <given-names>J</given-names>
</name>
<name>
<surname>Krishnamoorthy</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>An interpretable decision-support model for breast cancer diagnosis using histopathology images</article-title>. <source>J Pathol Inf</source>. (<year>2023</year>) <volume>14</volume>:<fpage>100319</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jpi.2023.100319</pub-id>, PMID: <pub-id pub-id-type="pmid">37416058</pub-id></citation></ref>
<ref id="B17">
<label>17</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmad</surname> <given-names>I</given-names>
</name>
<name>
<surname>Xia</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Cui</surname> <given-names>H</given-names>
</name>
<name>
<surname>Islam</surname> <given-names>ZU</given-names>
</name>
</person-group>. <article-title>DAN-NucNet: A dual attention based framework for nuclei segmentation in cancer histology images under wild clinical conditions</article-title>. <source>Expert Syst Appl</source>. (<year>2023</year>) <volume>213</volume>:<fpage>118945</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2022.118945</pub-id>
</citation></ref>
<ref id="B18">
<label>18</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname> <given-names>R</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>X</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Arthur</surname> <given-names>C</given-names>
</name>
<name>
<surname>Qin</surname> <given-names>D</given-names>
</name>
</person-group>. <article-title>Comparison of clinical nasal endoscopy, optical biopsy, and artificial intelligence in early diagnosis and treatment planning in laryngeal cancer: a prospective observational study</article-title>. <source>Front Oncol</source>. (<year>2025</year>) <volume>15</volume>:<elocation-id>1582011</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.3389/fonc.2025.1582011</pub-id>, PMID: <pub-id pub-id-type="pmid">40556680</pub-id></citation></ref>
<ref id="B19">
<label>19</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alzakari</surname> <given-names>SA</given-names>
</name>
<name>
<surname>Maashi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Alahmari</surname> <given-names>S</given-names>
</name>
<name>
<surname>Arasi</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Alharbi</surname> <given-names>AA</given-names>
</name>
<name>
<surname>Sayed</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Towards laryngeal cancer diagnosis using Dandelion Optimizer Algorithm with ensemble learning on biomedical throat region images</article-title>. <source>Sci Rep</source>. (<year>2024</year>) <volume>14</volume>:<fpage>19713</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-024-70525-0</pub-id>, PMID: <pub-id pub-id-type="pmid">39181918</pub-id></citation></ref>
<ref id="B20">
<label>20</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Al Khulayf</surname> <given-names>AMF</given-names>
</name>
<name>
<surname>Alamgeer</surname> <given-names>M</given-names>
</name>
<name>
<surname>Obayya</surname> <given-names>M</given-names>
</name>
<name>
<surname>Alqahtani</surname> <given-names>M</given-names>
</name>
<name>
<surname>Ebad</surname> <given-names>SA</given-names>
</name>
<name>
<surname>Aljehane</surname> <given-names>NO</given-names>
</name>
<etal/>
</person-group>. <article-title>Mathematical fusion of efficient transfer learning with fine-tuning model for laryngeal cancer detection and classification in the throat region using biomedical images</article-title>. <source>Alexandria Eng J</source>. (<year>2025</year>) <volume>129</volume>:<page-range>658&#x2013;71</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.aej.2025.06.044</pub-id>
</citation></ref>
<ref id="B21">
<label>21</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sachane</surname> <given-names>MN</given-names>
</name>
<name>
<surname>Patil</surname> <given-names>SA</given-names>
</name>
</person-group>. <article-title>Hybrid QDCNN-DNFN for laryngeal cancer detection using image and voice analysis in federated learning</article-title>. <source>Sens Imaging</source>. (<year>2024</year>) <volume>26</volume>:<fpage>1</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11220-024-00531-z</pub-id>
</citation></ref>
<ref id="B22">
<label>22</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname> <given-names>K</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>H</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>X</given-names>
</name>
<name>
<surname>Ning</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>Q</given-names>
</name>
<name>
<surname>Lv</surname> <given-names>F</given-names>
</name>
<etal/>
</person-group>. <article-title>Multiparameter MRI-based model integrating radiomics and deep learning for preoperative staging of laryngeal squamous cell carcinoma</article-title>. <source>Sci Rep</source>. (<year>2025</year>) <volume>15</volume>:<fpage>16239</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-025-01270-1</pub-id>, PMID: <pub-id pub-id-type="pmid">40346120</pub-id></citation></ref>
<ref id="B23">
<label>23</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alazwari</surname> <given-names>S</given-names>
</name>
<name>
<surname>Maashi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Alsamri</surname> <given-names>J</given-names>
</name>
<name>
<surname>Alamgeer</surname> <given-names>M</given-names>
</name>
<name>
<surname>Ebad</surname> <given-names>SA</given-names>
</name>
<name>
<surname>Alotaibi</surname> <given-names>SS</given-names>
</name>
<etal/>
</person-group>. <article-title>Improving laryngeal cancer detection using chaotic metaheuristics integration with squeeze-and-excitation resnet model</article-title>. <source>Health Inf Sci Syst</source>. (<year>2024</year>) <volume>12</volume>:<fpage>38</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s13755-024-00296-5</pub-id>, PMID: <pub-id pub-id-type="pmid">39006830</pub-id></citation></ref>
<ref id="B24">
<label>24</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dharani</surname> <given-names>R</given-names>
</name>
<name>
<surname>Danesh</surname> <given-names>K</given-names>
</name>
</person-group>. <article-title>Optimized deep learning ensemble for accurate oral cancer detection using CNNs and metaheuristic tuning</article-title>. <source>Intelligence-Based Med</source>. (<year>2025</year>) <volume>11</volume>:<fpage>100258</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ibmed.2025.100258</pub-id>
</citation></ref>
<ref id="B25">
<label>25</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Majeed</surname> <given-names>T</given-names>
</name>
<name>
<surname>Masoodi</surname> <given-names>TA</given-names>
</name>
<name>
<surname>Macha</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Bhat</surname> <given-names>MR</given-names>
</name>
<name>
<surname>Muzaffar</surname> <given-names>K</given-names>
</name>
<name>
<surname>Assad</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Addressing data imbalance challenges in oral cavity histopathological whole slide images with advanced deep learning techniques</article-title>. <source>Int J System Assur Eng Manage</source>. (<year>2024</year>), <fpage>1</fpage>&#x2013;<lpage>9</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s13198-024-02440-6</pub-id>
</citation></ref>
<ref id="B26">
<label>26</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname> <given-names>B</given-names>
</name>
<name>
<surname>Yadav</surname> <given-names>I</given-names>
</name>
<name>
<surname>Tsai</surname> <given-names>JC</given-names>
</name>
<name>
<surname>Madabhushi</surname> <given-names>A</given-names>
</name>
<name>
<surname>Kann</surname> <given-names>BH</given-names>
</name>
</person-group>. <article-title>Artificial intelligence for head and neck squamous cell carcinoma: from diagnosis to treatment</article-title>. <source>Am Soc Clin Oncol Educ Book</source>. (<year>2025</year>) <volume>45</volume>:<elocation-id>e472464</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1200/EDBK-25-472464</pub-id>, PMID: <pub-id pub-id-type="pmid">40489724</pub-id></citation></ref>
<ref id="B27">
<label>27</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kumar</surname> <given-names>KV</given-names>
</name>
<name>
<surname>Palakurthy</surname> <given-names>S</given-names>
</name>
<name>
<surname>Balijadaddanala</surname> <given-names>SH</given-names>
</name>
<name>
<surname>Pappula</surname> <given-names>SR</given-names>
</name>
<name>
<surname>Lavudya</surname> <given-names>AK</given-names>
</name>
</person-group>. <article-title>Early detection and diagnosis of oral cancer using deep neural network</article-title>. <source>J Comput Allied Intell (JCAI ISSN: 2584-2676)</source>. (<year>2024</year>) <volume>2</volume>:<fpage>22</fpage>&#x2013;<lpage>34</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.69996/jcai.2024008</pub-id>
</citation></ref>
<ref id="B28">
<label>28</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alotaibi</surname> <given-names>SR</given-names>
</name>
<name>
<surname>Alohali</surname> <given-names>MA</given-names>
</name>
<name>
<surname>Maashi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Alqahtani</surname> <given-names>H</given-names>
</name>
<name>
<surname>Alotaibi</surname> <given-names>M</given-names>
</name>
<name>
<surname>Mahmud</surname> <given-names>A</given-names>
</name>
</person-group>. <article-title>Advances in colorectal cancer diagnosis using optimal deep feature fusion approach on biomedical images</article-title>. <source>Sci Rep</source>. (<year>2025</year>) <volume>15</volume>:<fpage>4200</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-024-83466-5</pub-id>, PMID: <pub-id pub-id-type="pmid">39905104</pub-id></citation></ref>
<ref id="B29">
<label>29</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kia</surname> <given-names>M</given-names>
</name>
<name>
<surname>Sadeghi</surname> <given-names>S</given-names>
</name>
<name>
<surname>Safarpour</surname> <given-names>H</given-names>
</name>
<name>
<surname>Kamsari</surname> <given-names>M</given-names>
</name>
<name>
<surname>Jafarzadeh Ghoushchi</surname> <given-names>S</given-names>
</name>
<name>
<surname>Ranjbarzadeh</surname> <given-names>R</given-names>
</name>
</person-group>. <article-title>Innovative fusion of VGG16, MobileNet, EfficientNet, AlexNet, and ResNet50 for MRI-based brain tumor identification</article-title>. <source>Iran J Comput Sci</source>. (<year>2025</year>) <volume>8</volume>:<fpage>185</fpage>&#x2013;<lpage>215</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s42044-024-00216-6</pub-id>
</citation></ref>
<ref id="B30">
<label>30</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gangrade</surname> <given-names>J</given-names>
</name>
<name>
<surname>Kuthiala</surname> <given-names>R</given-names>
</name>
<name>
<surname>Gangrade</surname> <given-names>S</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>YP</given-names>
</name>
<name>
<surname>Solanki</surname> <given-names>S</given-names>
</name>
</person-group>. <article-title>A deep ensemble learning approach for squamous cell classification in cervical cancer</article-title>. <source>Sci Rep</source>. (<year>2025</year>) <volume>15</volume>:<fpage>7266</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-025-91786-3</pub-id>, PMID: <pub-id pub-id-type="pmid">40025091</pub-id></citation></ref>
<ref id="B31">
<label>31</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Srinivasan</surname> <given-names>MN</given-names>
</name>
<name>
<surname>Sikkandar</surname> <given-names>MY</given-names>
</name>
<name>
<surname>Alhashim</surname> <given-names>M</given-names>
</name>
<name>
<surname>Chinnadurai</surname> <given-names>M</given-names>
</name>
</person-group>. <article-title>Capsule network approach for monkeypox (CAPSMON) detection and subclassification in medical imaging system</article-title>. <source>Sci Rep</source>. (<year>2025</year>) <volume>15</volume>:<fpage>3296</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-025-87993-7</pub-id>, PMID: <pub-id pub-id-type="pmid">39865160</pub-id></citation></ref>
<ref id="B32">
<label>32</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hossain</surname> <given-names>Y</given-names>
</name>
<name>
<surname>Ferdous</surname> <given-names>Z</given-names>
</name>
<name>
<surname>Wahid</surname> <given-names>T</given-names>
</name>
<name>
<surname>Rahman</surname> <given-names>MT</given-names>
</name>
<name>
<surname>Dey</surname> <given-names>UK</given-names>
</name>
<name>
<surname>Islam</surname> <given-names>MA</given-names>
</name>
</person-group>. <article-title>Enhancing intrusion detection systems: Innovative deep learning approaches using CNN, RNN, DBN and autoencoders for robust network security</article-title>. <source>Appl Comput Sci</source>. (<year>2025</year>) <volume>21</volume>:<page-range>111&#x2013;25</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.35784/acs_6667</pub-id>
</citation></ref>
<ref id="B33">
<label>33</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gadlegaonkar</surname> <given-names>N</given-names>
</name>
<name>
<surname>Bansod</surname> <given-names>PJ</given-names>
</name>
<name>
<surname>Lakshmikanthan</surname> <given-names>A</given-names>
</name>
<name>
<surname>Bhole</surname> <given-names>K</given-names>
</name>
<name>
<surname>GC</surname> <given-names>MP</given-names>
</name>
<name>
<surname>Linul</surname> <given-names>E</given-names>
</name>
</person-group>. <article-title>Osprey algorithm-based optimization of selective laser melting parameters for enhanced hardness and wear resistance in alSi10Mg alloy</article-title>. <source>J Materials Res Technology</source>. (<year>2025</year>) <volume>36</volume>:<page-range>3556&#x2013;3597</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jmrt.2025.04.039</pub-id>
</citation></ref>
<ref id="B34">
<label>34</label>
<citation citation-type="web">Available online at: <uri xlink:href="https://www.kaggle.com/datasets/mahdiehhajian/laryngeal-dataset">https://www.kaggle.com/datasets/mahdiehhajian/laryngeal-dataset</uri> (Accessed <access-date>March 3, 2025</access-date>).</citation></ref>
<ref id="B35">
<label>35</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>H</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>K</given-names>
</name>
<name>
<surname>Mainardi</surname> <given-names>L</given-names>
</name>
</person-group>. <article-title>An interpretable framework utilizing radiomics for laryngeal cancer classification through narrow band imaging</article-title>. <source>IEEE Access</source>. (<year>2024</year>) <volume>12</volume>:<page-range>129804&#x2013;12</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ACCESS.2024.3408752</pub-id>
</citation></ref>
</ref-list>
</back>
</article>