<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Artif. Intell.</journal-id>
<journal-title>Frontiers in Artificial Intelligence</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Artif. Intell.</abbrev-journal-title>
<issn pub-type="epub">2624-8212</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frai.2024.1351942</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Artificial Intelligence</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>ALL classification using neural ensemble and memetic deep feature optimization</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Awais</surname> <given-names>Muhammad</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2556219/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<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>Ahmad</surname> <given-names>Riaz</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Kausar</surname> <given-names>Nabeela</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Alzahrani</surname> <given-names>Ahmed Ibrahim</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1862204/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Alalwan</surname> <given-names>Nasser</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Masood</surname> <given-names>Anum</given-names></name>
<xref ref-type="aff" rid="aff6"><sup>6</sup></xref>
<xref ref-type="aff" rid="aff7"><sup>7</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2232616/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Electrical and Computer Engineering, COMSATS University Islamabad</institution>, <addr-line>Wah</addr-line>, <country>Pakistan</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Computer Engineering, TED University Ankara</institution>, <addr-line>Ankara</addr-line>, <country>T&#x000FC;rkiye</country></aff>
<aff id="aff3"><sup>3</sup><institution>Department of Computer Science, Iqra University Islamabad</institution>, <addr-line>Islamabad</addr-line>, <country>Pakistan</country></aff>
<aff id="aff4"><sup>4</sup><institution>Department of Computer Science, COMSATS University Islamabad</institution>, <addr-line>Wah</addr-line>, <country>Pakistan</country></aff>
<aff id="aff5"><sup>5</sup><institution>Department of Computer Science, Community College, King Saud University</institution>, <addr-line>Riyadh</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff6"><sup>6</sup><institution>Department of Physics, Norwegian University of Science and Technology</institution>, <addr-line>Trondheim</addr-line>, <country>Norway</country></aff>
<aff id="aff7"><sup>7</sup><institution>Department of Radiology, Boston Children&#x00027;s Hospital</institution>, <addr-line>Boston, MA</addr-line>, <country>United States</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Erik Cuevas, University of Guadalajara, Mexico</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Ahmed Salama, Future University in Egypt, Egypt</p>
<p>Ayad Al-Dujaili, Middle Technical University, Iraq</p>
<p>Pooja Pathak, GLA University, India</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Muhammad Awais <email>muhammadawais&#x00040;ciitwah.edu.pk</email></corresp>
<corresp id="c002">Anum Masood <email>anum.masood&#x00040;ntnu.no</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>09</day>
<month>04</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>7</volume>
<elocation-id>1351942</elocation-id>
<history>
<date date-type="received">
<day>10</day>
<month>12</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>15</day>
<month>03</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2024 Awais, Ahmad, Kausar, Alzahrani, Alalwan and Masood.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Awais, Ahmad, Kausar, Alzahrani, Alalwan and Masood</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>
<p>Acute lymphoblastic leukemia (ALL) is a fatal blood disorder characterized by the excessive proliferation of immature white blood cells, originating in the bone marrow. An effective prognosis and treatment of ALL calls for its accurate and timely detection. Deep convolutional neural networks (CNNs) have shown promising results in digital pathology. However, they face challenges in classifying different subtypes of leukemia due to their subtle morphological differences. This study proposes an improved pipeline for binary detection and sub-type classification of ALL from blood smear images. At first, a customized, 88 layers deep CNN is proposed and trained using transfer learning along with GoogleNet CNN to create an ensemble of features. Furthermore, this study models the feature selection problem as a combinatorial optimization problem and proposes a memetic version of binary whale optimization algorithm, incorporating Differential Evolution-based local search method to enhance the exploration and exploitation of feature search space. The proposed approach is validated using publicly available standard datasets containing peripheral blood smear images of various classes of ALL. An overall best average accuracy of 99.15% is achieved for binary classification of ALL with an 85% decrease in the feature vector, together with 99% precision and 98.8% sensitivity. For B-ALL sub-type classification, the best accuracy of 98.69% is attained with 98.7% precision and 99.57% specificity. The proposed methodology shows better performance metrics as compared with several existing studies.</p></abstract>
<kwd-group>
<kwd>deep neural networks</kwd>
<kwd>optimization</kwd>
<kwd>meta-heuristics</kwd>
<kwd>transfer learning</kwd>
<kwd>convolutional neural network</kwd>
</kwd-group>
<contract-sponsor id="cn001">King Saud University<named-content content-type="fundref-id">10.13039/501100002383</named-content></contract-sponsor>
<counts>
<fig-count count="12"/>
<table-count count="14"/>
<equation-count count="22"/>
<ref-count count="36"/>
<page-count count="21"/>
<word-count count="11076"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Pattern Recognition</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Blood is an essential element for life and general health of human beings. It performs several crucial functions including transport of nutrients and waste materials, controlling flow of oxygen and overall immune system of body. Human blood is composed of three main types of blood cells, namely, erythrocytes, thrombocytes, and leukocytes. Each cell type performs a specific function in the human body. For example, leukocytes also referred as white blood cells (WBCs) are responsible for human immune and inflammatory response against diseases. Any abnormality in the structure and count of blood cells leads to certain diseases. As an example, leukemia, a blood malignancy, is caused due to an excessive leukocyte production in the bone marrows.</p>
<p>Leukemia is a widespread disease with over 475,000 new cases diagnosed worldwide each year and 312,000 annual deaths (Sung et al., <xref ref-type="bibr" rid="B34">2021</xref>). With 62,770 new cases and 23,670 deaths anticipated, leukemia remains a significant public health concern for the United States in 2024 (Siegel et al., <xref ref-type="bibr" rid="B33">2024</xref>). It is primarily categorized into two types: acute and chronic. Acute leukemia is distinguished by the rapid and unregulated proliferation of immature white blood cells within the bone marrow, which displaces the healthy cells. The fast progression of disease requires prompt response. On the other hand, the chronic leukemia is a slow progressing disease in which gradual accumulation of mature but abnormal WBCs takes place. Although these cells are typically more functional than those found in acute leukemia, they are aberrant and can still affect the normal functionality of blood and bone marrow. The acute and chronic categories of leukemia are further classified into myeloid and lymphoblastic sub-types, based on their afflicted cells. The acute lymphoblastic type of leukemia (ALL) affects the lymphoid cells and has high likelihood of occurring in the children and young adults. It represents &#x0007E;14% of all new leukemia cases. Approximately 90% of ALL cases occur in individuals younger than 20 years old, with a peak incidence observed in children aged 2&#x02013;5 (Sung et al., <xref ref-type="bibr" rid="B34">2021</xref>). An estimated 6,550 new cases of ALL are expected in the US in 2024 (Siegel et al., <xref ref-type="bibr" rid="B33">2024</xref>).</p>
<p>A form of acute lymphoblastic leukemia called B-cell acute lymphoblastic leukemia (B-ALL) develops from abnormal B-cell progenitors. Various sub types of B-ALL are further categorized based on distinct genetic, molecular, and immunophenotypic characteristics. Sub types of B-ALL include pre-cursor, mature, common, and pro B cell all.</p>
<p>The classical approach for the diagnosis of leukemia involves visual analysis of microscopic blood images by hematologists. This manual process needs human supervision; therefore, it is a time-consuming process and often prone to classification errors due to several factors (Matek et al., <xref ref-type="bibr" rid="B26">2019</xref>). Thus, an accurate, computer-aided diagnosis of leukemia is highly desirable (Khattak et al., <xref ref-type="bibr" rid="B23">2022</xref>). Among the modern approaches of computer vision, deep CNNs have demonstrated significant potential for a number of classification tasks in the biomedical domain. However, the computer vision-based blood analysis for leukemia diagnosis is difficult due to the small size, irregular structure, and physical similarities across various blood components (Kassani et al., <xref ref-type="bibr" rid="B21">2019</xref>). Moreover, the performance of CNNs depends heavily on their depth and structure. To obtain a high level of accuracy requires a large, accurately labeled dataset for deep neural network training from the scratch. However, due to a number of limitations, such datasets are frequently not easily accessible in the biomedical domain. In such a context, transfer learning stands out as the recommended strategy, entailing the retraining of a deep CNN originally trained on a substantially extensive dataset to suit a specific classification task. A number of pretrained CNNs have achieved high top-1 accuracy on benchmark datasets. GoogleNet (Szegedy et al., <xref ref-type="bibr" rid="B35">2015</xref>), Resnet (He et al., <xref ref-type="bibr" rid="B16">2016</xref>), Darknet (Redmon and Farhadi, <xref ref-type="bibr" rid="B30">2018</xref>), Densenet (Howard et al., <xref ref-type="bibr" rid="B18">2017</xref>), and Inception (Chollet, <xref ref-type="bibr" rid="B9">2017</xref>) are a few to mention. Recent research uses deep CNNs as extractors of features, which are then utilized to train outer classifiers. This leverages the power of transfer learning, allows for task-specific adaptation, and provides an efficient way to build accurate models. However, due to a large number of layers, deep CNNs extract high dimensionality feature representations from the input data. Afterward, feature selection is done to reduce the dimensionality of these extracted features, making them more manageable and potentially more informative. Efforts in current research are directed toward optimizing the computational efficiency and memory demands of the classification pipeline. The primary goal is to attain superior accuracy while operating with a more streamlined feature set (Khan et al., <xref ref-type="bibr" rid="B22">2020</xref>; Ahmad et al., <xref ref-type="bibr" rid="B2">2023b</xref>).</p>
<p>The remainder of the study is structured as follows: Section 2 presents a literature review of some recently published studies in the domain of leukemia identification. Section 3 offers an elaborate exposition of the proposed framework for ALL identification. In Section 4, we present and analyze simulation results, while discussion is concluded in Section 5.</p>
</sec>
<sec id="s2">
<title>2 Literature review</title>
<p><xref ref-type="table" rid="T1">Table 1</xref> presents a summary of some notable contributions in the realm of lekuemia identification using deep learning. They are discussed as follows. In the study mentioned in the reference, Elhassan et al. (<xref ref-type="bibr" rid="B12">2022</xref>), an approach is proposed for the detection of acute myeloid leukemia (AML) from WBC images. At first, a CMYK moment-based localization method is proposed to isolate the region of interest (ROI) from WBC images. This is followed by extraction and fusion of several pointwise and spatial features. Classification is performed using multiple classifiers including SVM and XG boost. The study reports the best accuracy of 97.57% on self collected single cell morphological dataset. In the study mentioned in the reference, Dese et al. (<xref ref-type="bibr" rid="B10">2021</xref>), a computer-assisted system is proposed for the diagnosis of several leukemia sub-types. The system is based on Gaussian and Weiner filtering for image pre-processing, followed by K-means clustering and marker-controlled Watershed algorithm for segmentation. Several morphological, texture, and statistical features are extracted and classified using multi-class SVM classifier. The best accuracy of 97.69% is reported for overall leukemia detection on self-collected dataset of peripheral blood smear images. In Al-jaboriy et al. (<xref ref-type="bibr" rid="B4">2019</xref>), an automatic method for the diagnosis of leukemia is proposed based on leukocyte cell segmentation. The method uses a dataset of 108 microscopic images and performs ANN-based segmentation and extracts various statistical features for classification. The best accuracy of 96% is achieved for binary classification of leukocyte cell blasts. The study mentioned in the reference, Kassani et al. (<xref ref-type="bibr" rid="B21">2019</xref>), the authors applied different augmentation techniques to the dataset images. Then, a hybrid CNN model consisting of hidden layers of VGG16, and MobileNet is proposed for feature extraction. The extracted features are classified using a NN architecture. The proposed method achieves a binary classification accuracy of 96.17%. In the study mentioned in the reference Jung et al. (<xref ref-type="bibr" rid="B20">2022</xref>), the authors proposed a custom CNN model for WBC classification for leukemia detection. The authors first created a synthetic dataset of WBC images using generative adversarial networks and then performed transfer learning of the proposed CNN for classification. An average accuracy of 97% is achieved by the system.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Summary of some published studies on leukemia identification.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Work</bold></th>
<th valign="top" align="center"><bold>Year</bold></th>
<th valign="top" align="left"><bold>Methodology</bold></th>
<th valign="top" align="left"><bold>Leukemia type</bold></th>
<th valign="top" align="left"><bold>Results</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="2">Batool and Byun (<xref ref-type="bibr" rid="B7">2023</xref>)</td>
<td valign="top" align="center" rowspan="2">2023</td>
<td valign="top" align="left">Data augmentation</td>
<td valign="top" align="left" rowspan="2">ALL</td>
<td valign="top" align="left">Binary accuracy &#x0003D; 99.31%</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: EfficientNetB3</td>
<td valign="top" align="left">Multiclass accuracy &#x0003D; 96.81%</td>
</tr> <tr>
<td valign="top" align="left" rowspan="3">Elhassan et al. (<xref ref-type="bibr" rid="B12">2022</xref>)</td>
<td valign="top" align="center" rowspan="3">2022</td>
<td valign="top" align="left">CMYK based ROI localization</td>
<td valign="top" align="left" rowspan="3">AML</td>
<td valign="top" align="left" rowspan="3">Accuracy &#x0003D; 97.57%</td>
</tr>
 <tr>
<td valign="top" align="left">Feature extraction: pointwise, spatial features</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: SVM, XG boost</td>
</tr> <tr>
<td valign="top" align="left" rowspan="4">Dese et al. (<xref ref-type="bibr" rid="B10">2021</xref>)</td>
<td valign="top" align="center" rowspan="4">2021</td>
<td valign="top" align="left">Preprocessing: median and Wiener filter</td>
<td valign="top" align="left">ALL, AML,</td>
<td valign="top" align="left" rowspan="4">Accuracy &#x0003D; 97.6%</td>
</tr>
 <tr>
<td valign="top" align="left">Segmentation: K-means clustering, watershed algorithm</td>
<td valign="top" align="left" rowspan="3">CLL, CML</td>
</tr>
 <tr>
<td valign="top" align="left">Feature extraction: morphological, texture, statistical</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: multiclass SVM</td>
</tr> <tr>
<td valign="top" align="left" rowspan="2">Kumar et al. (<xref ref-type="bibr" rid="B25">2020</xref>)</td>
<td valign="top" align="center" rowspan="2">2020</td>
<td valign="top" align="left">Feature extraction: K-best algorithm</td>
<td valign="top" align="left" rowspan="2">ALL, AML</td>
<td valign="top" align="left" rowspan="2">Accuracy = 97.25%</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: SVM, random forest, DT</td>
</tr> <tr>
<td valign="top" align="left" rowspan="3">Al-jaboriy et al. (<xref ref-type="bibr" rid="B4">2019</xref>)</td>
<td valign="top" align="center" rowspan="3">2019</td>
<td valign="top" align="left">Segmentation: AI based</td>
<td valign="top" align="left" rowspan="3">ALL</td>
<td valign="top" align="left" rowspan="3">Accuracy = 96%</td>
</tr>
 <tr>
<td valign="top" align="left">Statistical feature extraction</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: ANN</td>
</tr> <tr>
<td valign="top" align="left" rowspan="2">Kassani et al. (<xref ref-type="bibr" rid="B21">2019</xref>)</td>
<td valign="top" align="center" rowspan="2">2019</td>
<td valign="top" align="left">Multiple augmentation techniques</td>
<td valign="top" align="left" rowspan="2">ALL</td>
<td valign="top" align="left">Accuracy = 96.17%</td>
</tr>
 <tr>
<td valign="top" align="left">Classification: hybrid CNN model</td>
<td valign="top" align="left">Sensitivity = 95.17%</td>
</tr></tbody>
</table>
</table-wrap>
<p>For extracting and choosing blood features, the authors of the study mentioned in the reference, Alruwaili (<xref ref-type="bibr" rid="B5">2021</xref>) presented a stepwise linear discriminant analysis technique. The suggested method performs the identification of specific attributes within blood smear images and their classification based on partial <italic>F</italic>-values. A Matlab-based method for classifying and identifying WBC cancer was proposed in the study mentioned in the reference, Nithyaa et al. (<xref ref-type="bibr" rid="B28">2021</xref>). The approach integrates a range of morphological, clustering, and image pre-processing procedures with the utilization of random forest classification. In the study mentioned in the reference, Pang et al. (<xref ref-type="bibr" rid="B29">2015</xref>), an automatic leukocyte categorization approach is proposed. Initially, moment invariants are derived using the Euclidean distance transform within the nucleus region, followed by the extraction of morphological characteristics from the segmented cells.</p>
<p>The published literature on leukemia detection also proposes a number of proprietary deep CNNs and their ensembles. In the study mentioned in the reference, Batool and Byun (<xref ref-type="bibr" rid="B7">2023</xref>), a lightweight deep learning-based EfficientNet-B3 model is proposed which employs depth-wise separable convolutions for ALL classification. The method proposed in this study attains a classification accuracy of 96.81% when applied to publicly available datasets for leukemia sub-type classification. In the study mentioned in the reference, Kumar et al. (<xref ref-type="bibr" rid="B25">2020</xref>), a simple method for the detection of ALL, and AML is proposed in which KBest algorithm is used for feature extraction, followed by a dense CNN for classification. The proposed approach reports the best accuracy of 97.2%. In the study mentioned in the reference, Jha et al. (<xref ref-type="bibr" rid="B19">2022</xref>), a leukemia identification method is proposed which uses K-means clustering from image segmentation. Next, multiple statistical features are extracted to train an ensemble of multiple classifiers. The proposed system reports a best accuracy of 96.3%. In most of the existing studies that utilize deep transfer learning, the feature selection is performed using a filter or wrapper-based approach. Filter-based methods assess the relevance of individual features by examining their statistical properties, such as correlation with the target variable or variance within the feature. These methods have a limitation in that they do not consider the relevance between the selected features and the actual model&#x00027;s performance. This can lead to situations where selected features might not be the most predictive for the planned model. Conversely, wrapper-based methods entail employing a machine learning model in the capacity of a &#x0201C;wrapper&#x0201D; to assess the effectiveness of various feature subsets. These methods select features by repeatedly training and evaluating the model on different subsets of features. These methods are particularly useful in obtaining the best set of features for a specific classifier model. Recently, population-based algorithms for feature selection have received considerable research attention. A significant challenge lies in fine tuning the algorithm to achieve better exploration of feature search space and obtain the most discriminant and powerful set of features. Standard population-based algorithms used in several studies on disease classification often suffer from poor convergence and local optima problems (Gupta et al., <xref ref-type="bibr" rid="B15">2020</xref>; Shahzad et al., <xref ref-type="bibr" rid="B32">2022</xref>).</p>
<sec>
<title>2.1 Contributions</title>
<p>In this study, a hybrid method is proposed for the classification of ALL sub-types. The key contributions of this research can be outlined as follows:</p>
<list list-type="bullet">
<list-item><p>First, we present a customized 88-layer deep CNN architecture which incorporates the aspects of two standard deep CNN models, namely, AlexNet and SqueezeNet.</p></list-item>
<list-item><p>Subsequently, we employ transfer learning to extract features using the proposed custom CNN architecture and another deep model, namely, GoogleNet. The feature vectors from both networks are fused together.</p></list-item>
<list-item><p>For feature selection, we propose a memetic algorithm which combines a nature inspired meta-heuristic, i.e., whale optimization algorithm (WOA) with local search based on differential evolution. The proposed method achieves a better exploration of search space while avoiding local optima.</p></list-item>
<list-item><p>The set of selected features is then used to perform training and classification using several outer classifiers with multiple kernel settings.</p></list-item>
<list-item><p>The proposed pipeline is validated using public datasets for binary detection and sub-type classification of ALL. Better or comparable performance with significant reduction in feature vector size is demonstrated by the proposed method as compared with several existing studies.</p></list-item>
</list>
</sec>
</sec>
<sec sec-type="materials and methods" id="s3">
<title>3 Materials and methods</title>
<sec>
<title>3.1 Datasets</title>
<p>In this research, publicly accessible datasets comprising blood smear images are employed for both binary detection and the identification of ALL sub-types. The first dataset is the ALL-IDB2 dataset created by the authors of the study mentioned in the reference, Scotti et al. (<xref ref-type="bibr" rid="B31">2005</xref>) at the University of Milan. This dataset consists of 260 images corresponding to two classes of subjects, i.e., &#x0201C;Healthy&#x0201D; and &#x0201C;ALL.&#x0201D; An optical microscope with a Canon Power Shot G5 camera is used to capture the images. The ALL-IDB2 dataset consists of cropped images of ALL-IDB1 dataset that obtains region of interest of normal and blast cells. The image resolution is 2, 592 &#x000D7; 1, 944 pixels with a TIFF format. Few samples of ALL-IDB2 dataset are shown in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Sample images of ALL-IDB2 dataset of the study mentioned in the reference, Scotti et al. (<xref ref-type="bibr" rid="B31">2005</xref>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0001.tif"/>
</fig>
<p>For multi-class classification, this study uses the dataset of the study mentioned in the reference, Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>), which is prepared at bone marrow laboratory of Taleqani Hospital Iran. The dataset is composed of 3, 242 images which are divided into &#x0201C;Benign&#x0201D; class and three sub types of B-Cell ALL, namely, &#x0201C;Early,&#x0201D; &#x0201C;Pre-cursor,&#x0201D; and &#x0201C;Pro B,&#x0201D; with a class distribution of 512, 955, 796, and 979 images, respectively. A microscope with 100&#x000D7; magnification of Zeiss Camera is used to capture the images having 224 &#x000D7; 224 pixel resolution. Few images of this dataset are shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Sample images of dataset of the study mentioned in the reference, Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0002.tif"/>
</fig>
</sec>
<sec>
<title>3.2 Computation pipeline</title>
<p><xref ref-type="fig" rid="F3">Figure 3</xref> shows the computation pipeline of the proposed framework for ALL identification and its sub-type classification. The pipeline accepts the raw microscopic images from selected database repositories. These images are then pre-processed using contrast enhancement and augmentation steps. The contrast-enhanced images are resized according to input layer requirements of two deep neural networks, i.e., GoogleNet and our proposed CNN and subjected to transfer learning step. The features extracted from these deep CNNs are serially fused together and then subjected to the feature selection step. The selected set of features is then classified using multiple classifiers. These steps are discussed in details as follows.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Proposed framework for binary and sub-type classification of ALL.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0003.tif"/>
</fig>
<sec>
<title>3.2.1 Dataset pre-processing</title>
<p>In the first step, the training and testing dataset images are subjected to contrast enhancement using color histogram equalization. When dealing with microscopic images, contrast enhancement by applying histogram equalization independently to R, G, and B channels may not always produce good results (Xie et al., <xref ref-type="bibr" rid="B36">2019</xref>). Equalizing the histogram across all three RGB channels can amplify existing noise in the image, especially in areas with low intensity values. This can make it difficult to distinguish between relevant features and noise artifacts. This study performs image contrast enhancement within the HSI image domain. HSI separates intensity information from hue and saturation, making it less susceptible to variations in lighting conditions that can affect RGB channels. This is particularly helpful for microscopic images, where lighting control can be challenging. By separating hue, saturation, and intensity, HSI provides distinct channels that can be individually analyzed or combined to extract specific features relevant to the recognition task. This can improve the ability to differentiate between different cell types, structures, or objects in the image.</p>
<p>The main steps of image contrast enhancement adopted in this study are as follows:</p>
<list list-type="order">
<list-item><p>Transform the RGB image into the HSI image;</p></list-item>
<list-item><p>Perform histogram equalization on the intensity channel;</p></list-item>
<list-item><p>Substitute the HSI image&#x00027;s intensity channel with the corresponding histogram-equalized intensity channel;</p></list-item>
<list-item><p>Revert the HSI image back to an RGB image.</p></list-item>
</list>
</sec>
<sec>
<title>3.2.2 Customized deep feature extraction</title>
<p>Feature extraction stands as a pivotal phase within the domain of deep learning. In this study, we employ transfer learning from a standard deep CNN, i.e., GoogleNet and our proposed custom CNN architecture for feature extraction. Both of these networks are elaborated upon as follows.</p>
<sec>
<title>3.2.2.1 GoogleNet</title>
<p>GoogleNet also referred to as InceptionV1 is a deep CNN architecture developed by the researchers at Google (Szegedy et al., <xref ref-type="bibr" rid="B35">2015</xref>). It is designed to solve some problems of earlier networks such as vanishing gradient problem and trade-off between complexity and efficiency. To solve the problem of overfitting due to very deep neural networks, the GoogleNet is based on the idea of having multiple sized filters, operating in the same level. The resultant network becomes wider rather than becoming deeper. Breakthrough performance is achieved due to the introduction of &#x02018;Inception modules&#x0201D; and auxiliary classifiers. An inception module is composed of parallel concatenation of convolutions with multiple sized kernels and pooling operations in order to allow efficient learning of local and global features. The GoogleNet also utilizes 1 &#x000D7; 1 convolutions which is also known as &#x0201C;network-in-network&#x0201D; layers. Incorporation of these layers before applying larger filter convolution results in a compact, computationally efficient network. Moreover, these layers are used to combine features across different inception modules for multi-abstraction feature learning.</p>
<p>The GoogleNet Architecture has 22 layers including nine linearly stacked inception modules, four max pool layers, a dropout regularization layer, and fully connected layer. The inception module terminations are linked to the global average pooling layer. The GoogleNet is pretrained on the ImageNet dataset,<xref ref-type="fn" rid="fn0001"><sup>1</sup></xref> which consists of thousands of image categories. To facilitate transfer learning on the leukemia dataset, several modifications are made to the network. First, the last learnable layer, referred to as &#x0201C;loss3-classifier,&#x0201D; is substituted with a new fully connected layer having an output count and matching the number of leukemia classes. Additionally, the network&#x00027;s softmax layer is replaced with a new softmax layer. Furthermore, the classification layer of the network is substituted with a new classification layer without class labels. Before commencing training, dimensions of all images are changed to 224 &#x000D7; 224 &#x000D7; 3 to conform to the network&#x00027;s input layer. Subsequently, various augmentation techniques, such as flipping, scaling, and random rotation, are applied. The extraction of deep features is conducted from the global average pool layer, denoted as &#x0201C;pool5-7x7_s1,&#x0201D; which yields a deep feature vector comprising 1 &#x000D7; 1,024 features per image.</p>
</sec>
<sec>
<title>3.2.2.2 Proposed custom network</title>
<p>This study introduces a novel deep CNN, which is meticulously designed to incorporate key attributes from two well-known deep models: AlexNet and SqueezeNet. AlexNet is composed of five convolutional layers and three fully connected layers. Furthermore, it incorporates three pooling layers, seven ReLU activation layers, two dropout layers, and a SoftMax layer. In contrast, the proposed CNN model encompasses 88 layers, spanning from the input to the output layer. Beyond the conventional layers inspired by AlexNet, the proposed model introduces additional elements such as batch normalization and structures reminiscent of SqueezeNet. The architectural view of customized architecture is shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. The size of input layer is 227 &#x000D7; 227 &#x000D7; 3, which is similar to the AlexNet architecture. The network starts with a convolution (CN) layer followed by ReLU (R), Batch Normalization (BN), Max Poopling (PL), Leaky ReLU (LR), and Drop out (D) layers. Embedded in the network, are the SqueezeNet like structures of parallel branches of grouped convolution layers (having a cascade of CN, R, LR, A, and BN layers). The individual branches of each group are merged together with the help of Addition (A) layer. The last three layers of the network are fully connected (FC), softmax and classoutput layer. <xref ref-type="table" rid="T2">Tables 2</xref>, <xref ref-type="table" rid="T3">3</xref> present the detailed configuration of all layers of the proposed CNN architecture.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Proposed custom CNN architecture.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0004.tif"/>
</fig>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Layer-specific details of the proposed CNN architecture.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Layer&#x00023;</bold></th>
<th valign="top" align="left"><bold>Layer name</bold></th>
<th valign="top" align="center"><bold>Filter map size</bold></th>
<th valign="top" align="center"><bold>Filter depth</bold></th>
<th valign="top" align="center"><bold>Stride</bold></th>
<th valign="top" align="center"><bold>Padding</bold></th>
<th valign="top" align="center"><bold>Learnable</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">01</td>
<td valign="top" align="left">Input image</td>
<td valign="top" align="center">227 &#x000D7; 227 &#x000D7; 3</td>
<td valign="top" align="center">11 &#x000D7; 11 &#x000D7; 3 &#x000D7; 96</td>
<td valign="top" align="center">[4 4]</td>
<td valign="top" align="center">[0 0 0 0]</td>
<td valign="top" align="center">wt 227 &#x000D7; 227 &#x000D7; 3 B 1 &#x000D7; 1 &#x000D7; 96</td>
</tr> <tr>
<td valign="top" align="left">02</td>
<td valign="top" align="left">CN1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td valign="top" align="center">&#x02013;</td>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">03</td>
<td valign="top" align="left">R1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td valign="top" align="center">&#x02013;</td>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">04</td>
<td valign="top" align="left">BN1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td valign="top" align="center">5 &#x000D7; 5 &#x000D7; 96 &#x000D7; 96</td>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">05</td>
<td valign="top" align="left">Pool</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 96</td>
<td valign="top" align="center">&#x02013;</td>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">06</td>
<td valign="top" align="left">CN2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td valign="top" align="center">&#x02013;</td>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">07</td>
<td valign="top" align="left">LR-1</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td valign="top" align="center">1 &#x000D7; 1 &#x000D7; 96 &#x000D7; 48</td>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">08</td>
<td valign="top" align="left">Drop_1</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td valign="top" align="center">&#x02013;</td>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">09</td>
<td valign="top" align="left">BN_2_1</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td valign="top" align="center">11 &#x000D7; 11 &#x000D7; 48 &#x000D7; 96</td>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">10</td>
<td valign="top" align="left">LR-1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">11</td>
<td valign="top" align="left">LR-2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">12</td>
<td valign="top" align="left">ADD1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 96</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">13</td>
<td valign="top" align="left">CN-5</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">14</td>
<td valign="top" align="left">BN_7_1</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">15</td>
<td valign="top" align="left">CN-3</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">16</td>
<td valign="top" align="left">LR4</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">17</td>
<td valign="top" align="left">BN3</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">18</td>
<td valign="top" align="left">CN_6_1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center"><italic>wt</italic>5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">19</td>
<td valign="top" align="left">BN_8_1</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">20</td>
<td valign="top" align="left">Addition_1_1</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">21</td>
<td valign="top" align="left">Dropout</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td valign="top" align="center">3 &#x000D7; 3 &#x000D7; 256 &#x000D7; 384</td>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">[1 1 1 1]</td>
<td/>
</tr> <tr>
<td valign="top" align="left">22</td>
<td valign="top" align="left">CN_1</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">23</td>
<td valign="top" align="left">CN_6</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">24</td>
<td valign="top" align="left">CN_5</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">25</td>
<td valign="top" align="left">Relu_3</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">26</td>
<td valign="top" align="left">BN-2</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">27</td>
<td valign="top" align="left">Relu_4</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">28</td>
<td valign="top" align="left">BN-6</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">29</td>
<td valign="top" align="left">Addition_1</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">30</td>
<td valign="top" align="left">pool-2</td>
<td valign="top" align="center">Max pool 3 &#x000D7; 3</td>
<td/>
<td valign="top" align="center">[2 2]</td>
<td valign="top" align="center">[0 0 0 0]</td>
<td/>
</tr> <tr>
<td valign="top" align="left">31</td>
<td valign="top" align="left">Dropout</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 256</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 256 &#x000D7; 384</td>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">[1 1 1 1]</td>
<td/>
</tr> <tr>
<td valign="top" align="left">32</td>
<td valign="top" align="left">CN3</td>
<td valign="top" align="center">3 &#x000D7; 3 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">33</td>
<td valign="top" align="left">CN_10</td>
<td valign="top" align="center">3 &#x000D7; 3 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">34</td>
<td valign="top" align="left">BN-6</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">35</td>
<td valign="top" align="left">CN_8</td>
<td valign="top" align="center">3 &#x000D7; 3 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">36</td>
<td valign="top" align="left">Relu_4</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">37</td>
<td valign="top" align="left">BN-6</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">38</td>
<td valign="top" align="left">Addition_2</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">39</td>
<td valign="top" align="left">CN_4_2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">40</td>
<td valign="top" align="left">CN_7</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">41</td>
<td valign="top" align="left">LR_5</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr>
<tr>
<td valign="top" align="left">42</td>
<td valign="top" align="left">BN-9</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">43</td>
<td valign="top" align="left">LR_5</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">44</td>
<td valign="top" align="left">Relu_4</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">45</td>
<td valign="top" align="left">CN_5_2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">46</td>
<td valign="top" align="left">BN_7_2</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">47</td>
<td valign="top" align="left">CN_6_2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">48</td>
<td valign="top" align="left">BN_8_2</td>
<td valign="top" align="center">27 &#x000D7; 27 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 256 scale 3 &#x000D7; 3 &#x000D7; 256</td>
</tr> <tr>
<td valign="top" align="left">49</td>
<td valign="top" align="left">Addition_1_2</td>
<td/>
<td/>
<td valign="top" align="center">[1 1]</td>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">50</td>
<td valign="top" align="left">Dropout_3</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">51</td>
<td valign="top" align="left">CN3</td>
<td valign="top" align="center">3 &#x000D7; 3 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">52</td>
<td valign="top" align="left">Relu_1</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Layer-specific details of the proposed CNN architecture (Contd.).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Layer&#x00023;</bold></th>
<th valign="top" align="left"><bold>Layer name</bold></th>
<th valign="top" align="center"><bold>Filter map size</bold></th>
<th valign="top" align="center"><bold>Filter depth</bold></th>
<th valign="top" align="center"><bold>Stride</bold></th>
<th valign="top" align="center"><bold>Padding</bold></th>
<th valign="top" align="center"><bold>Learnable</bold></th>
</tr>
<tr>
<th valign="top" align="center"><bold>53</bold></th>
<th valign="top" align="center"><bold>BN-4</bold></th>
<th valign="top" align="center"><bold>13 &#x000D7; 13 &#x000D7; 384</bold></th>
<th/>
<th/>
<th/>
<th/>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">54</td>
<td valign="top" align="left">CN_2</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">55</td>
<td valign="top" align="left">CN_12</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">56</td>
<td valign="top" align="left">CN_13</td>
<td valign="top" align="center">55 &#x000D7; 55 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">57</td>
<td valign="top" align="left">Relu_8</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">58</td>
<td valign="top" align="left">BN-12</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 384 scale 3 &#x000D7; 3 &#x000D7; 384</td>
</tr> <tr>
<td valign="top" align="left">59</td>
<td valign="top" align="left">Relu_7</td>
<td/>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">60</td>
<td valign="top" align="left">BN-11</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 384 scale 3 &#x000D7; 3 &#x000D7; 384</td>
</tr> <tr>
<td valign="top" align="left">61</td>
<td valign="top" align="left">Addition_3</td>
<td/>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">62</td>
<td valign="top" align="left">Dropout_4</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">63</td>
<td valign="top" align="left">CN_8</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">64</td>
<td valign="top" align="left">CN_4_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">65</td>
<td valign="top" align="left">LR_3_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 64 scale 1 &#x000D7; 31 &#x000D7; 64</td>
</tr> <tr>
<td valign="top" align="left">66</td>
<td valign="top" align="left">Relu_4_3</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">67</td>
<td valign="top" align="left">CN_5_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">68</td>
<td valign="top" align="left">LR_6</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">69</td>
<td valign="top" align="left">BN_10</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 64</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 64 scale 3 &#x000D7; 3 &#x000D7; 64</td>
</tr> <tr>
<td valign="top" align="left">70</td>
<td valign="top" align="left">CN_6_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr>
<tr>
<td valign="top" align="left">71</td>
<td valign="top" align="left">BN_8_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 384 scale 3 &#x000D7; 3 &#x000D7; 384</td>
</tr> <tr>
<td valign="top" align="left">72</td>
<td valign="top" align="left">BN_7_3</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 384</td>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td valign="top" align="center">Offset 1 &#x000D7; 1 &#x000D7; 384 scale 3 &#x000D7; 3 &#x000D7; 384</td>
</tr> <tr>
<td valign="top" align="left">73</td>
<td valign="top" align="left">Addition_1_3</td>
<td/>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">74</td>
<td valign="top" align="left">Dropout_5</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">75</td>
<td valign="top" align="left">CN-5</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">76</td>
<td valign="top" align="left">Relu_2</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">77</td>
<td valign="top" align="left">BN-5</td>
<td valign="top" align="center">13 &#x000D7; 13 &#x000D7; 256</td>
<td/>
<td/>
<td/>
<td valign="top" align="center">wt 5 &#x000D7; 5 &#x000D7; 48 &#x000D7; 128 B 1 &#x000D7; 1 &#x000D7; 2 &#x000D7; 128</td>
</tr> <tr>
<td valign="top" align="left">78</td>
<td valign="top" align="left">Pool5</td>
<td/>
<td/>
<td valign="top" align="center">[1 1]</td>
<td valign="top" align="center">Same</td>
<td/>
</tr> <tr>
<td valign="top" align="left">79</td>
<td valign="top" align="left">FC-1</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">80</td>
<td valign="top" align="left">Relu6</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">81</td>
<td valign="top" align="left">Drop6</td>
<td valign="top" align="center">1 &#x000D7; 1 &#x000D7; 2, 048</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">82</td>
<td valign="top" align="left">FC-2</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">83</td>
<td valign="top" align="left">Relu-7</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">84</td>
<td valign="top" align="left">Drop7</td>
<td valign="top" align="center">1 &#x000D7; 1 &#x000D7; 2, 048</td>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">85</td>
<td valign="top" align="left">FC-3</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">86</td>
<td valign="top" align="left">SoftMax</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr> <tr>
<td valign="top" align="left">87</td>
<td valign="top" align="left">Output</td>
<td/>
<td/>
<td/>
<td/>
<td/>
</tr></tbody>
</table>
</table-wrap>
<p>The leukemia datasets utilized in this research are relatively small, making it infeasible to train the proposed CNN model from the ground up. Consequently, the initial step involves pre-training the proposed CNN on the CIFAR-100 dataset (Krizhevsky et al., <xref ref-type="bibr" rid="B24">2009</xref>), which encompasses 100 object categories, each with 600 images. Subsequently, transfer learning is applied to adapt the pre-trained network to the leukemia dataset. The extraction of deep features is conducted from the FC-3 layer, yielding a feature vector with dimensions of 1 &#x000D7; 2, 048 for each image.</p>
</sec>
</sec>
<sec>
<title>3.2.3 Feature ensemble/fusion</title>
<p>Obtained feature vectors from both networks are combined together through a serial concatenation technique. The joint feature vector has a size of 1 &#x000D7; 3, 072 features per image.</p>
</sec>
<sec>
<title>3.2.4 Feature selection</title>
<p>Feature fusion enlarges the feature vector, potentially triggering the &#x02018;curse of dimensionality&#x00027; issue. This expanded feature vector may include duplicate features, which can result in overfitting by the classifier. Selection of the most relevant features is an essential step to achieve better generalization while reducing the computational complexity of the classification system. As an important contribution, this study models the problem of deep feature selection as a global combinatorial optimization problem and proposes a nature-inspired metaheuristic, i.e., whale optimization algorithm (WOA), to achieve the most pertinent set of features.</p>
<sec>
<title>3.2.4.1 Standard whale optimization algorithm</title>
<p>The WOA, as introduced by Mirjalili and Lewis in their study (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>), offers a solution to the challenge of discovering optimal solutions within intricate search spaces. This algorithm emulates the social and hunting behaviors of humpback whales, leveraging their techniques to improve solutions within the search space. Humpback whales employ a bubble-net hunting strategy to corral and capture their prey, particularly in the case of small fish groups.</p>
<p>Mathematically, the algorithm begins with a random whale population. The optimization model captures three whale behaviors: (a) hunting for prey (exploration), (b) encircling the prey, and (c) executing a bubble-net attack (exploitation).</p>
<sec>
<title>3.2.4.1.1 Encircling the prey</title>
<p>The current best candidate solution of a population is called as the &#x0201C;leader.&#x0201D; It is the whale which has the best fitness value and assumed to be closest to the target prey. All other solutions (whales) update their position toward the leader. Mathematically, the position update is computed as follows (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>):</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>t</italic> denotes the current iteration number, <inline-formula><mml:math id="M3"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the leader, i.e., population best solution so far, <inline-formula><mml:math id="M4"><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the individual whale. <inline-formula><mml:math id="M5"><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> and <inline-formula><mml:math id="M6"><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> are the co-efficient vectors calculated as follows (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>):</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E4"><label>(4)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>r</italic><sub>1</sub> and <italic>r</italic><sub>2</sub> are random numbers in [0, 1].</p>
</sec>
<sec>
<title>3.2.4.1.2 Bubble-net attacking</title>
<p>This behavior of humpback whales is mathematically modeled using two approaches.</p>
<list list-type="order">
<list-item><p>Shrinking encircle: to mimic this behavior, the value of <inline-formula><mml:math id="M9"><mml:mover accent="true"><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> is decreased from 2 to 0 through a linear function (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>)
<disp-formula id="E5"><label>(5)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic>t</italic><sub><italic>max</italic></sub> is the maximum number of iterations.</p></list-item>
<list-item><p>Spiral trajectory: the whales create an upward spiral loop around the prey. The position update due to this spiral trajectory is modeled as follows (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>):
<disp-formula id="E6"><label>(6)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E7"><label>(7)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mo>.</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>.</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo>.</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic>l</italic> is a random number in [&#x02212;1, 1] and <italic>b</italic> is a constant.</p></list-item>
</list>
<p>The position update of whales considering both phenomenons of spiral trajectory and shrinking encirclement is performed as follows:</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mo>.</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>.</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo>.</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mo>&#x02265;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
</sec>
<sec>
<title>3.2.4.1.3 Searching prey (exploration)</title>
<p>In addition to above hunting mechanisms, the humpback whales also search randomly according to position of each others. When <inline-formula><mml:math id="M14"><mml:mo>|</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>|</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, the position update of each whale is carried out using the <xref ref-type="disp-formula" rid="E1">Equation (1)</xref> whereas, for <inline-formula><mml:math id="M15"><mml:mo>|</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>|</mml:mo><mml:mo>&#x02265;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, the position update is computed as follows (Mirjalili and Lewis, <xref ref-type="bibr" rid="B27">2016</xref>):</p>
<disp-formula id="E9"><label>(9)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E10"><label>(10)</label><mml:math id="M17"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>X</italic><sub><italic>r</italic></sub>(<italic>t</italic>) is the randomly selected whale as the population best solution.</p>
</sec>
</sec>
<sec>
<title>3.2.4.2 Proposed hybrid binary whale optimization algorithm</title>
<p>The optimal feature selection problem is a binary combinatorial optimization problem. Therefore, an association rule is required to convert the real valued whale position vectors into binary sub-space. In this study, we have proposed a &#x0201C;V&#x0201D;-shaped transfer function for whale position update as follows:</p>
<disp-formula id="E11"><label>(11)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle><mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mstyle><mml:mfrac><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C0;</mml:mi></mml:mrow></mml:mfrac><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x003C0;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mstyle><mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E12"><label>(12)</label><mml:math id="M19"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02265;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>r</italic><sub>1</sub> denotes a uniformly distributed random number in [0, 1], and <inline-formula><mml:math id="M20"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the feature at index <italic>j</italic> of <italic>i</italic> &#x02212; <italic>th</italic> whale.</p>
<p>In WOA, the whales update their position on the basis of optimal individual solutions (leader). Often, the algorithm may fall into the local optimum, resulting in a loss of population diversity. To avoid this problem, we have proposed a hybrid binary WOA, in which Differential Evolution (DE) is applied as a local search technique.</p>
<p>During each iteration of WOA, the so far best solution (leader) is computed. All other whales of the population update their position using the update rules (<xref ref-type="disp-formula" rid="E8">Equations 8</xref>, <xref ref-type="disp-formula" rid="E11">11</xref>, <xref ref-type="disp-formula" rid="E12">12</xref>). To perform local refinement of an optimum solution, the whole population of binary individuals is considered as an input to the DE algorithm which operates in the following steps.</p>
<sec>
<title>3.2.4.2.1 Mutation</title>
<p>Each individual (&#x0201C;target&#x0201D;) <inline-formula><mml:math id="M21"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> in the population is used to generate its corresponding mutation vector <inline-formula><mml:math id="M22"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> such that:</p>
<disp-formula id="E13"><label>(13)</label><mml:math id="M23"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02295;</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This mutation vector is then used to create a trial vector as follows:</p>
<disp-formula id="E14"><label>(14)</label><mml:math id="M24"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02295;</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M25"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>, and <inline-formula><mml:math id="M26"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> are three randomly selected distinct vectors excluding <inline-formula><mml:math id="M27"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>, and &#x02295; denotes the bit-wise XOR operation.</p>
</sec>
<sec>
<title>3.2.4.2.2 Binomial crossover</title>
<p>The target vector <inline-formula><mml:math id="M28"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> and trial vector <inline-formula><mml:math id="M29"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> undergo the Binomial Crossover as follows:</p>
<disp-formula id="E15"><label>(15)</label><mml:math id="M30"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd><mml:mtd><mml:mtext class="textrm" mathvariant="normal">if&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>j</mml:mi><mml:mtext class="textrm" mathvariant="normal">&#x000A0;or&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02264;</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mtd><mml:mtd><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>j</italic> &#x0003D; 1:<italic>d</italic>, <italic>d</italic> is the dimensionality of the <italic>i</italic>-th individual, <italic>x</italic><sub>1</sub> is a random number in interval [1, <italic>d</italic>], <italic>x</italic><sub>2</sub> is a random number in interval [0, 1], and <italic>p</italic><sub><italic>r</italic></sub> is the crossover probability.</p>
<p>Finally, the fitness of each cross-over individual <inline-formula><mml:math id="M31"><mml:mover accent="true"><mml:mrow><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> is computed. If there is an individual with fitness value better than the iteration best solution <inline-formula><mml:math id="M32"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> of binary WOA, <inline-formula><mml:math id="M33"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> is replaced by this individual.</p>
</sec>
<sec>
<title>3.2.4.2.3 Feature selection using proposed hybrid binary WOA</title>
<p><xref ref-type="table" rid="T14">Algorithm 1</xref> shows the main computational steps of the proposed hybrid binary whale optimization (BWO)-based feature selection approach. <xref ref-type="table" rid="T4">Table 4</xref> lists the main symbols and variables used in the algorithm. The algorithm receives the fused feature matrix &#x1D53D; of size <italic>n</italic><sub><italic>t</italic></sub> &#x000D7; <italic>d</italic><sub><italic>max</italic></sub>, where <italic>n</italic><sub><italic>t</italic></sub> denotes the total number of images in the training set used for feature extraction, and <italic>d</italic><sub><italic>max</italic></sub> is the total number of fused features, i.e., 3, 072 per image. Each row of &#x1D53D; corresponds to fused feature vector obtained from a single image. <italic>L</italic> is a vector containing class labels of training dataset images, <italic>t</italic><sub><italic>max</italic></sub> is the maximum number of algorithm iterations, and <italic>n</italic><sub><italic>p</italic></sub> is the population size. In Step 4 of the algorithm, the whale population matrix <inline-formula><mml:math id="M55"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> of size <italic>n</italic><sub><italic>p</italic></sub> &#x000D7; <italic>d</italic><sub><italic>max</italic></sub> is randomly generated. The algorithm runs for <italic>t</italic><sub><italic>max</italic></sub> iterations. During each iteration, Steps 7&#x02013;12 compute the fitness of each individual to update the best (leader whale) solution <inline-formula><mml:math id="M56"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> and its fitness value &#x00393;<sup>&#x0002A;</sup>. The fitness function <italic>Evaluate</italic> receives as input parameters the population matrix <inline-formula><mml:math id="M57"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>, the label vector <italic>L</italic>, and one binary individual <inline-formula><mml:math id="M58"><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> of <inline-formula><mml:math id="M59"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>. In Step 35, all features corresponding to non-zero entries of <inline-formula><mml:math id="M60"><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> are extracted from &#x1D53D; and stored in &#x1D53D;<sub>2</sub>. In the subsequent Steps 36&#x02013;38, the feature matrix &#x1D53D;<sub>2</sub> and label vector <italic>V</italic> are split into training and testing parts with holdout ratio of <italic>h</italic><sub>0</sub>. Then, training of KNN classifier is performed, and predicted labels are obtained by applying testing feature set. The classification accuracy <italic>a</italic><sub><italic>c</italic></sub> and fitness &#x00393; are computed as <xref ref-type="disp-formula" rid="E16">Equations 16</xref>, <xref ref-type="disp-formula" rid="E17">17</xref>:</p>
<disp-formula id="E16"><label>(16)</label><mml:math id="M68"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:mn>100</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>%</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E17"><label>(17)</label><mml:math id="M69"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mo>&#x00393;</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>n</italic><sub><italic>pred</italic></sub> and <italic>n</italic><sub><italic>test</italic></sub>, respectively, denote the total number of successfully predicted and applied testing samples of KNN classifier. &#x003B1;<sub>1</sub> and &#x003B1;<sub>2</sub> are weight coefficients such that &#x003B1;<sub>1</sub>&#x0002B;&#x003B1;<sub>2</sub> &#x0003D; 1. <italic>q</italic><sub><italic>s</italic></sub> and <italic>q</italic><sub><italic>t</italic></sub> denote the number of selected and total features of <inline-formula><mml:math id="M70"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>.</p>
<table-wrap position="float" id="T14">
<label>Algorithm 1</label>
<caption><p>Proposed hybrid BWO based feature selection algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-i0001.tif"/>
</table-wrap>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Description of main symbols used in <xref ref-type="table" rid="T14">Algorithm 1</xref>.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Symbol</bold></th>
<th valign="top" align="left"><bold>Description</bold></th>
<th valign="top" align="left"><bold>Symbol</bold></th>
<th valign="top" align="left"><bold>Description</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">&#x1D53D;</td>
<td valign="top" align="left">Fused feature matrix</td>
<td valign="top" align="left">L</td>
<td valign="top" align="left">Label vector of training set</td>
</tr> <tr>
<td valign="top" align="left"><italic>d</italic><sub><italic>max</italic></sub></td>
<td valign="top" align="left">Total no. of fused features per image</td>
<td valign="top" align="left"><italic>t</italic><sub><italic>max</italic></sub></td>
<td valign="top" align="left">maximum no. of hybrid BWO algorithm</td>
</tr> <tr>
<td valign="top" align="left"><italic>n</italic><sub><italic>p</italic></sub></td>
<td valign="top" align="left">Population size</td>
<td valign="top" align="left"><inline-formula><mml:math id="M61"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula></td>
<td valign="top" align="left">Whale population matrix</td>
</tr> <tr>
<td valign="top" align="left"><inline-formula><mml:math id="M62"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula></td>
<td valign="top" align="left">Iteration best individual</td>
<td valign="top" align="left">&#x00393;<sup>&#x0002A;</sup></td>
<td valign="top" align="left">Iteration best fitness</td>
</tr> <tr>
<td valign="top" align="left"><inline-formula><mml:math id="M63"><mml:mover accent="true"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula></td>
<td valign="top" align="left">One binary individual of population matrix <inline-formula><mml:math id="M64"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula></td>
<td valign="top" align="left">&#x1D53D;<sub>2</sub></td>
<td valign="top" align="left">Features extracted from &#x1D53D;</td>
</tr> <tr>
<td valign="top" align="left"><italic>h</italic><sub>0</sub></td>
<td valign="top" align="left">split ratio of training and texting parts of &#x1D53D; for KNN</td>
<td valign="top" align="left">K</td>
<td valign="top" align="left">size of neighbors for KNN</td>
</tr> <tr>
<td valign="top" align="left"><italic>a</italic><sub><italic>c</italic></sub></td>
<td valign="top" align="left">classification accuracy</td>
<td valign="top" align="left">&#x00393;</td>
<td valign="top" align="left">fitness value (error rate)</td>
</tr> <tr>
<td valign="top" align="left"><italic>n</italic><sub><italic>pred</italic></sub></td>
<td valign="top" align="left">No. of successfully predicted labels</td>
<td valign="top" align="left"><italic>n</italic><sub><italic>test</italic></sub></td>
<td valign="top" align="left">total no. of test labels</td>
</tr> <tr>
<td valign="top" align="left"><italic>p</italic><sub><italic>r</italic></sub></td>
<td valign="top" align="left">Binomial crossover probability differential evolution</td>
<td valign="top" align="left"><inline-formula><mml:math id="M65"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="left">Mutation vector</td>
</tr> <tr>
<td valign="top" align="left"><inline-formula><mml:math id="M66"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="left">Trial vector</td>
<td valign="top" align="left"><inline-formula><mml:math id="M67"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="left">Binomial crossover vector</td>
</tr></tbody>
</table>
</table-wrap>
<p>In Steps 15&#x02013;18 of the main routine, the fittest solution (leader whale) is used to update the position of all other whales of population <inline-formula><mml:math id="M71"><mml:mover accent="true"><mml:mrow><mml:mi>&#x1D54F;</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> using the update rules (<xref ref-type="disp-formula" rid="E1">Equations 1</xref>&#x02013;<xref ref-type="disp-formula" rid="E10">10</xref>). The updated whales population is given as an input to <italic>Refine</italic>_<italic>DE</italic> which performs refinement of best solution using differential evolution. If a better solution is obtained by performing mutation and crossover rules (<xref ref-type="disp-formula" rid="E13">Equations 13</xref>&#x02013;<xref ref-type="disp-formula" rid="E15">15</xref>) of DE, this solution is selected as the iteration best of BWO algorithm. At the conclusion of <italic>t</italic><sub><italic>max</italic></sub> iterations of the BWO algorithm, Step 27 involves utilizing the indices of non-zero entries in the best overall solution <inline-formula><mml:math id="M72"><mml:mover accent="true"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>, to choose the corresponding features from the set &#x1D53D;.</p>
</sec>
</sec>
</sec>
<sec>
<title>3.2.5 Classification</title>
<p>The ensemble of selected features yielded by the proposed hybrid BWO algorithm, in conjunction with the label vector <italic>L</italic>, is subsequently employed for training the outer classifiers. In this study, we conducted an assessment of the classification efficacy across a spectrum of classifiers employing diverse kernel configurations, ultimately identifying and adopting the top-performing classifiers for our proposed study.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<title>4 Performance results</title>
<p>The prescribed workflow for the detection and sub-type categorization of acute lymphoblastic leukemia has been executed using MATLAB R2021a, running on an Intel Core i7 CPU equipped with 16GB of RAM, all hosted within a 64-bit Windows 10 operating environment.</p>
<sec>
<title>4.1 Leukemia binary detection</title>
<p>In the first phase, the leukemia detection pipeline is applied to the ALL-IDB2 dataset. To mitigate potential overfitting issues, the pre-processed images within the dataset undergo an augmentation procedure. This step involves random image rotations within the range of [0, 360] degrees, resizing by a random factor within [0.5, 1] interval. The distribution of images across various classes of augmented ALL-IDB2 dataset is presented in <xref ref-type="table" rid="T5">Table 5</xref>. Next, the augmented dataset was stratified into training and validation sets with a 70:30 ratio through a random selection of images belonging to each class. The corresponding image distribution is shown in <xref ref-type="table" rid="T6">Table 6</xref>.</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Class-wise image details of augmented ALL-IDB2 dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" rowspan="2"><bold>Class type</bold></th>
<th valign="top" align="center" colspan="2"><bold>No. of images</bold></th>
</tr>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="center"><bold>Original dataset</bold></th>
<th valign="top" align="center"><bold>Augmented dataset</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Healthy subject</td>
<td valign="top" align="center">130</td>
<td valign="top" align="center">600</td>
</tr> <tr>
<td valign="top" align="left">ALL affected subject</td>
<td valign="top" align="center">130</td>
<td valign="top" align="center">590</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Distribution of ALL-IDB2 dataset into training and test parts.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Class</bold></th>
<th valign="top" align="center"><bold>Training dataset</bold></th>
<th valign="top" align="center"><bold>Testing dataset</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Healthy subject</td>
<td valign="top" align="center">420</td>
<td valign="top" align="center">180</td>
</tr> <tr>
<td valign="top" align="left">ALL affected subject</td>
<td valign="top" align="center">413</td>
<td valign="top" align="center">177</td>
</tr> <tr>
<td valign="top" align="left">Total No. of images</td>
<td valign="top" align="center">833</td>
<td valign="top" align="center">357</td>
</tr></tbody>
</table>
</table-wrap>
<p>To perform feature extraction, the training dataset is employed for transfer learning with both the GoogleNet model and our proposed custom CNN architecture. The main training parameters are shown in <xref ref-type="table" rid="T7">Table 7</xref>. We explored various combinations of hyperparameters through multiple training runs and identified the set that achieved the best training performance. These optimal parameters were then used to train the custom CNN on the augmented ALL-IDB2 dataset. <xref ref-type="fig" rid="F5">Figure 5</xref> shows the validation accuracy and loss function plot of proposed custom CNN on the augmented ALL-IDB2 dataset. Subsequently, deep feature vectors of dimensions 1, 024 and 2, 048 are, respectively, extracted from GoogleNet and custom CNN. These feature vectors are then horizontally concatenated, yielding a composite feature vector of size 1 &#x000D7; 3, 072 for each training image. In the next step, the proposed hybrid BWO algorithm is applied on fused feature vector for the selection of most dominant set of features. The vector of selected features is then used for training outer classifiers. In this study, we have used a range of classifier families, such as SVM, KNN, NN, Decision Tree (DT), and Ensemble, with different kernel settings. The performance results of best performing classifiers from each family are shown in <xref ref-type="table" rid="T8">Table 8</xref>. The key performance metrics are evaluated, which include classification Accuracy, Precision, Sensitivity (Recall), F1 Score, and Specificity. For binary classification, these metrics are computed as <xref ref-type="disp-formula" rid="E18">Equations 18</xref>&#x02013;<xref ref-type="disp-formula" rid="E22">22</xref>:</p>
<disp-formula id="E18"><label>(18)</label><mml:math id="M73"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Accuracy</mml:mtext><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>&#x0002B;</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E19"><label>(19)</label><mml:math id="M74"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Sensitivity (Recall)</mml:mtext><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>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E20"><label>(20)</label><mml:math id="M75"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Specificity</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E21"><label>(21)</label><mml:math id="M76"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">F1 Score</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Recall</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Recall</mml:mtext></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E22"><label>(22)</label><mml:math id="M77"><mml:mtable class="eqnarray" columnalign="center"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><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>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>TP</italic> denotes the total number of &#x0201C;ALL&#x0201D; images successfully classified, <italic>TN</italic> denotes the total number of &#x0201C;Healthy&#x0201D; images classified as &#x0201C;Healthy,&#x0201D; <italic>FP</italic> denotes the number of &#x02018;Healthy&#x00027; images incorrectly classified as &#x0201C;ALL,&#x0201D; and <italic>FN</italic> denotes the number of &#x0201C;ALL&#x0201D; images incorrectly classified as &#x0201C;Healthy.&#x0201D;</p>
<table-wrap position="float" id="T7">
<label>Table 7</label>
<caption><p>Main parameters for transfer learning of GoogleNet and proposed custom CNN model.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Parameter</bold></th>
<th valign="top" align="center"><bold>Value</bold></th>
<th valign="top" align="left"><bold>Parameter</bold></th>
<th valign="top" align="center"><bold>Value</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Kernel type</td>
<td valign="top" align="center">sdgm</td>
<td valign="top" align="left">Max epochs</td>
<td valign="top" align="center">10</td>
</tr> <tr>
<td valign="top" align="left">Initial learning rate</td>
<td valign="top" align="center">1 &#x000D7; 10<sup>&#x02212;4</sup></td>
<td valign="top" align="left">Environment</td>
<td valign="top" align="center">Auto</td>
</tr> <tr>
<td valign="top" align="left">Validation frequency</td>
<td valign="top" align="center">30</td>
<td valign="top" align="left">Stride size</td>
<td valign="top" align="center">1</td>
</tr> <tr>
<td valign="top" align="left">Mini batch size</td>
<td valign="top" align="center">20</td>
<td valign="top" align="left">Dropout rate</td>
<td valign="top" align="center">0.1</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Plots of training accuracy and loss function for transfer learning of proposed custom CNN model on augmented ALL-IDB2 dataset.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0005.tif"/>
</fig>
<table-wrap position="float" id="T8">
<label>Table 8</label>
<caption><p>Performance metrics of leukemia binary detection on ALL-IDB2 dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="left"><bold>Kernel</bold></th>
<th valign="top" align="center"><bold><italic>N</italic><sub><italic>t</italic></sub></bold></th>
<th valign="top" align="center"><bold><italic>N</italic><sub><italic>s</italic></sub></bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Sensitivity</bold></th>
<th valign="top" align="center"><bold>F1 Score</bold></th>
<th valign="top" align="center"><bold>Specificity</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="3">KNN</td>
<td valign="top" align="left">Cosine</td>
<td valign="top" align="center" rowspan="11">3,072</td>
<td valign="top" align="center" rowspan="11">460</td>
<td valign="top" align="center">93.2773</td>
<td valign="top" align="center">0.9000</td>
<td valign="top" align="center">0.9643</td>
<td valign="top" align="center">0.9048</td>
<td valign="top" align="center">0.9310</td>
</tr>
 <tr>
<td valign="top" align="left">Coarse</td>
<td valign="top" align="center">94.6218</td>
<td valign="top" align="center">0.9000</td>
<td valign="top" align="center">0.9926</td>
<td valign="top" align="center">0.9071</td>
<td valign="top" align="center">0.9441</td>
</tr>
 <tr>
<td valign="top" align="left">Cubic</td>
<td valign="top" align="center">94.1176</td>
<td valign="top" align="center">0.9167</td>
<td valign="top" align="center">0.9649</td>
<td valign="top" align="center">0.9194</td>
<td valign="top" align="center">0.9402</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="3">SVM</td>
<td valign="top" align="left">Gaussian</td>
<td valign="top" align="center">92.8571</td>
<td valign="top" align="center">0.9000</td>
<td valign="top" align="center">0.9558</td>
<td valign="top" align="center">0.9040</td>
<td valign="top" align="center">0.9270</td>
</tr>
 <tr>
<td valign="top" align="left">Regression</td>
<td valign="top" align="center">94.1176</td>
<td valign="top" align="center">0.9250</td>
<td valign="top" align="center">0.9569</td>
<td valign="top" align="center">0.9262</td>
<td valign="top" align="center">0.9407</td>
</tr>
 <tr>
<td valign="top" align="left">Quadratic</td>
<td valign="top" align="center">94.7899</td>
<td valign="top" align="center">0.9333</td>
<td valign="top" align="center">0.9622</td>
<td valign="top" align="center">0.9342</td>
<td valign="top" align="center">0.9475</td>
</tr>
 <tr>
<td valign="top" align="left">Decision Tree</td>
<td valign="top" align="left">Medium</td>
<td valign="top" align="center">89.0756</td>
<td valign="top" align="center">0.8500</td>
<td valign="top" align="center">0.9273</td>
<td valign="top" align="center">0.8594</td>
<td valign="top" align="center">0.8870</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="2">NN</td>
<td valign="top" align="left">Narrow</td>
<td valign="top" align="center">91.5966</td>
<td valign="top" align="center">0.8667</td>
<td valign="top" align="center">0.9630</td>
<td valign="top" align="center">0.8769</td>
<td valign="top" align="center">0.9123</td>
</tr>
 <tr>
<td valign="top" align="left">Wide</td>
<td valign="top" align="center">94.2017</td>
<td valign="top" align="center">0.8917</td>
<td valign="top" align="center">0.9926</td>
<td valign="top" align="center">0.9002</td>
<td valign="top" align="center">0.9394</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="2">Ensemble</td>
<td valign="top" align="left">Rusboost</td>
<td valign="top" align="center">98.4034</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9840</td>
</tr>
 <tr>
<td valign="top" align="left">Subspace KNN</td>
<td valign="top" align="center">99.1597</td>
<td valign="top" align="center">0.9944</td>
<td valign="top" align="center">0.9888</td>
<td valign="top" align="center">0.9944</td>
<td valign="top" align="center">0.9915</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p><italic>N</italic><sub><italic>t</italic></sub>: total no. of features in fused feature set, <italic>N</italic><sub><italic>s</italic></sub>: no. of features selected by hybrid BWO algorithm.</p>
</table-wrap-foot>
</table-wrap>
<p>The above performance metrics reported in <xref ref-type="table" rid="T8">Table 8</xref> are the average results obtained after several Monte-Carlo iterations of proposed pipeline with 10-fold cross validation. In <xref ref-type="fig" rid="F6">Figure 6</xref>, the individual results of each classifier are graphically presented for comparison. Out of 3, 072 features extracted from transfer learning of GoogleNet and proposed custom CNN, only 460 features are selected by Hybrid BWO algorithm. With an 85% feature reduction, all selected classifiers demonstrate accuracy above 89%. The Ensemble Subspace KNN classifier demonstrates an average accuracy of 99.2% and better or comparable values of key performance parameters in comparison with other classifier settings.</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Graphical representation of performance results of proposed pipeline for leukemia detection using ALL-IDB2 dataset.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0006.tif"/>
</fig>
<p>The test confusion matrix of Ensemble Subspace KNN classifier on ALL-IDB2 dataset is shown in <xref ref-type="fig" rid="F7">Figure 7</xref>, which indicates a high true positive rate (TPR) and a very low false negative rate (FNR), confirming the accuracy of our method. Furthermore, in <xref ref-type="fig" rid="F8">Figure 8</xref>, the error rate of feature selector using proposed hybrid BWO algorithm is plotted with classical Genetic Algorithm (GA). The error rate &#x00393; is computed using the <xref ref-type="disp-formula" rid="E17">Equation 17</xref>. Both GA and BWO are population-based search algorithms, the hybrid BWO demonstrates a better exploration of search space by achieving significantly smaller error rate for all iterations.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Testing confusion matrix of ensemble subspace KNN classifier on ALL-IDB2 dataset.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0007.tif"/>
</fig>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Convergence plot of proposed hybrid binary whale optimization and genetic algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0008.tif"/>
</fig>
<p><xref ref-type="fig" rid="F9">Figure 9</xref> demonstrates a performance comparison of standard BWO and proposed hybrid BWO algorithms. The graphs in the figure are generated by performing several Monte Carlo iterations of both algorithms on the same training and testing portions of ALL-IDB2 dataset and other common parameters. Each curve in the graph is obtained for one Monte Carlo iteration of the corresponding algorithm and plots the error rate as a function of <italic>t</italic> iterations (generations) of the algorithm. Each algorithm runs for <italic>t</italic><sub><italic>max</italic></sub> &#x0003D; 50 times per Monte Carlo iteration. The graphs clearly reveal a better convergence performance of proposed hybrid BWO algorithm with DE-based local search method. For example, for <italic>t</italic> &#x0003D; 50, the best error rate achieved by standard BWO is 1.5 &#x000D7; 10<sup>&#x02212;3</sup>, whereas, for the same value of <italic>t</italic>, proposed hybrid BWO achieves an error rate of 1.0 &#x000D7; 10<sup>&#x02212;3</sup>, which is &#x0007E;30% smaller as compared with the standard BWO algorithm. This shows the superiority of proposed local search-based solution refinement strategy. In <xref ref-type="fig" rid="F10">Figure 10</xref>, the convergence performance of two algorithms is plotted for multi-class dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>). The graphs again reveal a faster convergence rate of proposed hybrid BWO algorithm as compared with its standard version.</p>
<fig id="F9" position="float">
<label>Figure 9</label>
<caption><p>Convergence performance of standard and proposed hybrid BWO algorithm ON ALL-IDB2 dataset. <bold>(A)</bold> Standard BWO algorithm. <bold>(B)</bold> Proposed memetic BWO algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0009.tif"/>
</fig>
<fig id="F10" position="float">
<label>Figure 10</label>
<caption><p>Convergence performance of standard and proposed hybrid BWO algorithm on multi-class dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>). <bold>(A)</bold> Standard BWO algorithm. <bold>(B)</bold> Proposed memetic BWO algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0010.tif"/>
</fig>
</sec>
<sec>
<title>4.2 Leukemia sub type identification</title>
<p>In the subsequent stage, the proposed pipeline is employed for the purpose of leukemia sub type classification, utilizing the dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>). Dataset diversity is augmented through randomized rotation and scaling of images along with the application of color jitter. The image distribution of augmented dataset is shown in <xref ref-type="table" rid="T9">Table 9</xref>. In <xref ref-type="table" rid="T10">Table 10</xref>, the class distribution of images is demonstrated after performing random splitting of augmented dataset into training and validation parts with a 70:30 ratio. Using the similar approach of binary classification, the training dataset is used for transfer learning of GoogleNet and proposed custom CNN. The features are extracted from both networks and concatenated together to obtain a fused feature vector. The set of selected features is then obtained using proposed hybrid BWO algorithm and subsequently used for training of outer classifiers. <xref ref-type="table" rid="T11">Table 11</xref> shows the ALL multi-class identification performance of selected classifiers. The average results are computed from several Monte-Carlo iterations of proposed pipeline. During each iteration, the overall value of all performance metrics of <xref ref-type="table" rid="T11">Table 11</xref> is computed by micro-averaging of their individual class-wise values. A comparison of individual metrics of all classifiers is presented in <xref ref-type="fig" rid="F11">Figure 11</xref>. Again, a better performance is demonstrated by the Ensemble Subspace KNN, which obtains an overall average accuracy of 98.6981% with relatively good values of other performance metrics. The confusion matrix of Ensemble Subspace KNN is shown in <xref ref-type="fig" rid="F12">Figure 12</xref>.</p>
<table-wrap position="float" id="T9">
<label>Table 9</label>
<caption><p>Distribution of augmented dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" rowspan="2"><bold>Class</bold></th>
<th valign="top" align="center" colspan="2"><bold>Frequency</bold></th>
</tr>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="center"><bold>Before</bold></th>
<th valign="top" align="center"><bold>After</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Benign</td>
<td valign="top" align="center">512</td>
<td valign="top" align="center">1,024</td>
</tr> <tr>
<td valign="top" align="left">Pre-cursor</td>
<td valign="top" align="center">955</td>
<td valign="top" align="center">1,000</td>
</tr> <tr>
<td valign="top" align="left">Pro-cell</td>
<td valign="top" align="center">796</td>
<td valign="top" align="center">1,050</td>
</tr> <tr>
<td valign="top" align="left">Early-pre-B</td>
<td valign="top" align="center">979</td>
<td valign="top" align="center">1,020</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T10">
<label>Table 10</label>
<caption><p>Class distribution of training and testing parts of dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>) for leukemia sub type classification.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Class</bold></th>
<th valign="top" align="center"><bold>Training images</bold></th>
<th valign="top" align="center"><bold>Testing images</bold></th>
<th valign="top" align="center"><bold>Total</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Benign</td>
<td valign="top" align="center">716</td>
<td valign="top" align="center">308</td>
<td valign="top" align="center">1,024</td>
</tr> <tr>
<td valign="top" align="left">Pre-cursor</td>
<td valign="top" align="center">700</td>
<td valign="top" align="center">300</td>
<td valign="top" align="center">1,000</td>
</tr> <tr>
<td valign="top" align="left">Pro-cell</td>
<td valign="top" align="center">735</td>
<td valign="top" align="center">315</td>
<td valign="top" align="center">1,050</td>
</tr> <tr>
<td valign="top" align="left">Early pre-B</td>
<td valign="top" align="center">714</td>
<td valign="top" align="center">306</td>
<td valign="top" align="center">1,020</td>
</tr> <tr>
<td valign="top" align="left">Total</td>
<td valign="top" align="center">2,149</td>
<td valign="top" align="center">1,229</td>
<td valign="top" align="center">4,094</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T11">
<label>Table 11</label>
<caption><p>Performance metrics of leukemia sub type classification using dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Kernel</bold></th>
<th valign="top" align="center"><bold><italic>N</italic><sub><italic>t</italic></sub></bold></th>
<th valign="top" align="center"><bold><italic>N</italic><sub><italic>s</italic></sub></bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Sensitivity</bold></th>
<th valign="top" align="center"><bold>F1 Score</bold></th>
<th valign="top" align="center"><bold>Specificity</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="3">KNN</td>
<td valign="top" align="left">Cosine</td>
<td valign="top" align="center" rowspan="11">3,072</td>
<td valign="top" align="center" rowspan="11">460</td>
<td valign="top" align="center">95.5701</td>
<td valign="top" align="center">0.9558</td>
<td valign="top" align="center">0.9560</td>
<td valign="top" align="center">0.9557</td>
<td valign="top" align="center">0.9853</td>
</tr>
 <tr>
<td valign="top" align="left">Coarse</td>
<td valign="top" align="center">96.0623</td>
<td valign="top" align="center">0.9608</td>
<td valign="top" align="center">0.9610</td>
<td valign="top" align="center">0.9606</td>
<td valign="top" align="center">0.9869</td>
</tr>
 <tr>
<td valign="top" align="left">Cubic</td>
<td valign="top" align="center">94.4217</td>
<td valign="top" align="center">0.9451</td>
<td valign="top" align="center">0.9451</td>
<td valign="top" align="center">0.9442</td>
<td valign="top" align="center">0.9815</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="3">SVM</td>
<td valign="top" align="left">Gaussian</td>
<td valign="top" align="center">95.0779</td>
<td valign="top" align="center">0.9515</td>
<td valign="top" align="center">0.9515</td>
<td valign="top" align="center">0.9509</td>
<td valign="top" align="center">0.9836</td>
</tr>
 <tr>
<td valign="top" align="left">Regression</td>
<td valign="top" align="center">95.8503</td>
<td valign="top" align="center">0.9589</td>
<td valign="top" align="center">0.9589</td>
<td valign="top" align="center">0.9585</td>
<td valign="top" align="center">0.9862</td>
</tr>
 <tr>
<td valign="top" align="left">Quadratic</td>
<td valign="top" align="center">96.4199</td>
<td valign="top" align="center">0.9645</td>
<td valign="top" align="center">0.9646</td>
<td valign="top" align="center">0.9642</td>
<td valign="top" align="center">0.9881</td>
</tr>
 <tr>
<td valign="top" align="left">Decision tree</td>
<td valign="top" align="left">Medium</td>
<td valign="top" align="center">92.8397</td>
<td valign="top" align="center">0.9299</td>
<td valign="top" align="center">0.9284</td>
<td valign="top" align="center">0.9283</td>
<td valign="top" align="center">0.9761</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="2">NN</td>
<td valign="top" align="left">Narrow</td>
<td valign="top" align="center">94.1128</td>
<td valign="top" align="center">0.9419</td>
<td valign="top" align="center">0.9412</td>
<td valign="top" align="center">0.9409</td>
<td valign="top" align="center">0.9804</td>
</tr>
 <tr>
<td valign="top" align="left">Wide</td>
<td valign="top" align="center">95.0366</td>
<td valign="top" align="center">0.9510</td>
<td valign="top" align="center">0.9503</td>
<td valign="top" align="center">0.9501</td>
<td valign="top" align="center">0.9834</td>
</tr>
 <tr>
<td valign="top" align="left" rowspan="2">Ensemble</td>
<td valign="top" align="center">Rusboost</td>
<td valign="top" align="center">98.3673</td>
<td valign="top" align="center">0.9837</td>
<td valign="top" align="center">0.9839</td>
<td valign="top" align="center">0.9837</td>
<td valign="top" align="center">0.9946</td>
</tr>
 <tr>
<td valign="top" align="left">Subspace KNN</td>
<td valign="top" align="center">98.6981</td>
<td valign="top" align="center">0.9870</td>
<td valign="top" align="center">0.9872</td>
<td valign="top" align="center">0.9871</td>
<td valign="top" align="center">0.9957</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F11" position="float">
<label>Figure 11</label>
<caption><p>Performance results of selected classifiers for ALL sub type classification using dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0011.tif"/>
</fig>
<fig id="F12" position="float">
<label>Figure 12</label>
<caption><p>Testing confusion matrix of ensemble subspace KNN classifier on dataset of the study mentioned in the reference Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-07-1351942-g0012.tif"/>
</fig>
<p><xref ref-type="table" rid="T12">Table 12</xref> provides a comparison between the performance of our proposed approach and several existing studies focused on leukemia identification. To ensure a fair assessment, we specifically selected previously published studies that utilized either identical or highly similar datasets. Our proposed pipeline, designed for both binary leukemia detection and sub-type identification, demonstrates superior or at least comparable performance metrics compared with various other relevant investigations that employed smaller feature sets. These results affirm the effectiveness and practicality of our proposed methodology.</p>
<table-wrap position="float" id="T12">
<label>Table 12</label>
<caption><p>Comparison of classification accuracy of proposed leukemia identification pipeline with some existing relevant studies.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Work</bold></th>
<th valign="top" align="left"><bold>Methodology</bold></th>
<th valign="top" align="left"><bold>Data set</bold></th>
<th valign="top" align="left"><bold>Classification type</bold></th>
<th valign="top" align="left"><bold>Performance results</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Di Ruberto et al. (<xref ref-type="bibr" rid="B11">2020</xref>)</td>
<td valign="top" align="left">Classification: SVM, ANN<break/>Multi scale blop detection<break/><break/>Deep feature extraction: AlexNet<break/>Classification: SVM</td>
<td valign="top" align="left">ALL-IDB</td>
<td valign="top" align="left">Binary classification of ALL</td>
<td valign="top" align="left">Accuracy &#x0003D; 94.1%</td>
</tr>
<tr>
<td valign="top" align="left">Bodzas et al. (<xref ref-type="bibr" rid="B8">2020</xref>)</td>
<td valign="top" align="left">Preprocessing<break/>Segmentation: three phase filtering<break/>Morphological feature extraction</td>
<td valign="top" align="left">Self collected</td>
<td valign="top" align="left">Binary classification of ALL</td>
<td valign="top" align="left">Specificity &#x0003D; 93.5%</td>
</tr>
<tr>
<td valign="top" align="left">Hegde et al. (<xref ref-type="bibr" rid="B17">2020</xref>)</td>
<td valign="top" align="left">Active contours for nuclei detection<break/>Shape and texture features extraction<break/>Classification: NN, SVM</td>
<td valign="top" align="left">Self collected</td>
<td valign="top" align="left">Leukemia binary detection</td>
<td valign="top" align="left">Accuracy &#x0003D; 98.8%</td>
</tr>
<tr>
<td valign="top" align="left">Baig et al. (<xref ref-type="bibr" rid="B6">2022</xref>)</td>
<td valign="top" align="left">Preprocessing<break/>Feature extraction: hybrid CNN<break/>Classification: bagging ensemble</td>
<td valign="top" align="left">ALL-IDB<break/>MiMMSBI<break/>SN-AM</td>
<td valign="top" align="left">ALL binary classification<break/>AML binary classification<break/>Multiple myeloma binary classification</td>
<td valign="top" align="left">ALL Classification<break/>Accuracy &#x0003D; 97.04%</td>
</tr>
<tr>
<td valign="top" align="left">This work</td>
<td valign="top" align="left">Contrast stretching using DE<break/>Deep feature extraction: proposed custom CNN &#x00026; GoogleNet<break/>Feature selection: hybrid BWO algorithm</td>
<td valign="top" align="left">ALL-IDB2<break/>Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>)</td>
<td valign="top" align="left">ALL binary classification<break/>ALL sub-type classification</td>
<td valign="top" align="left">Accuracy &#x0003D; 99.15%<break/>Accuracy &#x0003D; 98.69%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>4.3 Statistical analysis</title>
<p>In this study, we applied the one-way analysis of variance (ANOVA) (Fotso Kamga et al., <xref ref-type="bibr" rid="B13">2018</xref>) method to verify the validity of classification results from statistical point of view. The statistical analysis was performed on classification accuracy as the key performance metric. For this purpose, a number of Monte Carlo iterations of the complete classification pipeline were performed with 10 fold-cross validation in each iteration. The accuracy values were collected for the above mentioned classifiers. The normality of accuracy data was validated using Shapiro&#x02013;Wilk test (Akram et al., <xref ref-type="bibr" rid="B3">2020</xref>). The homogeneity of variances of classifier accuracy values were verified using Bartlet&#x00027;s test (Ahmad et al., <xref ref-type="bibr" rid="B1">2023a</xref>). The significance level &#x003B1; &#x0003D; 0.05 was selected. The <italic>p</italic>-values of KNN, SVM, Decision Tree, NN, and Ensemble family of classifier were <italic>p</italic><sub>1</sub> &#x0003D; 0.723, <italic>p</italic><sub>2</sub> &#x0003D; 0.7021, <italic>p</italic><sub>3</sub> &#x0003D; 0.694, <italic>p</italic><sub>4</sub> &#x0003D; 0.660 and <italic>p</italic><sub>5</sub> &#x0003D; 0.651, respectively, along with chi-squared probability <italic>p</italic><sub><italic>ch</italic></sub> &#x0003D; 0.825. The obtained p-values were less than &#x003B1;, which confirmed that null hypotheses of Shapiro&#x02013;Wilk and Bartlet&#x00027;s test are true, i.e., accuracy values are normally distributed with homogeneous variances.</p>
<p><xref ref-type="table" rid="T13">Table 13</xref> shows the results of one-way ANOVA test performed on accuracy of selected classifiers. The key metrics include mean square error (MSE), degree of freedom (df), <italic>F</italic>-statistics, <italic>p</italic>-value, and sum of square deviation (SS).</p>
<table-wrap position="float" id="T13">
<label>Table 13</label>
<caption><p>ANOVA statistical results of proposed pipeline.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>V-source</bold></th>
<th valign="top" align="center"><bold>df</bold></th>
<th valign="top" align="center"><bold>SS</bold></th>
<th valign="top" align="center"><bold>MSE</bold></th>
<th valign="top" align="center"><bold><italic>F</italic>-statistics</bold></th>
<th valign="top" align="center"><bold><italic>p</italic>-value</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Between</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">6.815 &#x000D7; 10<sup>&#x02212;5</sup></td>
<td valign="top" align="center">2.7347 &#x000D7; 10<sup>&#x02212;5</sup></td>
<td valign="top" align="center">0.29</td>
<td valign="top" align="center">0.695</td>
</tr> <tr>
<td valign="top" align="left">Within</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">6.3245 &#x000D7; 10<sup>&#x02212;4</sup></td>
<td valign="top" align="center">8.7725 &#x000D7; 10<sup>&#x02212;5</sup></td>
<td valign="top" align="center">&#x02013;</td>
<td valign="top" align="center">&#x02013;</td>
</tr> <tr>
<td valign="top" align="left">Total</td>
<td valign="top" align="center">8</td>
<td valign="top" align="center">5.956 &#x000D7; 10<sup>&#x02212;4</sup></td>
<td valign="top" align="center">&#x02013;</td>
<td valign="top" align="center">&#x02013;</td>
<td valign="top" align="center">&#x02013;</td>
</tr></tbody>
</table>
</table-wrap>
<p>The confidence interval plot of selected classifiers on the proposed leukemia identification pipeline is shown. The average accuracy is demonstrated as red line, whereas the 95% confidence limits are shown as black lines. The figure demonstrates that ensemble subspace achieves a high average accuracy with small confidence interval as compared with other classifiers. The upper and lower quantile points of each classifier lie within the confidence interval limits.</p>
</sec>
</sec>
<sec sec-type="discussion" id="s5">
<title>5 Discussion</title>
<p>In this study, we examined the effectiveness of our proposed approach for the binary and multi-class identification of ALL. Modern deep CNNs often come with large model sizes, demanding significant memory and computational resources. Employing an ensemble of networks, including a tailored CNN alongside publicly available deep CNN models, offers a practical compromise between classification performance and pipeline complexity. Furthermore, leveraging pretrained CNN models for feature extraction and employing external classifiers is a potent and pragmatic strategy that amalgamates the advantages of transfer learning, feature abstraction, and minimized training effort to enhance the outcomes of diverse computer vision tasks. One drawback of this approach is that the feature sets extracted from deep CNNs often exhibit substantial size and encompass a considerable amount of duplicate features. Selection of most promising set of features is a combinatorial optimization problem with computational complexity of exhaustive search growing exponential with the size of feature vector. Population-based feature selection methods have shown a significant research interest in recent years. A number of bio-inspired and nature-inspired meta-heuristics have been proposed. One challenge is the exploration and exploitation capabilities of the algorithm problem of local optima. To address this issue, we have proposed a memetic feature selection approach that combines elements of population-based algorithms with local search methods. In particular, we have proposed a nature-inspired metaheuristic name binary whale optimization algorithm in which optimization of an iteration best solution is performed using a differential evolution method. These optimizations at CNN architecture and feature selection level yield an improved pipeline which shows promising results for leukemia detection and sub-type classification. The validity of proposed approach is manifested with better performance results as compared with several recently published studies.</p>
</sec>
<sec sec-type="conclusions" id="s6">
<title>6 Conclusion</title>
<p>Leukemia, a hematologic malignancy, afflicts both pediatric and geriatric populations. Acute lymphoblastic leukemia is an aggressive form of leukemia that has a high mortality rate. Modern computer vision approaches and deep CNNs have been demonstrated as potential solutions for computer aided diagnosis of several medical conditions. However, precise classification of malignancies at microscopic level is a challenging task due to morphological similarities between different blood entities. This study presents an improved pipeline for enhancing leukemia detection from blood smear images. At first, We propose an intricately designed 88-layer deep CNN architecture inspired by AlexNet and SqueezeNet. We used this network as a feature extractor alongside GoogleNet, aiming to balance classification accuracy and computational efficiency. The work then models the feature selection problem as a combinatorial optimization problem and proposes a novel memetic approach based on the Hybrid binary whale optimization algorithm to meticulously select the most dominant set of features. Our proposed methodology undergoes rigorous validation using publicly available datasets containing peripheral blood smear images across diverse leukemia classes. The proposed feature selection approach effectively selects the most dominant and discriminant set of features. The proposed system achieves an overall accuracy rate of 99.15% with an 80% reduction in feature size, performing comparably or better than several existing studies on leukemia identification. The propose method can be extended to the diagnosis of other blood-related diseases. It can complement advanced diagnostic methods such as RNA sequencing and molecular testing by providing additional supporting evidence. Additionally, it offers smooth integration with practical image analysis systems such as image flow cytometry, expanding their functionalities in real-world settings.</p>
</sec>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: Scotti et al. (<xref ref-type="bibr" rid="B31">2005</xref>) and Ghaderzadeh et al. (<xref ref-type="bibr" rid="B14">2022</xref>).</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>MA: Conceptualization, Data curation, Investigation, Methodology, Software, Validation, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. RA: Methodology, Software, Validation, Writing &#x02013; original draft. NK: Supervision, Writing &#x02013; review &#x00026; editing. AA: Writing &#x02013; review &#x00026; editing. NA: Writing &#x02013; review &#x00026; editing. AM: Resources, Validation, Writing &#x02013; review &#x00026; editing.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This study was funded by the Researchers Supporting Project Number: RSP2024R157, King Saud University, Riyadh, Saudi Arabia.</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<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 sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;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>
<fn-group>
<title>Abbreviations</title>
<fn fn-type="abbr"><p>ALL, acute lymphoblastic leukemia; B-ALL, B cell acute lymphoblastic leukemia; AML, acute myeloid leukemia; ANOVA, analysis of variance; CNN, convolutional neural network; DNN, deep neural network; DE, differential evolution; DT, decision tree; RGB, red green blue; HSI, hue saturation intensity; SVMs, support vector machines; KNN, K-nearest neighbors; TP, true positive; FN, false negative; TPR, true positive rate; FNR, false negative rate; NN, neural network; WOA, whale optimization algorithm; WBC, white blood cell.</p></fn></fn-group>
<fn-group>
<fn id="fn0001"><p><sup>1</sup><ext-link ext-link-type="uri" xlink:href="http://www.image-net.org">http://www.image-net.org</ext-link></p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ahmad</surname> <given-names>R.</given-names></name> <name><surname>Awais</surname> <given-names>M.</given-names></name> <name><surname>Kausar</surname> <given-names>N.</given-names></name> <name><surname>Akram</surname> <given-names>T.</given-names></name></person-group> (<year>2023a</year>). <article-title>White blood cells classification using entropy-controlled deep features optimization</article-title>. <source>Diagnostics</source> <volume>13</volume>:<fpage>352</fpage>. <pub-id pub-id-type="doi">10.3390/diagnostics13030352</pub-id><pub-id pub-id-type="pmid">36766457</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ahmad</surname> <given-names>R.</given-names></name> <name><surname>Awais</surname> <given-names>M.</given-names></name> <name><surname>Kausar</surname> <given-names>N.</given-names></name> <name><surname>Tariq</surname> <given-names>U.</given-names></name> <name><surname>Cha</surname> <given-names>J.-H.</given-names></name> <name><surname>Balili</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2023b</year>). <article-title>Leukocytes classification for leukemia detection using quantum inspired deep feature selection</article-title>. <source>Cancers</source> <volume>15</volume>:<fpage>2507</fpage>. <pub-id pub-id-type="doi">10.3390/cancers15092507</pub-id><pub-id pub-id-type="pmid">37173974</pub-id></citation></ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Akram</surname> <given-names>T.</given-names></name> <name><surname>Naqvi</surname> <given-names>S. R.</given-names></name> <name><surname>Haider</surname> <given-names>S. A.</given-names></name> <name><surname>Kamran</surname> <given-names>M.</given-names></name> <name><surname>Qamar</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>A novel framework for approximation of magneto-resistance curves of a superconducting film using gmdh-type neural networks</article-title>. <source>Superlattices Microstruct</source>. <volume>145</volume>:<fpage>106635</fpage>. <pub-id pub-id-type="doi">10.1016/j.spmi.2020.106635</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Al-jaboriy</surname> <given-names>S. S.</given-names></name> <name><surname>Sjarif</surname> <given-names>N. N. A.</given-names></name> <name><surname>Chuprat</surname> <given-names>S.</given-names></name> <name><surname>Abduallah</surname> <given-names>W. M.</given-names></name></person-group> (<year>2019</year>). <article-title>Acute lymphoblastic leukemia segmentation using local pixel information</article-title>. <source>Pattern Recognit. Lett</source>. <volume>125</volume>, <fpage>85</fpage>&#x02013;<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1016/j.patrec.2019.03.024</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alruwaili</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>An intelligent medical imaging approach for various blood structure classifications</article-title>. <source>Complexity</source> <volume>2021</volume>:<fpage>5573300</fpage>. <pub-id pub-id-type="doi">10.1155/2021/5573300</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baig</surname> <given-names>R.</given-names></name> <name><surname>Rehman</surname> <given-names>A.</given-names></name> <name><surname>Almuhaimeed</surname> <given-names>A.</given-names></name> <name><surname>Alzahrani</surname> <given-names>A.</given-names></name> <name><surname>Rauf</surname> <given-names>H. T.</given-names></name></person-group> (<year>2022</year>). <article-title>Detecting malignant leukemia cells using microscopic blood smear images: a deep learning approach</article-title>. <source>Appl. Sci</source>. <volume>12</volume>:<fpage>6317</fpage>. <pub-id pub-id-type="doi">10.3390/app12136317</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Batool</surname> <given-names>A.</given-names></name> <name><surname>Byun</surname> <given-names>Y.-C.</given-names></name></person-group> (<year>2023</year>). <article-title>Lightweight efficientnetb3 model based on depthwise separable convolutions for enhancing classification of leukemia white blood cell images</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>37203</fpage>&#x02013;<lpage>37215</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3266511</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bodzas</surname> <given-names>A.</given-names></name> <name><surname>Kodytek</surname> <given-names>P.</given-names></name> <name><surname>Zidek</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Automated detection of acute lymphoblastic leukemia from microscopic images based on human visual perception</article-title>. <source>Front. Bioeng. Biotechnol</source>. <volume>8</volume>:<fpage>1005</fpage>. <pub-id pub-id-type="doi">10.3389/fbioe.2020.01005</pub-id><pub-id pub-id-type="pmid">32984283</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chollet</surname> <given-names>F.</given-names></name></person-group> (<year>2017</year>). <article-title>Xception: deep learning with depthwise separable convolutions</article-title>, in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Honolulu, HI</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1251</fpage>&#x02013;<lpage>1258</lpage>. <pub-id pub-id-type="doi">10.1109/CVPR.2017.195</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dese</surname> <given-names>K.</given-names></name> <name><surname>Raj</surname> <given-names>H.</given-names></name> <name><surname>Ayana</surname> <given-names>G.</given-names></name> <name><surname>Yemane</surname> <given-names>T.</given-names></name> <name><surname>Adissu</surname> <given-names>W.</given-names></name> <name><surname>Krishnamoorthy</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Accurate machine-learning-based classification of leukemia from blood smear images</article-title>. <source>Clin. Lymphoma Myeloma Leuk</source>. <volume>21</volume>, <fpage>e903</fpage>&#x02013;<lpage>e914</lpage>. <pub-id pub-id-type="doi">10.1016/j.clml.2021.06.025</pub-id><pub-id pub-id-type="pmid">34493478</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di Ruberto</surname> <given-names>C.</given-names></name> <name><surname>Loddo</surname> <given-names>A.</given-names></name> <name><surname>Puglisi</surname> <given-names>G.</given-names></name></person-group> (<year>2020</year>). <article-title>Blob detection and deep learning for leukemic blood image analysis</article-title>. <source>Appl. Sci</source>. <volume>10</volume>:<fpage>1176</fpage>. <pub-id pub-id-type="doi">10.3390/app10031176</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Elhassan</surname> <given-names>T. A. M.</given-names></name> <name><surname>Rahim</surname> <given-names>M. S. M.</given-names></name> <name><surname>Swee</surname> <given-names>T. T.</given-names></name> <name><surname>Hashim</surname> <given-names>S. Z. M.</given-names></name> <name><surname>Aljurf</surname> <given-names>M.</given-names></name></person-group> (<year>2022</year>). <article-title>Feature extraction of white blood cells using cmyk-moment localization and deep learning in acute myeloid leukemia blood smear microscopic images</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>16577</fpage>&#x02013;<lpage>16591</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3149637</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fotso Kamga</surname> <given-names>G. A.</given-names></name> <name><surname>Akram</surname> <given-names>T.</given-names></name> <name><surname>Laurent</surname> <given-names>B.</given-names></name> <name><surname>Naqvi</surname> <given-names>S. R.</given-names></name> <name><surname>Alex</surname> <given-names>M. M.</given-names></name> <name><surname>Muhammad</surname> <given-names>N.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>A deep heterogeneous feature fusion approach for automatic land-use classification</article-title>. <source>Inf. Sci</source>. <volume>467</volume>, <fpage>199</fpage>&#x02013;<lpage>218</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2018.07.074</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ghaderzadeh</surname> <given-names>M.</given-names></name> <name><surname>Aria</surname> <given-names>M.</given-names></name> <name><surname>Hosseini</surname> <given-names>A.</given-names></name> <name><surname>Asadi</surname> <given-names>F.</given-names></name> <name><surname>Bashash</surname> <given-names>D.</given-names></name> <name><surname>Abolghasemi</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>A fast and efficient cnn model for b-all diagnosis and its subtypes classification using peripheral blood smear images</article-title>. <source>Int. J. Intell. Syst</source>. <volume>37</volume>, <fpage>5113</fpage>&#x02013;<lpage>5133</lpage>. <pub-id pub-id-type="doi">10.1002/int.22753</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Gupta</surname> <given-names>D.</given-names></name> <name><surname>Agrawal</surname> <given-names>U.</given-names></name> <name><surname>Arora</surname> <given-names>J.</given-names></name> <name><surname>Khanna</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>Bat-inspired algorithm for feature selection and white blood cell classification</article-title>, in <source>Nature-Inspired Computation and Swarm Intelligence</source>, ed. <person-group person-group-type="editor"><name><surname>Yang</surname> <given-names>X.-S.</given-names></name></person-group> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>Elsevier</publisher-name>), <fpage>179</fpage>&#x02013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1016/B978-0-12-819714-1.00022-1</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>He</surname> <given-names>K.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Ren</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>J.</given-names></name></person-group> (<year>2016</year>). <article-title>Deep residual learning for image recognition</article-title>, in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Las Vegas, NV</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>770</fpage>&#x02013;<lpage>778</lpage>. <pub-id pub-id-type="doi">10.1109/CVPR.2016.90</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hegde</surname> <given-names>R. B.</given-names></name> <name><surname>Prasad</surname> <given-names>K.</given-names></name> <name><surname>Hebbar</surname> <given-names>H.</given-names></name> <name><surname>Singh</surname> <given-names>B. M. K.</given-names></name> <name><surname>Sandhya</surname> <given-names>I.</given-names></name></person-group> (<year>2020</year>). <article-title>Automated decision support system for detection of leukemia from peripheral blood smear images</article-title>. <source>J. Digit. Imaging</source> <volume>33</volume>, <fpage>361</fpage>&#x02013;<lpage>374</lpage>. <pub-id pub-id-type="doi">10.1007/s10278-019-00288-y</pub-id><pub-id pub-id-type="pmid">31728805</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Howard</surname> <given-names>A. G.</given-names></name> <name><surname>Zhu</surname> <given-names>M.</given-names></name> <name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Kalenichenko</surname> <given-names>D.</given-names></name> <name><surname>Wang</surname> <given-names>W.</given-names></name> <name><surname>Weyand</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Mobilenets: efficient convolutional neural networks for mobile vision applications</article-title>. <source>arXiv</source> [Preprint]. arXiv:1704.04861. <pub-id pub-id-type="doi">10.48550/arXiv.1704.04861</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Jha</surname> <given-names>K. K.</given-names></name> <name><surname>Das</surname> <given-names>P.</given-names></name> <name><surname>Dutta</surname> <given-names>H. S.</given-names></name></person-group> (<year>2022</year>). <article-title>Artificial neural network-based leukaemia identification and prediction using ensemble deep learning model</article-title>, in <source>2022 International Conference on Communication, Computing and Internet of Things (IC3IoT)</source> (<publisher-loc>Chennai</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1109/IC3IOT53935.2022.9767874</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jung</surname> <given-names>C.</given-names></name> <name><surname>Abuhamad</surname> <given-names>M.</given-names></name> <name><surname>Mohaisen</surname> <given-names>D.</given-names></name> <name><surname>Han</surname> <given-names>K.</given-names></name> <name><surname>Nyang</surname> <given-names>D.</given-names></name></person-group> (<year>2022</year>). <article-title>Wbc image classification and generative models based on convolutional neural network</article-title>. <source>BMC Med. Imaging</source> <volume>22</volume>, <fpage>1</fpage>&#x02013;<lpage>16</lpage>. <pub-id pub-id-type="doi">10.1186/s12880-022-00818-1</pub-id><pub-id pub-id-type="pmid">35596153</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kassani</surname> <given-names>S. H.</given-names></name> <name><surname>Kassani</surname> <given-names>P. H.</given-names></name> <name><surname>Wesolowski</surname> <given-names>M. J.</given-names></name> <name><surname>Schneider</surname> <given-names>K. A.</given-names></name> <name><surname>Deters</surname> <given-names>R.</given-names></name></person-group> (<year>2019</year>). <article-title>A hybrid deep learning architecture for leukemic b-lymphoblast classification</article-title>, in <source>2019 International Conference on Information and Communication Technology Convergence (ICTC)</source> (<publisher-loc>Jeju</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>271</fpage>&#x02013;<lpage>276</lpage>. <pub-id pub-id-type="doi">10.1109/ICTC46691.2019.8939959</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khan</surname> <given-names>S.</given-names></name> <name><surname>Sajjad</surname> <given-names>M.</given-names></name> <name><surname>Hussain</surname> <given-names>T.</given-names></name> <name><surname>Ullah</surname> <given-names>A.</given-names></name> <name><surname>Imran</surname> <given-names>A. S.</given-names></name></person-group> (<year>2020</year>). <article-title>A review on traditional machine learning and deep learning models for wbcs classification in blood smear images</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>10657</fpage>&#x02013;<lpage>10673</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3048172</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khattak</surname> <given-names>M. I.</given-names></name> <name><surname>Saleem</surname> <given-names>N.</given-names></name> <name><surname>Gao</surname> <given-names>J.</given-names></name> <name><surname>Verdu</surname> <given-names>E.</given-names></name> <name><surname>Fuente</surname> <given-names>J. P.</given-names></name></person-group> (<year>2022</year>). <article-title>Regularized sparse features for noisy speech enhancement using deep neural networks</article-title>. <source>Comput. Electr. Eng</source>. <volume>100</volume>:<fpage>107887</fpage>. <pub-id pub-id-type="doi">10.1016/j.compeleceng.2022.107887</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Krizhevsky</surname> <given-names>A.</given-names></name> <name><surname>Hinton</surname> <given-names>G.</given-names></name> <etal/></person-group>. (<year>2009</year>). <source>Learning Multiple Layers of Features from Tiny Images</source>. <publisher-loc>Toronto, ON</publisher-loc>: <publisher-name>University of Toronto</publisher-name>.</citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>D.</given-names></name> <name><surname>Jain</surname> <given-names>N.</given-names></name> <name><surname>Khurana</surname> <given-names>A.</given-names></name> <name><surname>Mittal</surname> <given-names>S.</given-names></name> <name><surname>Satapathy</surname> <given-names>S. C.</given-names></name> <name><surname>Senkerik</surname> <given-names>R.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Automatic detection of white blood cancer from bone marrow microscopic images using convolutional neural networks</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>142521</fpage>&#x02013;<lpage>142531</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3012292</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Matek</surname> <given-names>C.</given-names></name> <name><surname>Schwarz</surname> <given-names>S.</given-names></name> <name><surname>Spiekermann</surname> <given-names>K.</given-names></name> <name><surname>Marr</surname> <given-names>C.</given-names></name></person-group> (<year>2019</year>). <article-title>Human-level recognition of blast cells in acute myeloid leukaemia with convolutional neural networks</article-title>. <source>Nat. Mach. Intell</source>. <volume>1</volume>, <fpage>538</fpage>&#x02013;<lpage>544</lpage>. <pub-id pub-id-type="doi">10.1038/s42256-019-0101-9</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mirjalili</surname> <given-names>S.</given-names></name> <name><surname>Lewis</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <article-title>The whale optimization algorithm</article-title>. <source>Adv. Eng. Softw</source>. <volume>95</volume>, <fpage>51</fpage>&#x02013;<lpage>67</lpage>. <pub-id pub-id-type="doi">10.1016/j.advengsoft.2016.01.008</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nithyaa</surname> <given-names>A. N.</given-names></name> <name><surname>Prem Kumar</surname> <given-names>R.</given-names></name> <name><surname>Gokul</surname> <given-names>M.</given-names></name> <name><surname>Geetha Anandhi</surname> <given-names>C.</given-names></name></person-group> (<year>2021</year>). <article-title>Matlab based potent algorithm for WBc cancer detection and classification</article-title>. <source>Biomed. Pharmacol. J</source>. <volume>14</volume>, <fpage>2277</fpage>&#x02013;<lpage>2284</lpage>. <pub-id pub-id-type="doi">10.13005/bpj/2328</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Pang</surname> <given-names>G.</given-names></name> <name><surname>Zhuang</surname> <given-names>Y.</given-names></name> <name><surname>Zhou</surname> <given-names>P.</given-names></name></person-group> (<year>2015</year>). <article-title>Automatic leukocytes classification by distance transform, moment invariant, morphological features, gray level co-occurrence matrices and SVM</article-title>, in <source>First International Conference on Information Sciences, Machinery, Materials and Energy</source> (<publisher-loc>Paris</publisher-loc>: <publisher-name>Atlantis Press</publisher-name>), <fpage>1089</fpage>&#x02013;<lpage>1094</lpage>. <pub-id pub-id-type="doi">10.2991/icismme-15.2015.231</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Redmon</surname> <given-names>J.</given-names></name> <name><surname>Farhadi</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Yolov3: an incremental improvement</article-title>. <source>arXiv</source> [Preprint] arXiv:1804.02767. <pub-id pub-id-type="doi">10.48550/arXiv.1804.02767</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Scotti</surname> <given-names>F.</given-names></name> <name><surname>Labati</surname> <given-names>R.</given-names></name> <name><surname>Piuri</surname> <given-names>V.</given-names></name></person-group> (<year>2005</year>). <source>Acute Lymphoblastic Leukemia Image Database for Image Processing</source>. <publisher-loc>Milan</publisher-loc>: <publisher-name>Department of Computer Science, University of Milan</publisher-name>.</citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shahzad</surname> <given-names>A.</given-names></name> <name><surname>Raza</surname> <given-names>M.</given-names></name> <name><surname>Shah</surname> <given-names>J. H.</given-names></name> <name><surname>Sharif</surname> <given-names>M.</given-names></name> <name><surname>Nayak</surname> <given-names>R. S.</given-names></name></person-group> (<year>2022</year>). <article-title>Categorizing white blood cells by utilizing deep features of proposed 4B-additionnet-based cnn network with ant colony optimization</article-title>. <source>Complex Intell. Syst</source>. <volume>8</volume>, <fpage>3145</fpage>&#x02013;<lpage>3159</lpage>. <pub-id pub-id-type="doi">10.1007/s40747-021-00564-x</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siegel</surname> <given-names>R. L.</given-names></name> <name><surname>Giaquinto</surname> <given-names>A. N.</given-names></name> <name><surname>Jemal</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Cancer statistics, 2024</article-title>. <source>CA: Cancer J. Clin</source>. <volume>74</volume>, <fpage>12</fpage>&#x02013;<lpage>49</lpage>. <pub-id pub-id-type="doi">10.3322/caac.21820</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sung</surname> <given-names>H.</given-names></name> <name><surname>Ferlay</surname> <given-names>J.</given-names></name> <name><surname>Siegel</surname> <given-names>R. L.</given-names></name> <name><surname>Laversanne</surname> <given-names>M.</given-names></name> <name><surname>Soerjomataram</surname> <given-names>I.</given-names></name> <name><surname>Jemal</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Global cancer statistics 2020: globocan estimates of incidence and mortality worldwide for 36 cancers in 185 countries</article-title>. <source>CA: Cancer J. Clin</source>. <volume>71</volume>, <fpage>209</fpage>&#x02013;<lpage>249</lpage>. <pub-id pub-id-type="doi">10.3322/caac.21660</pub-id><pub-id pub-id-type="pmid">33538338</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Szegedy</surname> <given-names>C.</given-names></name> <name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Jia</surname> <given-names>Y.</given-names></name> <name><surname>Sermanet</surname> <given-names>P.</given-names></name> <name><surname>Reed</surname> <given-names>S.</given-names></name> <name><surname>Anguelov</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2015</year>). <article-title>Going deeper with convolutions</article-title>, in <source>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source> (<publisher-loc>Boston, MA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1109/CVPR.2015.7298594</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xie</surname> <given-names>Y.</given-names></name> <name><surname>Ning</surname> <given-names>L.</given-names></name> <name><surname>Wang</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>C.</given-names></name></person-group> (<year>2019</year>). <article-title>Image enhancement based on histogram equalization</article-title>. <source>J. Physics Conf. Ser</source>. <volume>1314</volume>:<fpage>012161</fpage>. <pub-id pub-id-type="doi">10.1088/1742-6596/1314/1/012161</pub-id></citation>
</ref>
</ref-list>
</back>
</article>