<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">78892</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2026.078892</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Explainable Context-Aware Fusion Network for Non-Small Cell Lung Cancer Analysis with Application to Smart Healthcare Systems</article-title>
<alt-title alt-title-type="left-running-head">Explainable Context-Aware Fusion Network for Non-Small Cell Lung Cancer Analysis with Application to Smart Healthcare Systems</alt-title>
<alt-title alt-title-type="right-running-head">Explainable Context-Aware Fusion Network for Non-Small Cell Lung Cancer Analysis with Application to Smart Healthcare Systems</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Waqar</surname><given-names>Muhammad</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Khan</surname><given-names>Zeshan Aslam</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>zeshank@yuntech.edu.tw</email></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Chang</surname><given-names>Arthur</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>changart@yuntech.edu.tw</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Guo</surname><given-names>Zhishan</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Lai</surname><given-names>Chun-Liang</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Chang</surname><given-names>Chuan-Yu</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<aff id="aff-1"><label>1</label><institution>International Graduate School of Artificial Intelligence, National Yunlin University of Science and Technology</institution>, <addr-line>Yunlin</addr-line>, <country>Taiwan</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Management, National Yunlin University of Science and Technology</institution>, <addr-line>Yunlin</addr-line>, <country>Taiwan</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, North Carolina State University</institution>, <addr-line>Raleigh, NC</addr-line>, <country>USA</country></aff>
<aff id="aff-4"><label>4</label><institution>Division of Pulmonology and Critical Care, Department of Internal Medicine, Dalin Tzu Chi Hospital, Buddhist Tzu Chi Medical Foundation</institution>, <addr-line>No. 2, Minsheng Road, Dalin, Chiayi City</addr-line>, <country>Taiwan</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Computer Science and Information Engineering, National Yunlin University of Science and Technology</institution>, <addr-line>Yunlin</addr-line>, <country>Taiwan</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Zeshan Aslam Khan. Email: <email>zeshank@yuntech.edu.tw</email>; Arthur Chang. Email: <email>changart@yuntech.edu.tw</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2026</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>27</day><month>4</month><year>2026</year>
</pub-date>
<volume>147</volume>
<issue>1</issue>
<elocation-id>41</elocation-id>
<history>
<date date-type="received">
<day>09</day>
<month>01</month>
<year>2026</year>
</date>
<date date-type="accepted">
<day>23</day>
<month>03</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors. Published by Tech Science Press.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>The Authors</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_78892.pdf"></self-uri>
<abstract>
<p>Lung cancer (LC) is among the dangerous cancers spreading progressively, and a timely LC diagnosis becomes a dire need of the time. Various imaging-based studies have been conducted for accurate LC examination through computed tomography (CT), X-ray, and histopathology. Worldwide, the proportion of LC-affected patients in hospitals is growing, thereby increasing imaging data for fast processing and early examination. To facilitate histopathological imaging-based automated and timely decision making for accurate LC prediction, a Context Aware Fusion Network (CAFNet) for holistic feature learning and spatially localized feature learning is proposed in this study for the efficient extraction and processing of global as well as local features, respectively. CAFNet exploits histopathological tissues to ensure local and global attributes uniformity for extracting contextual information. The conducted research achieves histopathological image enhancement using median filtering (MF) and contrast-limited-adaptive-Histogram-Equalization (CLAHE). Moreover, the classifying power of the proposed CAFNet is enhanced through superior attributes extraction strategies, such as Mobile Inverted Bottleneck Convolution (MIBConv) employed with Spatial Attention with Residual Learning (SARL) and Channel Attention with Residual Learning (CARL). An innovative, partially adaptive optimization approach is utilized to fine-tune the degree of adaptivity in the learning process of the network. The descriptive behavior of CAFNet is explored through explainable artificial intelligence (XAI) strategies like Gradient-Weighted Class Activation Mapping (GradCAM) and Local Interpretable Model-Agnostic Explanation (LIME). The proposed network achieved an improved average classification accuracy of 7.36% while reducing models&#x2019; complexity by 85% to 99% as compared to the existing benchmark models. The study also addresses users&#x2019; accessibility challenges by providing a web-based interface using Gradio for users&#x2019; real-time interaction.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Lung cancer</kwd>
<kwd>histopathology</kwd>
<kwd>context-aware network</kwd>
<kwd>explainable AI</kwd>
<kwd>web-based Interface</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Science and Technology Council (NSTC), Taiwan</funding-source>
<award-id>114WFA2610132</award-id>
<award-id>114-2221-E-224-020</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Featured Areas Research Center-Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan</funding-source>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Globally, the proportion of patients with cancer types like Lung cancer (LC) is increasing exponentially [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. The growing mortality rate caused by LC makes it the most dangerous among other types of cancer [<xref ref-type="bibr" rid="ref-3">3</xref>]. The approximate 5-year survival rate of LC patients is around 10% for patients with advanced or non-surgical methods. Whereas 34% of patients are among those with 5-years survival rate. Dealing with advanced LC through histopathological image examination is critical for prognosis considerations due to its significance in providing insights regarding pathological abnormalities, cellular design, and tissue organization [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Histological characterization of LC is separated into non-small cell carcinoma (NSCLC) and small cell carcinoma (SCLC). The proportion of NSCLC present is more than 85%, whereas the rate of SCLC is less than 15% [<xref ref-type="bibr" rid="ref-5">5</xref>]. NSCLC is mainly categorized into three subtypes: adenocarcinoma, squamous cell carcinoma, and large cell carcinoma. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> visually demonstrates lung cancer subtypes. Different imaging methods for the accurate LC examination are utilized, such as computed tomography (CT), X-ray, and histopathological examination. CT is considered one of the frequently operated imaging techniques for LC staging and preoperative analysis [<xref ref-type="bibr" rid="ref-6">6</xref>]. Another basic imaging technique for LC diagnosis is X-ray, with the limitation of capturing low-resolution images [<xref ref-type="bibr" rid="ref-7">7</xref>]. MRI is a famous method for high sensitivity and specificity analysis, but MRI is not among the recommended imaging methods for LC diagnoses [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>]. The results obtained from the imaging methods discussed above provide a reference for the restaging, early diagnosis, and staging of LC, but they are not treated as a benchmark for the tumor clinical examination and qualitative staging. While LC tumor clinical diagnosis and qualitative staging are efficiently and accurately dealt with by histopathological analysis [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. Furthermore, the focus of existing studies was to exploit global features (high-level) by overlooking local significant features (Low-level).</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Histology of lung cancers.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-1.tif"/>
</fig>
<p>In the present era, cancer diagnosis has been modernized through digital imaging strategies. Early cancer classification by utilizing histopathological images has significantly transformed digital pathology, especially for LC examination. Substantial improvements in imaging research from image features extraction (FE) [<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>] and image enhancement [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>] to machine learning (ML) [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>] and deep learning (DL) [<xref ref-type="bibr" rid="ref-19">19</xref>&#x2013;<xref ref-type="bibr" rid="ref-21">21</xref>] strategies have clearly demonstrated the advancement for the accurate imaging-based classification.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>The existing research regarding methods, significance, datasets, methodologies, and limitations for LC classification using histopathological images is provided in this section. The findings from the existing literature with different LC classification methods, mostly using the histopathological LC25000 dataset in comparison with the strengths and weaknesses of the proposed model in this study, are summarized in <xref ref-type="table" rid="table-1">Table 1</xref>. The research gaps concluded from the existing studies in terms of accuracy, computational complexity, non-transparency, trade-off between convergence speed and precision, and lack of real-time deployment were the major sources of motivation behind the design of the proposed framework.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Summary of existing literature highlighting strengths and weaknesses.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Ref. No.</th>
<th>Approach</th>
<th>Use of AI</th>
<th>Dataset LC25000</th>
<th>Feature Enhancement<break/>Mechanism</th>
<th>Global and Local Features Uniformity</th>
<th>XAI</th>
<th>Smart Healthcare<break/>System</th>
<th>Challenges</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-22">22</xref>]</td>
<td>DenseNet</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Heavily relied on the pre-train weights of the network</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>CNN</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Lack of model explainability</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>CNN (CLB &#x0026; SCLB)</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>High architectural complexity and training speed</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>CNN</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Clinical interpretability of the network is limited.</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td>AlexNet</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Complex preprocessing pipeline</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td>CNN</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Computationally expensive network with a large model size</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>Explainable Deep Learning</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>Need for an external clinical validation</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>Ensemble Learning, LightGBM, AdaBoost, XGBoost and Bagging</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>A large-scale validation database is recommended</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>Multi-level CNN</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Large computational requirements</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-31">31</xref>]</td>
<td>Grey Wolf Optimization and Particle Swarm Optimization</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Unable to achieve significant gains in accuracy</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-32">32</xref>]</td>
<td>Improved graph neural network (IGNN) with Green Anaconda Optimization (GAO)</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Practical deployment isn&#x2019;t realistic</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-33">33</xref>]</td>
<td>DenseNet201, ResNet50V2, VGG16</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Dependence on pre-trained knowledge</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-34">34</xref>]</td>
<td>Enhanced Grasshopper Optimization (EGO) and Random Forest</td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Lack of scalability to large-scale tissue databases</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>CNN with gamma correction</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>Performance wasn&#x2019;t very impressive</td>
</tr>
<tr>
<td></td>
<td><bold>Proposed</bold></td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Kumar et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] employed seven transfer learning-driven architectures for enhanced FE using histopathological images of the colon and lungs. DenseNet, among other transfer learning models, performed significantly and achieved a precision and accuracy of 98.63% and 98.60%, respectively. Another LC classification solution was proposed by Masud et al. [<xref ref-type="bibr" rid="ref-23">23</xref>]. The study presented a color junction contrast enhancement method using the unmasking (UM) strategy. FE was achieved through the FE of 2D wavelet characteristics and 2D Fourier characteristics. Finally, the extracted characteristics were classified through CNN using the histopathological dataset LC25000. The incredible accuracy achieved was 96.33%. A multi-input capsule network including two convolutional layer blocks was suggested by Ali and Ali [<xref ref-type="bibr" rid="ref-24">24</xref>]. The convolutional layer block (CLB) was developed for convolutional layers, and the separable convolutional block (SCLB) was designed for separable convolutional layers. The purpose of CLB and SCLB was to process unprocessed and pre-processed histopathological LC25000 images. Hatuwal and Thapa [<xref ref-type="bibr" rid="ref-25">25</xref>] investigated the potential of CNNs for the classification of different lung tissues, such as squamous-cell-carcinoma, adenocarcinoma, and benign tissue, through LC25000 histopathological images. The validation accuracy achieved by the CNNs was 97.20%.</p>
<p>Another modified pre-trained CNN variant, AlexNet, along with a contrast enhancement strategy, was exploited by Mehmood et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] for diagnosing colon and lung cancers using the LC25000 dataset. Modified AlexNet with contrast enhancement resulted in an accuracy of 98.4%. A computer-aided diagnostic system with CNNs for Lung and colon cancer identification was proposed by Mangal et al. [<xref ref-type="bibr" rid="ref-27">27</xref>]. Histopathological images dataset LC25000 was exploited in the study and achieved 96% accuracy for colon and 97% accuracy for LC diagnosis. A DL-based diagnostic system was proposed by Civit-Masot et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] for the detection of NSCLC using the LC25000 dataset. An explainable DL driven solution was proposed for highlighting the affected areas and the contribution of each class to the classification process. The proposed solution has reduced the processing time by achieving an accuracy of 97.22%. Mamun et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] exploited ensemble learning methods for LC detection, such as LightGBM, AdaBoost, XGBoost, and Bagging. Ensemble learning methods were employed on a Kaggle database of 301 persons reflecting factors such as smoking-habits along with symptoms like chest pain, etc. In the study, XGBoost performed exceptionally with an accuracy of 94.42%. A multi-level CNN architecture was presented by Ramesh et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] for diagnosing various LC types. The aim was to detect features from lung nodules of different morphologies and unequal sizes. In the study, the histopathological dataset LC25000 was used to achieve an overall accuracy of 89%.</p>
<p>Another novel strategy was proposed by Shanmugam and Rajaguru [<xref ref-type="bibr" rid="ref-31">31</xref>] for the LC prediction using the LC25000 dataset, utilizing histopathological images. They concentrated on preprocessing and segmentation along with FE through heuristic techniques such as grey wolf optimization and particle swarm optimization. Seven image classifiers were exploited for the classification of malignant and benign. The accuracy achieved was 91.57%. The classification and segmentation of LC through histopathological images was performed by Krishnan et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] through an &#x201C;improved graph neural network&#x201D; (IGNN). The weight optimization was achieved using the green anaconda optimization algorithm (GAO). To categorize LC into five types, Phankokkruad [<xref ref-type="bibr" rid="ref-33">33</xref>] proposed three transfer learning-based networks, such as DenseNet201, ResNet50V2, and VGG16. The accuracy achieved respectively by three transfer learning architectures was 89%, 90%, and 62%, respectively.</p>
<p>Pradhan et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] used an enhanced grasshopper optimization process with a random forest classifier for the classification of lung tissues by utilizing the LC25000 histopathological dataset, with the achieved accuracy of 98.50%. Setiawan et al. [<xref ref-type="bibr" rid="ref-35">35</xref>] suggested an LC classification model through convolutional neural networks (CNN) with gamma correction using the LC25000 dataset. CNN was used for attributes extraction and classification, whereas gamma correction was applied to adjust the light of the images. The highest accuracy of 87.16% was achieved through this model.</p>
<p>To facilitate histopathological imaging-based decision making regarding accurate LC prediction, a Context Aware Fusion Network (CAFNet) for holistic feature learning and spatially localized feature learning is proposed in this study for efficiently processing and extracting global and local features, respectively. The significant contributions of the study are summarized as follows:<list list-type="bullet">
<list-item>
<p>Exploitation of MF with CLAHE enhances the lung histopathology by denoising and attaining clear contrast images.</p></list-item>
<list-item>
<p>CAFNet innovatively confirms the local and global feature uniformity to extract the contextual insights from the histopathological tissues, notably improving classification performance.</p></list-item>
<list-item>
<p>Incorporation of SARL and CARL equipped the model for a better, holistic, and focused feature learning process.</p></list-item>
<list-item>
<p>The proposed CAFNet architecture is critically designed and engineered to be computationally inexpensive for providing ease in deployment on the resource friendly devices.</p></list-item>
<list-item>
<p>The degree of adaptivity is carefully tuned in the PADAM optimization process for achieving the optimal performance by the proposed network.</p></list-item>
<list-item>
<p>Multiple XAI techniques are explored to offer valuable insights about the model&#x2019;s decisive and descriptive behavior.</p></list-item>
<list-item>
<p>Deployment of the proposed network on the web-based interface using Gradio for addressing the accessibility challenges and allowing real-time inference and user interaction.</p></list-item>
</list></p>
<p>The proposed AI-based framework is a combination of both novel and well-established components. This study introduces a novel context-aware fusion of path-level SARL and CARL with holistic attention, and a systematic PADAM adaptivity study in the histopathology domain. Additionally, the well-established components like CLAHE, Grad-CAM, LIME, and Gradio are effectively utilized to design an automated smart healthcare application for the NSCLC analysis. Moreover, we would like to mention that the inspiring and promising outcomes of the EfficientNetV2 [<xref ref-type="bibr" rid="ref-36">36</xref>] variants in terms of training speed and stability were achieved due to the incorporation of fused MBConv operations at the later stages of the network, which address the concerns of previous EfficientNetV1 variants. Seeing these innovative exploitations, the placement and incorporation of modules like MIDConv in our proposed CAFNet is carefully decided based on prior knowledge and achievements.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<p>This section describes our proposed framework for NSCLC classification through histopathological images. Initially, the enhancement of histopathological images is performed by exploiting an effective configuration of image enhancement techniques. Afterwards, the detailed description of the proposed framework, the explainability of the network, and the smart healthcare application are discussed in this section. The graphical workflow of the conducted research is given in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Graphical workflow of the proposed study.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-2.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Dataset Description</title>
<p>This study exploits a color image dataset, LC25000 [<xref ref-type="bibr" rid="ref-37">37</xref>], released by James A. Haley Veterans&#x2019; Hospital, Tampa, Florida, United States of America (USA). LC25000 contains histopathological color images of cancerous colon and lung cancers. However, this research only utilizes cancerous and benign lung tissue images. Lung carcinomas are the most predominant source of invasive cancer and a major cause of high mortality rates in America [<xref ref-type="bibr" rid="ref-38">38</xref>]. In the image acquisition phase of the LC25000 database, the rules of health insurance portability and accountability act (HIPAA) were completely followed, and the 750 color lung tissue images, including lung squamous cell carcinomas (lung-scc), benign lung tissues (lung-n), and lung adenocarcinoma (lung-aca), were acquired from microscopy slides [<xref ref-type="bibr" rid="ref-39">39</xref>].</p>
<p>Following this, an augmentor package in python programming language is used for the image augmentation of the pathology images [<xref ref-type="bibr" rid="ref-40">40</xref>]. The dataset with respect to lung cancer tissue images is expanded to 15000 color images, comprising 5000 lung tissue images for each class, including lung squamous cell carcinomas, benign lung tissues, and lung adenocarcinoma. Later, the images were resized to 224 &#x00D7; 224 pixels, and the labels were encoded using a one-hot encoder style for our multi-classification task. The data used in this study from the LC25000 is publicly available, fully de-identified, validated, and HIPAA compliant. LC25000 is widely used and acknowledged for its effective augmentation-driven expansion but also one of its core limitations due to limited patient diversity. Therefore, we would like to clarify that the proposed research and its promising outcomes reflect the enriching power of the proposed framework in pattern recognition within this benchmark, not immediate clinical generalization.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Histopathology Enhancement</title>
<p>Preprocessing plays an important role in refining the data crucial for correct classification. For image enhancement, two effective filtration techniques were used in this study, including CLAHE and MF. The most common challenge in the benchmark histogram equalization strategies is the amplification of noise during the enhancement process [<xref ref-type="bibr" rid="ref-41">41</xref>]. However, CLAHE showed promising outcomes in enhancing the quality of the images by improving contrast without significant noise amplification. The prime aim of CLAHE is to prevent darkness and cover bright regions in the image. It works by separating the contextual regions of the image and employing histogram equalization to each region. This region-specific strategy enables precise contrast enhancement for each region based on the specified needs. To address the overamplification concerns, CLAHE utilizes a clip threshold on the histogram equalization procedure within the regions. This threshold <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, controls contrast adjustment by lowering the intensification effects differently for each region. The process includes the conversion of images into lightness, green-red, blue-yellow (LAB) color space, to detach the <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>channel, which carries the most useful information for contrast adaptation. The process of applying CLAHE to this channel is given in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2227;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>L</mml:mi><mml:mi>A</mml:mi><mml:mi>H</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mstyle><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mover><mml:mi>L</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> refers to the real brightness value, <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mo>&#x2227;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> corresponds to the adjusted brightness value, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mover><mml:mi>L</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula> is the average brightness of the bordering regions, <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the threshold clip limit and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the uppermost histogram score allowed per region.</p>
<p>Additionally, a median filter is exploited in this study for removing the noise in the histopathological images. Median filters have shown promising results in the noise removal process of medical imaging datasets. MF lowers image noise by substituting outlier pixel values with the median of its adjacent values. The MF working process depends on a single parameter, which is the size of the neighborhood window.</p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the quality difference between the original and the enhanced histopathology image using CLAHE and MF. We have performed critical hyperparameter tuning associated with CLAHE and MF to obtain the best possible image enhancement. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the sample of enhanced images under different parameter values. The optimal hyperparameter values were a window size of 5, a tile size of 8, and a threshold of 40.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Quality difference between the original and the enhanced histopathology image.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-3.tif"/>
</fig><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Hyperparameter tuning of CLAHE and MF with respect to tile size, window size, and clip threshold.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-4a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-4b.tif"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Context Aware Fusion Network (CAFNet)</title>
<p>Existing medical image processing approaches often struggle to strike a balance between local and global feature extraction. Therefore, the suggested CAFNet is critically designed to overcome these constraints. The detailed pseudo code and the graphical overview of the CAFNet are given in <xref ref-type="table" rid="table-2">Table 2</xref> and <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, respectively. Additionally, <xref ref-type="table" rid="table-3">Table 3</xref> presents an extensive architectural insight into the proposed network with respect to the positioning and repetition of the blocks in the designed network. After the effective preprocessing of the data, the images will undergo multiple MIBConv layers for the initial feature extraction process. The MIBConv layer utilizes depthwise separable convolutions, which are both effective and computationally inexpensive operations. Afterwards, the network is divided into two different phases. The first phase includes the division of feature maps into four patches. Thereafter, each patch separately moves to SARL and CARL techniques for spatially localized feature learning (SLFL). These modules are carefully designed to focus on different regions in the image and highlight the most prominent ones. The outcomes of these attention modules are then passed to a global average pooling (GAP) operation for compressing and summarizing the information into a manageable style. Subsequently, the second phase of the network emphasizes holistic feature extraction (HFE) by focusing on the entire image instead of patches. The second phase uses the same attention modules but on a broader scale. These two pathways helped the network to capture both the local and global features through two independent learning schemes. Following this, both sets of features are concatenated and passed to the specified fully connected layers for further refining of the features and representation process. After the complete learning scheme of the network, it uses SoftMax activation operation for classification purposes. This extensive configuration of the modules sets CAFNet as a potential solution in medical image classification, providing noteworthy gains in accuracy and efficiency.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Pseudo code-based explanation of CAFNet.</title>
</caption>
<table>
<colgroup>
<col align="left"/> </colgroup>
<tbody>
<tr>
<td><bold><italic>Input:</italic></bold> <italic>Input Image (M), patch size (</italic><inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, <italic>constant for BN </italic>(<inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula>)</td>
</tr>
<tr>
<td>1: &#x2002;&#x2002;&#x2002;&#x2002; <italic>Initialization of network parameters</italic>.</td>
</tr>
<tr>
<td>2: &#x2002;&#x2002;&#x2002;&#x2002; <bold><italic>for</italic></bold> <italic>each image</italic> <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> <italic>in M</italic> <bold><italic>do</italic></bold></td>
</tr>
<tr>
<td>3: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<italic>Conv2D for each</italic> <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>4: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<italic>Multiple MIBConv Blocks</italic></td>
</tr>
<tr>
<td>5: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<italic>T</italic> <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<italic>Split</italic> <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>&#x2002;<italic>into four patches</italic></td>
</tr>
<tr>
<td>6: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>7: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<bold><italic>for</italic></bold> <italic>each patch t in T</italic>&#x2002;<bold><italic>do</italic></bold></td>
</tr>
<tr>
<td>8: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula> <italic>SARL(t)</italic></td>
</tr>
<tr>
<td>9: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula> <italic>CARL(t)</italic></td>
</tr>
<tr>
<td>10<italic>: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; Use GAP to pool both</italic> <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>&#x2002;<italic>and</italic> <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
</tr>
<tr>
<td>11: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<bold><italic>end for</italic></bold></td>
</tr>
<tr>
<td>12<italic>: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; Apply SARL and CARL to</italic> <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>13: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<italic>SARL(</italic><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula><italic>)</italic></td>
</tr>
<tr>
<td>14: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula>&#x2002;<italic>CARL(</italic><inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula><italic>)</italic></td>
</tr>
<tr>
<td>15: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <italic>Use GAP to pool both</italic> <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>&#x2002;<italic>and</italic> <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
</tr>
<tr>
<td>16: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula><italic>)</italic></td>
</tr>
<tr>
<td>17: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula><italic>)</italic></td>
</tr>
<tr>
<td>18: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula> <italic>Add (</italic><inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mspace width="negativethinmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>19: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <italic>Apply fully connected layers to</italic> <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>&#x2002;<italic>for classification</italic></td>
</tr>
<tr>
<td>20: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula> <italic>fully connected layers on</italic> <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>&#x2002;<italic>(</italic>256, 128, <italic>ReLU activation)</italic></td>
</tr>
<tr>
<td>21: &#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <italic>Output</italic> <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mo stretchy="false">&#x2190;</mml:mo></mml:math></inline-formula> <italic>final layer with softmax operation for</italic> 3 <italic>classes</italic></td>
</tr>
<tr>
<td>22: &#x2002;&#x2002;&#x2002;<bold><italic>end for</italic></bold></td>
</tr>
<tr>
<td>23: &#x2002;<bold><italic>return</italic></bold> <italic>Trained CAFNet</italic></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Overview of the proposed CAFNet architecture demonstrating dual phase system for both local and global feature learning.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-5.tif"/>
</fig><table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Architectural Insights of the proposed CAFNet (<inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo></mml:math></inline-formula></title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Block</th>
<th>Operation</th>
<th>Specifications</th>
</tr>
</thead>
<tbody>
<tr>
<td>Input</td>
<td>Input tensor</td>
<td><inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mn>224</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>224</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>Conv-2D</td>
<td>Convolutional layer (<inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mn>32</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula>)</td>
<td><inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>a</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>BatchNorm</td>
<td>Batch normalization</td>
<td><inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>E</mml:mi><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula></td>
</tr>
<tr>
<td>ReLU</td>
<td>Activationyunction</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>MIBConv-1</td>
<td>MIBConv (<inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mn>16</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>E</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>MIBConv-2</td>
<td>MIBConv (<inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mn>24</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>E</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>MIBConv-3</td>
<td>MIBConv (<inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mn>40</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>E</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>Patch-Division</td>
<td><inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>P</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td>Four non-overlapped patches (<inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mn>14</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>14</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>40</mml:mn></mml:math></inline-formula>)</td>
</tr>
<tr>
<td>SARL-Local</td>
<td>SARL (<inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mn>7</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>7</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo></mml:math></inline-formula>0<inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>CARL-Local</td>
<td><inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>G</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>40</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>C</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo></mml:math></inline-formula>0<inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>GAP-Local</td>
<td>Global average pooling</td>
<td><inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mn>40</mml:mn><mml:mrow><mml:mtext>D</mml:mtext></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>SARL-Global</td>
<td>SARL (<inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mn>7</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>7</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>G</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>F</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>CARL-Global</td>
<td><inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>G</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>40</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>C</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo></mml:math></inline-formula>0<inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>GAP-Global</td>
<td>Global average pooling</td>
<td><inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mn>40</mml:mn><mml:mrow><mml:mtext>D</mml:mtext></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>G</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>Concat-SARL</td>
<td>Concatenation</td>
<td><inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mn>5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>40</mml:mn><mml:mo>=</mml:mo><mml:mn>200</mml:mn><mml:mrow><mml:mtext>D</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>G</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>Concat-CARL</td>
<td>Concatenation</td>
<td><inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mn>5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>40</mml:mn><mml:mo>=</mml:mo><mml:mn>200</mml:mn><mml:mrow><mml:mtext>D</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>G</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>Features Addition</td>
<td>Element-wise addition</td>
<td>Fusion of SARL and CARL Features</td>
</tr>
<tr>
<td>Dense-1</td>
<td>Dense layer</td>
<td>256, ReLU</td>
</tr>
<tr>
<td>Dense-2</td>
<td>Dense layer</td>
<td>128, ReLU</td>
</tr>
<tr>
<td>Output</td>
<td>Softmax</td>
<td>3 Classes</td>
</tr>
<tr>
<td align="center" colspan="3">Total Parameters: 125,131 (488.79 KB)<break/>Trainable Parameters: 123,755 (483.42 KB)<break/>Non-trainable Parameters: 1376 (5.38 KB)</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>MIBConv Operation</title>
<p>The MIBConv layers are the initial components of the proposed CAFNet, which greatly enhances the effectiveness of the architecture in processing and analyzing histopathological images. This block mainly consists of three components: a 1 &#x00D7; 1 convolution for extending the number of channels, as shown in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>, a depthwise separable convolution, as shown in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, and a 1 &#x00D7; 1 convolution again to map the channel back to dimensional space, given in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mo>&#x221D;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>I</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mo>&#x221D;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2299;</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>j</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> refers to the score matrix, <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>I</mml:mi></mml:math></inline-formula> correspond to the input, <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mo>&#x221D;</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are the ReLU activation function and bias. In the proposed CAFNet, MIBConv layers are used for refining features effectively from both local and context in images. The hierarchical diagram of the MIBConv block is presented in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Workflow of the MIBConv block for initial feature extraction in CAFNet.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Spatial Attention with Residual Learning (SARL)</title>
<p>The SARL mechanism emphasizes the spatial pattern of features given in the input feature maps, as demonstrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. It determines which region to focus within the images, enabling the network to focus more on the prominent features leading to the main differentiation factor. <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref> show the mathematical representation of the SARL module in terms of the transition from the original feature map to the spatially attentive feature map.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2299;</mml:mo><mml:mi>P</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>P</mml:mi></mml:math></inline-formula> is the input feature map, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> denotes the sigmoid operation and &#x2299; refers to the element-wise multiplication. The spatial attention <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is mapped with the original feature map through element-wise multiplication for emphasizing or suppressing features.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Flow illustration of the SARL block in the proposed CAFNet.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-7.tif"/>
</fig>
</sec>
<sec id="s3_3_3">
<label>3.3.3</label>
<title>Channel Attention with Residual Learning (CARL)</title>
<p>On the other hand, CARL emphasizes the channel-wise features of the images as represented in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. Firstly, GAP is used to obtain channel-wise statistics from the input feature map <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>P</mml:mi></mml:math></inline-formula>. Afterwards, a pooled version undergoes a sigmoid operation for generating channel attentive feature maps. Following this, the attentive feature maps are applied to the original feature maps for scaling the features per channel. The above steps are mathematically presented in <xref ref-type="disp-formula" rid="eqn-7">Eqs. (7)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-9">(9)</xref>.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>P</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Flow illustration of the CARL block in the proposed CAFNet.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-8.tif"/>
</fig>
<p>Initially, the network starts with the convolutional layer as a base feature extraction for each input image <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>M</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula> Each input is passed through a transformation of Conv2D as shown in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>, where <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mo>&#x2217;</mml:mo></mml:math></inline-formula> refers to the convolutional function, <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>B</mml:mi><mml:mi>N</mml:mi></mml:math></inline-formula> is the batch normalization. <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mo>&#x221D;</mml:mo></mml:math></inline-formula> is relu activation operation.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=&#x221D;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>B</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>Afterwards, the spatially localized feature learning and holistic feature extraction are performed for effective learning at local and broader scales. The output acquired from both attention modules is further pooled using GAP, as shown in <xref ref-type="disp-formula" rid="eqn-11">Eqs. (11)</xref> and <xref ref-type="disp-formula" rid="eqn-12">(12)</xref>. Thereafter, the information from both patch-based maps and global feature maps is concatenated. The final feature vector is determined by adding the output feature vector of SARL and CARL blocks, as shown in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>. Lastly, the combined features undergo the network of fully connected layers to classify the NSCLCs, as given in <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>.
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>128</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x221D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>256</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Interpretability of the Proposed Network</title>
<p>The transparency [<xref ref-type="bibr" rid="ref-42">42</xref>] of the solution is critical in healthcare disciplines for building trust in AI-based diagnostic tools. For that reason, we have exploited the concept of explainable AI to produce a transparent and human-understandable solution for interpretable lung cancer analysis. Explainable AI (XAI) [<xref ref-type="bibr" rid="ref-43">43</xref>] provides interpretability by offering key findings on the decision-making process and qualitative insights into the solution. The transparency of the proposed network is analyzed through two different XAI-based approaches, mainly Grad-CAM and LIME, which show promising results in elaborating the decisive behavior of the AI-based models. Both interpretability schemes helped to identify the most prominent regions within the images and contributed mostly to the specified prediction of the model. <xref ref-type="table" rid="table-4">Table 4</xref> shows the complete working procedure of Grad-CAM in explainable visualization of the network predictions [<xref ref-type="bibr" rid="ref-44">44</xref>]. Similarly, the schematic diagram of LIME-based explainable AI is given in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The optimization objective of LIME involves two loss functions. The key objectives in the optimization procedure of LIME are (I) to reduce the difference between simple and complex models, (II) to control the complications of the simple model for providing interpretability. The prime aim of LIME [<xref ref-type="bibr" rid="ref-45">45</xref>] is to ensure interpretability, transparency, and local faithfulness by reducing the first loss term and maintaining the second loss as minor enough to be understandable for a human.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Pseudo-code-based explanation of Grad-CAM.</title>
</caption>
<table>
<colgroup>
<col align="left"/> </colgroup>
<tbody>
<tr>
<td><bold><italic>Input:</italic></bold></td>
</tr>
<tr>
<td><italic>&#x2002;&#x2002;&#x2002;Input Image: M</italic>,</td>
</tr>
<tr>
<td><italic>&#x2002;&#x2002;&#x2002;Proposed Network: CAFNet</italic>,</td>
</tr>
<tr>
<td><italic>&#x2002;&#x2002;&#x2002;D: Target Labels</italic></td>
</tr>
<tr>
<td><bold><italic>Output:</italic></bold></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x003A;</mml:mo></mml:math></inline-formula> <italic>Activation map for targeted label</italic>.</td> 
</tr>
<tr>
<td>1: &#x2002;<bold><italic>Forward Propagation:</italic></bold> <italic>Pass M through CAFNet for obtaining feature representation</italic> <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> <italic>at the last convolutional operation</italic>.</td>
</tr>
<tr>
<td>2: &#x2002;<bold><italic>Class Activation Score Computation:</italic></bold> <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</td>
</tr>
<tr>
<td>3: &#x2002;<bold><italic>Gradient Computation:</italic></bold> <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>C</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>G</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula>.</td>
</tr>
<tr>
<td>4: &#x2002;<bold><italic>GAP:</italic></bold> <italic>For computing gradient weights</italic>, <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>F</mml:mi></mml:mfrac><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:munder><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:munder><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:mfrac></mml:math></inline-formula>, <italic>F refers to the pixel values</italic>.</td>
</tr>
<tr>
<td>5: &#x2002;<bold><italic>Calculating Class Activation Map:</italic></bold> <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2190;&#x221D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>6: &#x2002;<bold><italic>Upsampling:</italic></bold> <italic>To match the original image M size</italic>.</td>
</tr>
<tr>
<td>7: &#x2002;<bold><italic>Return:</italic></bold> <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msubsup><mml:mi>I</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mo>.</mml:mo></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Schematic diagram of LIME-based explainable artificial intelligence.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-9.tif"/>
</fig>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Partially Adaptive Moment Estimation (PADAM)</title>
<p>PADAM is a modified version of Adam, which bridges the gap between convergence and generalization capability [<xref ref-type="bibr" rid="ref-46">46</xref>] of the optimizer. It presents a new factor <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, to modify the degree of adaptivity in the optimization strategy. The pseudo-code-based mathematical intuition behind the PADAM is presented in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>PADAM&#x2014;Pseudo code-based mathematical intuition.</title>
</caption>
<table>
<colgroup>
<col align="left"/> </colgroup>
<tbody>
<tr>
<td><bold>Input:</bold></td>
</tr>
<tr>
<td>preliminary point: <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>Z</mml:mi></mml:math></inline-formula>, momentum terms: <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, partially adaptive term: <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>,</td>
</tr>
<tr>
<td>step size: <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>To begin with, <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>For t &#x003D; 1, ..., T</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msubsup><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mi>Z</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td>end</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="table" rid="table-5">Table 5</xref>, <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the resulting stochastic gradient and <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the moving average of 2nd degree momentum for the computed stochastic gradient. The core differentiator depicted from <xref ref-type="table" rid="table-5">Table 5</xref> with respect to standard Adam [<xref ref-type="bibr" rid="ref-47">47</xref>] is the addition of &#x201C;partially adaptive term (<inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>)&#x201D; by the 2nd degree momentum:<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x3C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x3C9;</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x3B2;</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">H</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow><mml:mspace width="0.167em"></mml:mspace></mml:mrow></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo movablelimits="true">max</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula></p>

<p>PADAM transforms the standard Adam optimizer by varying the 2nd momentum explored in the adaptive learning rate. The overall update rules for both standard Adam and suggested PADAM are given below:<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>.</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msqrt><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:msqrt><mml:mo>+</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>Adam</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where, <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are 1st and 2nd order momentum estimates, <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is the learning rate (LR) and <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> is a constant term.
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>.</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msqrt><mml:msubsup><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup></mml:msqrt><mml:mo>+</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>PADAM</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-17">Eq. (17)</xref>, <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is raised to the power of <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> (<inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, which makes the learning rate partially adaptive. <xref ref-type="disp-formula" rid="eqn-16">Eq. (16)</xref> uses <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:msqrt><mml:msub><mml:mrow><mml:mover><mml:mi>e</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:msqrt></mml:math></inline-formula> for an adjustable learning rate, which occasionally resulted in a poor generalization outcome. However, PADAM introduces a partially adjustable term <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) which tunes the supremacy of <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This addition can decrease the adaptiveness of learning trends to enhance the generalization properties. Through the control of adaptiveness, PADAM intends to bridge the gap between convergence and generalization. Exploration of partially adaptive term <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) permits for a more supervised convergence procedure, evading the excessive adaptiveness which leads to obstructed convergence.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Simulations and Results</title>
<p>This section briefly offers the performance analysis of the CAFNet with different adaptivity factors of the PADAM and validation of the proposed network for the NSCLC classification. The LC25000 dataset was divided into three sets of training, validation, and testing with a ratio of 70:10:20. Both the on-hold and k-fold validation strategies are used to evaluate the effectiveness of the proposed network. All simulations were conducted using the deep learning TensorFlow framework. This research was conducted on an HP system with an octa-core processor and an Intel i7 9th-generation CPU. CAFNet was trained for 20 epochs for all optimization variations, and the average training time was almost 138 s per epoch. The proposed CAFNet is trained using an optimal learning rate of 0.001, batch size of 32, and loss function of categorical cross-entropy, which is widely used for multi-classification problems. Additionally, the interpretability of the proposed approach is extensively analyzed through effective explainable AI techniques. The performance of the network is validated through different evaluation measures such as accuracy, precision, recall, f1-score, and area under the receiver operating characteristic curve for rigorous performance evaluation essential to healthcare applications. During the inference stage of the research, it was observed that the trained CAFNet with optimal hyperparameters required approximately 25 to 28 ms per image, ensuring promising real-time performance appropriate for healthcare disciplines.</p>
<sec id="s4_1">
<label>4.1</label>
<title>CAFNet&#x2019;s Performance Analysis</title>
<p>The proposed CAFNet is executed with a standard Adam optimizer and four different adaptivity terms of the PADAM optimization approach under the same setting to attain the optimal degree of adaptivity with respect to the learning rate. <xref ref-type="table" rid="table-6">Table 6</xref> shows the brief performance analysis of the CAFNet with Adam and PADAM different <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values. Initially, the CAFNet was trained with a standard Adam optimizer for 20 iterations, which resulted in an accuracy of around 89%. Later, the network was executed with a PADAM (<inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.25</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> for 20 epochs, which showed satisfactory classification performance by achieving a test loss and accuracy of 0.1523 and 0.9390. Following this, the degree of adaptivity further increased from 0.25 to 0.5, which resulted in an improved diagnostic performance. With <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, the CAFNet attained a substantial test loss and accuracy of 0.7779 and 0.9717. Similarly, the performance in terms of other evaluation metrics like precision, recall, and f1-score for each category of cancer was noteworthy, showing the generalizability of the proposed approach. Afterwards, the degree of adaptivity is further increased to 0.75, which showed the decremental trend in the learning behavior as compared to previous adaptivity factors. With <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.75</mml:mn><mml:mo>,</mml:mo></mml:math></inline-formula> the proposed network saw a significant drop in predictive performance by attaining an accuracy of 0.9417. The path towards the divergence behavior was quite visible through this degree of adaptiveness in the optimization process. However, further analysis verifies the performance of CAFNet with <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1.0</mml:mn></mml:math></inline-formula>, which provided us with a clear idea about the complete divergence in the optimization process, as shown in <xref ref-type="table" rid="table-6">Table 6</xref>. The variations in the learning behavior of the proposed network with different <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values are presented through the learning curves given in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. A similar trend of adaptiveness in the PADAM optimization can also be observed through the AUC-ROC presented in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>, which showed the superiority of the proposed CAFNet with <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mrow><mml:mtext>PADAM&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> as compared to its counterparts. To sum up the discussion on the identification of an optimal degree of adaptiveness in the optimization process, <xref ref-type="fig" rid="fig-12">Fig. 12</xref> presents the confusion matrix at four different <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values. Hence, we concluded that the proposed CAFNet model showed optimal classification performance with <inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mrow><mml:mtext>PADAM&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Performance analysis of the CAFNet with different degrees of adaptivity in PADAM.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Method</th>
<th>Class</th>
<th>Precision</th>
<th>Recall</th>
<th>F1-Score</th>
<th>AUC-ROC</th>
<th>Loss</th>
<th>Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="3">(<inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Lung-aca</td>
<td>0.76</td>
<td>0.97</td>
<td>0.86</td>
<td rowspan="3">0.9901</td>
<td rowspan="3">0.3249</td>
<td rowspan="3">0.8990</td>
</tr>
<tr>
<td>Lung-n</td>
<td>0.97</td>
<td>0.96</td>
<td>0.98</td>
</tr>
<tr>
<td>Lung-scc</td>
<td>0.96</td>
<td>0.68</td>
<td>0.81</td>
</tr>
<tr>
<td rowspan="3">(<inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.25</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Lung-aca</td>
<td>0.98</td>
<td>0.83</td>
<td>0.90</td>
<td rowspan="3">0.9971</td>
<td rowspan="3">0.1523</td>
<td rowspan="3">0.9390</td>
</tr>
<tr>
<td>Lung-n</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Lung-scc</td>
<td>0.86</td>
<td>0.99</td>
<td>0.92</td>
</tr>
<tr>
<td rowspan="3">(<inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Lung-aca</td>
<td>0.98</td>
<td>0.94</td>
<td>0.96</td>
<td rowspan="3">0.9979</td>
<td rowspan="3">0.0779</td>
<td rowspan="3">0.9717</td>
</tr>
<tr>
<td>Lung-n</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Lung-scc</td>
<td>0.94</td>
<td>0.98</td>
<td>0.96</td>
</tr>
<tr>
<td rowspan="3">(<inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.75</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Lung-aca</td>
<td>0.94</td>
<td>0.90</td>
<td>0.92</td>
<td rowspan="3">0.9925</td>
<td rowspan="3">0.1461</td>
<td rowspan="3">0.9477</td>
</tr>
<tr>
<td>Lung-n</td>
<td>0.99</td>
<td>1.00</td>
<td>0.99</td>
</tr>
<tr>
<td>Lung-scc</td>
<td>0.91</td>
<td>0.95</td>
<td>0.93</td>
</tr>
<tr>
<td rowspan="3">(<inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1.0</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Lung-aca</td>
<td>0.34</td>
<td>1.00</td>
<td>0.50</td>
<td rowspan="3">0.5032</td>
<td rowspan="3">17,266</td>
<td rowspan="3">0.3377</td>
</tr>
<tr>
<td>Lung-n</td>
<td>1.00</td>
<td>0.01</td>
<td>0.03</td>
</tr>
<tr>
<td>Lung-scc</td>
<td>0.00</td>
<td>0.00</td>
<td>0.00</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Change in the learning behavior of the CAFNet with different <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>AUC-ROC curves of CAFNet with different <italic>P</italic><sub><italic>t</italic></sub> values.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-11.tif"/>
</fig><fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Confusion Matrix of the Proposed CAFNet with (<bold>a</bold>) <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.25</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>b</bold>) <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>c</bold>) <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.75</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>d</bold>) <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1.0</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-12a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-12b.tif"/>
</fig>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Validation of CAFNet with K-Fold Validation</title>
<p>After the performance analysis through the on-hold validation approach, we have further performed a 5-fold validation technique by splitting the dataset into multiple training and testing sets to prove the effectiveness, reliability, and generalizability of the proposed model. This validation is quite useful in evaluating the predictive performance of the deep learning networks, particularly in healthcare applications. <xref ref-type="table" rid="table-7">Table 7</xref> shows the detailed performance overview at different folds and iterations, which provides crucial insights into the effectiveness of CAFNet as a classifier for NSCLC classification. The model demonstrates superior classification proficiencies by showing a consistent average accuracy of around 0.95. For each fold, the performance of the CAFNet was observed at four different iterations with respect to both loss and accuracy. Additionally, the mean and standard deviation (std) of folds were also reported for each iteration stage. The model showed consistent accuracy across iterations, proving the enriched convergence of the proposed approach. Similarly, the low std across loss and accuracy displays the steadiness and robustness of the proposed model for the task at hand. <xref ref-type="table" rid="table-8">Table 8</xref> shows the progressive rise in the classification accuracy with the inclusion of each component in the proposed framework. It is worth noting that the addition of each component contributes significantly to the classification performance of the proposed CAFNet. However, the comprehensive analysis demonstrated that the integration of suggested components is critical for obtaining optimal results.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>K-fold validation results for CAFNet.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th align="center" rowspan="2">Fold</th>
<th>Epoch 5</th>
<th>Epoch 10</th>
<th>Epoch 15</th>
<th>Epoch 20</th>
</tr>
<tr>
<th>Accuracy/Loss</th>
<th>Accuracy/Loss</th>
<th>Accuracy/Loss</th>
<th>Accuracy/Loss</th>
</tr>
</thead>
<tbody>
<tr>
<td>Fold-1</td>
<td>0.948/0.128</td>
<td>0.954/0.096</td>
<td>0.927/0.202</td>
<td>0.968/0.060</td>
</tr>
<tr>
<td>Fold-2</td>
<td>0.952/0.122</td>
<td>0.958/0.088</td>
<td>0.931/0.187</td>
<td>0.963/0.066</td>
</tr>
<tr>
<td>Fold-3</td>
<td>0.946/0.131</td>
<td>0.953/0.099</td>
<td>0.925/0.211</td>
<td>0.965/0.062</td>
</tr>
<tr>
<td>Fold-4</td>
<td>0.949/0.126</td>
<td>0.957/0.091</td>
<td>0.929/0.195</td>
<td>0.962/0.063</td>
</tr>
<tr>
<td>Fold-5</td>
<td>0.951/0.124</td>
<td>0.955/0.094</td>
<td>0.933/0.182</td>
<td>0.969/0.058</td>
</tr>
<tr>
<td>Mean</td>
<td>0.9492/0.1262</td>
<td>0.9554/0.0936</td>
<td>0.9290/0.1954</td>
<td>0.9654/0.0618</td>
</tr>
<tr>
<td>Std</td>
<td>0.0023/0.0032</td>
<td>0.0021/0.0034</td>
<td>0.0031/0.0101</td>
<td>0.0015/0.0030</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Ablation study showing the impact of different modules on classification performance.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th rowspan="2">CLAHE &#x002B; MF</th>
<th colspan="4">Patch Division Strategy</th>
<th rowspan="2">SLFL</th>
<th rowspan="2">HFE</th>
<th rowspan="2">Accuracy (%)</th>
</tr>
<tr>
<th>No Patches</th>
<th>2 Patches</th>
<th>4 Patches</th>
<th>8 Patches</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>85.8</td>
</tr>
<tr>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>88.1</td>
</tr>
<tr>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td>91.3</td>
</tr>
<tr>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>91.8</td>
</tr>
<tr>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>93.7</td>
</tr>
<tr>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>90.6</td>
</tr>
<tr>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td><bold>&#x00D7;</bold></td>
<td>&#x2713;</td>
<td>&#x2713;</td>
<td>97.0</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Interpretability of the CAFNet with LIME and Grad-CAM</title>
<p>This study exploits two different approaches to explainable AI, such as LIME and Grad-CAM, to provide crucial insights into the decisive behavior of the proposed network. Despite the emergence of AI, the transparency of the deep networks is still the key point of concern, particularly in sensitive applications like healthcare. It&#x2019;s necessary to provide the human understandable explanations on the model&#x2019;s qualitative insights and decision-making process. <xref ref-type="fig" rid="fig-13">Fig. 13</xref> presents a LIME-based explanation of the CAFNet&#x2019;s prediction for the given histopathological image. The image shows the original and the highlighted map, providing a super pixel-level explanation of the given prediction. The regions highlighted in yellow circles indicate the most prominent and influential regions behind the specified prediction of lung squamous cell carcinoma. Additionally, the feature contribution plot in the explanation offers more crucial insights on the approximated positive weights, showing the contribution of these superpixel-based regions. Through this explanation, we can conclude the most significant aspects of the images and the decision behavior of the proposed model. Similarly, <xref ref-type="fig" rid="fig-14">Fig. 14</xref> shows the Grad-CAM-based explanation of the CAFNet&#x2019;s decision-making process. The Grad-CAM heatmap dominantly highlights the most contributed spatial regions of the given histopathology image with respect to the lung squamous cell carcinoma. The red/yellow color scheme on the heatmap shows the most contributed regions, and other cooler colors indicate the regions with minimal or no contributions. The Grad-CAM overlay provides an umbrella view of the decisive model by mapping the heatmap on the original image and highlighting the most significant regions for human understandability.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>LIME-based explanation on the CAFNet&#x2019;s prediction.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-13.tif"/>
</fig><fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Grad-CAM-based explanation on the CAFNet&#x2019;s prediction.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-14.tif"/>
</fig>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>t-Distributed Stochastic Neighbor Embedding (t-SNE) Visualization of CAFNet with Respect to Different <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> Values</title>
<p>To verify the discriminative abilities of the proposed network, this study utilized t-SNE driven two-dimensional visualization approach [<xref ref-type="bibr" rid="ref-48">48</xref>]. Initially, the principal component analysis (PCA) is used to reduce the dimensionality of the learned feature vectors from the final dense layers, which is better for the stabilization and the clear visualization of the high-dimensional space. Afterwards, the 2D embeddings are created for the projection of the learned features. <xref ref-type="fig" rid="fig-15">Fig. 15</xref> shows the detailed t-SNE visualization of the proposed CAFNet with different <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values. It can be observed that the proposed network along PADAM (<inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>) shows the best performance by producing very compact and separated clusters as compared to its counterparts. These qualitative analyses clearly demonstrate the enriching capabilities of the CAFNet in increasing the inter-class and decreasing intra-class relationships.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>t-SNE visualization of the Proposed CAFNet with (<bold>a</bold>) <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.25</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>b</bold>) <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>c</bold>) <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.75</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> (<bold>d</bold>) <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>D</mml:mi><mml:mi>A</mml:mi><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1.0</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-15.tif"/>
</fig>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>Deployment on the Web-Based Interface Using Gradio</title>
<p>To overcome the accessibility concerns, we have deployed our proposed CAFNet on a web-based user interface using a Python library Gradio [<xref ref-type="bibr" rid="ref-49">49</xref>]. The Gradio-driven web interfaces are helpful in bridging the gap between academic research and clinical usage. Through the designed web-based interface, the patients, researchers, and healthcare professionals can easily access our proposed solution for receiving real-time predictions on their histopathological domain images. The designed interface is user-friendly, equipped with real-time interaction leading to more reliable and fast response. With the help of this smart healthcare system, we would be critically monitoring the performance of the proposed network on the diverse histopathology data for the NSCLC classification. <xref ref-type="fig" rid="fig-16">Fig. 16</xref> shows our designed web-based interface using the proposed CAFNet architecture, requiring a histopathology domain image from the user to provide the prediction, confidence in the given prediction, and the Grad-CAM-driven explanation on the given user input. This smart healthcare-based application will be extremely helpful for us to improve the performance of the model as per the needs and feedback of the users. <xref ref-type="fig" rid="fig-17">Fig. 17</xref> presents the overall information flow of the application from the given input to the final prediction by our proposed model.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Deployment of the Proposed CAFNet on a web-based interface using Gradio.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-16.tif"/>
</fig><fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Visualization of the complete information flow in the designed smart healthcare application for NSCLC classification.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_78892-fig-17.tif"/>
</fig>
</sec>
<sec id="s4_6">
<label>4.6</label>
<title>Performance Comparison with the Existing Methods</title>
<p>The outcomes of the study were quite promising with respect to the successful development of a smart healthcare system for NSCLC classification through histopathology. Following this, we have compared the performance of the proposed network with the existing state-of-the-art models for NSCLC classification, given in <xref ref-type="table" rid="table-9">Table 9</xref>. It is depicted that the CAFNet has shown superior performance by outperforming its counterparts in terms of the standard evaluation measures like accuracy (ACC), precision (PRS), Recall (RC), and f1-score (F1S). The dashes (-&#x2002;-&#x2002;-) present in the comparison table indicate the evaluation measures not reported in the existing works. Similarly, all the comparisons with the existing methodologies are reported at the benchmark level and are not protocol-matched. The proposed network has achieved an impressive accuracy of 97.17% for the task at hand. Additionally, the computational complexity of the network is also compared with the existing models in terms of the model&#x2019;s architectural parameters (AP) in millions and model size (MS) in MB. From <xref ref-type="table" rid="table-9">Table 9</xref>, it is quite evident that the proposed model is impressively efficient with respect to the computational complexity as compared to its counterparts. Hence, it was concluded that the proposed CAFNet serves as an accurate, efficient, and computationally inexpensive solution for the NSCLC classification task.</p>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>Comparison with the existing studies.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th rowspan="2">Ref.</th>
<th rowspan="2">Models Description</th>
<th rowspan="2">Network</th>
<th colspan="6">Evaluation Metrics</th>
</tr>
<tr>
<th>ACC</th>
<th>PRS</th>
<th>RC</th>
<th>F1S</th>
<th>AP (M)</th>
<th>MS (MB)</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>Extracted characteristics were classified through CNN</td>
<td>CNN</td>
<td>0.96</td>
<td>0.96</td>
<td>0.96</td>
<td>0.96</td>
<td>1.03</td>
<td>3.94</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>CNNs for the classification of different lung tissues such as squamous-cell-carcinoma, adenocarcinoma and benign tissue</td>
<td>CNN</td>
<td>0.97</td>
<td>0.95</td>
<td>0.97</td>
<td>0.96</td>
<td>1.21</td>
<td>4.84</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td>CNNs for Lung and colon cancers identification</td>
<td>CNN</td>
<td>0.97</td>
<td>-&#x2002;-&#x2002;-</td>
<td>-&#x2002;-&#x2002;-</td>
<td>-&#x2002;-&#x2002;-</td>
<td>14.51</td>
<td>55.35</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>Explainable Deep Learning (DL) based solution was proposed for highlighting the affected areas and the contribution of each class to the classification process</td>
<td>Deep Network</td>
<td>0.97</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>A multi-level CNN architecture was presented to detect features from lung nodules of different morphologies and unequal sizes</td>
<td>Mult-Stage CNN</td>
<td>0.89</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>13.13</td>
<td>50.10</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-31">31</xref>]</td>
<td>Focused on preprocessing and segmentation along with FE through heuristic techniques such as grey wolf optimization and particle swarm optimization</td>
<td>Heuristics</td>
<td>0.91</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
<td>0.91</td>
<td>&#x2014;</td>
<td>&#x2014;</td>
</tr>
<tr>
<td rowspan="4">[<xref ref-type="bibr" rid="ref-33">33</xref>]</td>
<td rowspan="4">Transfer learning-based architectures</td>
<td>VGG16</td>
<td>0.62</td>
<td>0.77</td>
<td>0.62</td>
<td>0.59</td>
<td>138.4</td>
<td>553.6</td>
</tr>
<tr>
<td>ResNet50V2</td>
<td>0.90</td>
<td>0.91</td>
<td>0.90</td>
<td>0.90</td>
<td>25.6</td>
<td>102.4</td>
</tr>
<tr>
<td>DenseNet201</td>
<td>0.89</td>
<td>0.89</td>
<td>0.89</td>
<td>0.88</td>
<td>20.2</td>
<td>80.8</td>
</tr>
<tr>
<td>Ensemble</td>
<td>0.91</td>
<td>0.92</td>
<td>0.91</td>
<td>0.91</td>
<td>184.2</td>
<td>706</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>Convolutional neural networks (CNN) with gamma correction used for attributes extraction and classification</td>
<td>CNN</td>
<td>0.87</td>
<td>0.87</td>
<td>0.87</td>
<td>0.87</td>
<td>0.84</td>
<td>3.21</td>
</tr>
<tr>
<td align="center" colspan="2">Proposed</td>
<td>CAFNet</td>
<td>0.97</td>
<td>0.97</td>
<td>0.97</td>
<td>0.97</td>
<td>0.125</td>
<td>0.50</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions and Future Directions</title>
<p>This research successfully introduces a framework for interpretable AI-driven NSCLC diagnostics. It is observed that lung histopathology images are truly enhanced by integrating MF and CLAHE through critical hyperparameter tuning for optimal denoising and clear contrast images. In addition, to improve prediction accuracy, the proposed CAFNet architecture captures contextual information encapsulated in histopathology tissues by the uniformity of using detailed information through local features combined with global features for achieving a wider viewpoint. Furthermore, the superior diagnosis capability of CAFNet is achieved by tuning the degree of adaptivity for the PADAM optimizer, and the optimal convergence speed is accomplished at <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>. The proposed framework outperforms the existing benchmark studies with an improved average accuracy of around 7.36%, which is surely a great gain for the problem at hand. The study paves a way for a generalizable and trustworthy artificial intelligence in disease diagnostics by genuinely providing transparency in decision-making through two post-hoc XAI strategies, namely LIME and Grad-CAM. Moreover, this study successfully deployed the proposed network into a web-based interface using Gradio, easily accessible to the patient and healthcare professionals. The proposed framework has shown substantial outcomes, but it should still be considered as a research prototype. The external validation on the real-time patient&#x2019;s data, which is also a continuation of this research direction, is required before the proposed system can be reliably deployed in healthcare environments.</p>
<p>In the near future, we aim to further improve the performance of the designed smart healthcare application using the feedback of the users. Furthermore, our future research direction includes the design of an intelligent AI network equipped to understand two different data languages. For instance, the goal is to build a system capable of analyzing lung cancer through both computed tomography and histopathology images.</p>
</sec>
</body>
<back>
<ack>
<p>We would like to sincerely thank National Science and Technology Council (NSTC), Taiwan, and Intelligent Recognition Industry Service (IRIS) Center, Taiwan for supporting this research.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported in part by the National Science and Technology Council (NSTC), Taiwan, under project number 114WFA2610132 (NSTC 114-2221-E-224-020) and in part by the &#x201C;Intelligent Recognition Industry Service Center&#x201D; from the Featured Areas Research Center-Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The author contributions to this paper are as follows: original draft and validation, conceptualization and methodology: Muhammad Waqar; supervision, software and formal analysis: Zeshan Aslam Khan; formal analysis, funding acquisition: Arthur Chang; review, investigation and visualization: Zhishan Guo; writing, review, editing and supervision: Chuan-Yu Chang; validation; Chun-Liang Lai. All authors reviewed and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The medical imaging data utilized in this research can be found from the relevant references cited in this paper. Furthermore, the related data or material can be made available upon reasonable request by contacting the corresponding authors of this paper.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jing</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Deng</surname> <given-names>Y</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Combined use of gefitinib and bevacizumab in advanced non-small-cell lung cancer with EGFR G719S/S768I mutations and acquired C797S without T790M after osimertinib: a case report and literature review</article-title>. <source>Curr Oncol</source>. <year>2025</year>;<volume>32</volume>(<issue>4</issue>):<fpage>201</fpage>. doi:<pub-id pub-id-type="doi">10.3390/curroncol32040201</pub-id>; <pub-id pub-id-type="pmid">40277759</pub-id></mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Elhassan</surname> <given-names>SM</given-names></string-name>, <string-name><surname>Darwish</surname> <given-names>SM</given-names></string-name>, <string-name><surname>Elkaffas</surname> <given-names>SM</given-names></string-name></person-group>. <article-title>An enhanced lung cancer detection approach using dual-model deep learning technique</article-title>. <source>Comput Model Eng Sci</source>. <year>2025</year>;<volume>142</volume>(<issue>1</issue>):<fpage>835</fpage>&#x2013;<lpage>67</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2024.058770</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jani</surname> <given-names>CT</given-names></string-name>, <string-name><surname>Kareff</surname> <given-names>SA</given-names></string-name>, <string-name><surname>Morgenstern-Kaplan</surname> <given-names>D</given-names></string-name>, <string-name><surname>Salazar</surname> <given-names>AS</given-names></string-name>, <string-name><surname>Hanbury</surname> <given-names>G</given-names></string-name>, <string-name><surname>Salciccioli</surname> <given-names>JD</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Evolving trends in lung cancer risk factors in the ten most populous countries: an analysis of data from the 2019 Global burden of disease study</article-title>. <source>EClinicalMedicine</source>. <year>2025</year>;<volume>79</volume>(<issue>4</issue>):<fpage>103033</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eclinm.2024.103033</pub-id>; <pub-id pub-id-type="pmid">39968204</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shamas</surname> <given-names>S</given-names></string-name>, <string-name><surname>Panda</surname> <given-names>SN</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>I</given-names></string-name>, <string-name><surname>Guleria</surname> <given-names>K</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ali AlZubi</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>An improved lung cancer segmentation based on nature-inspired optimization approaches</article-title>. <source>Comput Model Eng Sci</source>. <year>2024</year>;<volume>138</volume>(<issue>2</issue>):<fpage>1051</fpage>&#x2013;<lpage>75</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2023.030712</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hendriks</surname> <given-names>LEL</given-names></string-name>, <string-name><surname>Remon</surname> <given-names>J</given-names></string-name>, <string-name><surname>Faivre-Finn</surname> <given-names>C</given-names></string-name>, <string-name><surname>Garassino</surname> <given-names>MC</given-names></string-name>, <string-name><surname>Heymach</surname> <given-names>JV</given-names></string-name>, <string-name><surname>Kerr</surname> <given-names>KM</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Non-small-cell lung cancer</article-title>. <source>Nat Rev Dis Primers</source>. <year>2024</year>;<volume>10</volume>(<issue>1</issue>):<fpage>71</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41572-024-00551-9</pub-id>; <pub-id pub-id-type="pmid">39327441</pub-id></mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Draelos</surname> <given-names>RL</given-names></string-name>, <string-name><surname>Dov</surname> <given-names>D</given-names></string-name>, <string-name><surname>Mazurowski</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Lo</surname> <given-names>JY</given-names></string-name>, <string-name><surname>Henao</surname> <given-names>R</given-names></string-name>, <string-name><surname>Rubin</surname> <given-names>GD</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Machine-learning-based multiple abnormality prediction with large-scale chest computed tomography volumes</article-title>. <source>Med Image Anal</source>. <year>2021</year>;<volume>67</volume>:<fpage>101857</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.media.2020.101857</pub-id>; <pub-id pub-id-type="pmid">33129142</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Miki</surname> <given-names>T</given-names></string-name>, <string-name><surname>Yano</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hanibuchi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Sone</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Bone metastasis model with multiorgan dissemination of human small-cell lung cancer (SBC-5) cells in natural killer cell-depleted SCID mice</article-title>. <source>Oncol Res</source>. <year>2000</year>;<volume>12</volume>(<issue>5</issue>):<fpage>209</fpage>&#x2013;<lpage>17</lpage>. doi:<pub-id pub-id-type="doi">10.3727/096504001108747701</pub-id>; <pub-id pub-id-type="pmid">11417746</pub-id></mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Fang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Lai</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Automatic detection of diabetic retinopathy with statistical method and Bayesian classifier</article-title>. <source>J Med Imaging Hlth Inform</source>. <year>2020</year>;<volume>10</volume>(<issue>5</issue>):<fpage>1225</fpage>&#x2013;<lpage>33</lpage>. doi:<pub-id pub-id-type="doi">10.1166/jmihi.2020.3025</pub-id>; <pub-id pub-id-type="pmid">18421121</pub-id></mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Magnetic resonance imaging manifestations of brain metastases in patients with lung cancer</article-title>. <source>J Med Imaging Hlth Inform</source>. <year>2020</year>;<volume>10</volume>(<issue>12</issue>):<fpage>2985</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1166/jmihi.2020.3248</pub-id>; <pub-id pub-id-type="pmid">18421121</pub-id></mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Szab&#x00F3;</surname> <given-names>M</given-names></string-name>, <string-name><surname>Boz&#x00F3;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Darvas</surname> <given-names>K</given-names></string-name>, <string-name><surname>So&#x00F3;s</surname> <given-names>S</given-names></string-name>, <string-name><surname>&#x0150;zse</surname> <given-names>M</given-names></string-name>, <string-name><surname>Iv&#x00E1;nyi</surname> <given-names>ZD</given-names></string-name></person-group>. <article-title>The role of ultrasonographic lung aeration score in the prediction of postoperative pulmonary complications: an observational study</article-title>. <source>BMC Anesthesiol</source>. <year>2021</year>;<volume>21</volume>(<issue>1</issue>):<fpage>19</fpage>. doi:<pub-id pub-id-type="doi">10.1186/s12871-021-01236-6</pub-id>; <pub-id pub-id-type="pmid">33446103</pub-id></mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sari</surname> <given-names>CT</given-names></string-name>, <string-name><surname>Gunduz-Demir</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Unsupervised feature extraction via deep learning for histopathological classification of colon tissue images</article-title>. <source>IEEE Trans Med Imag</source>. <year>2019</year>;<volume>38</volume>(<issue>5</issue>):<fpage>1139</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TMI.2018.2879369</pub-id>; <pub-id pub-id-type="pmid">30403624</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sudharshan</surname> <given-names>PJ</given-names></string-name>, <string-name><surname>Petitjean</surname> <given-names>C</given-names></string-name>, <string-name><surname>Spanhol</surname> <given-names>F</given-names></string-name>, <string-name><surname>Oliveira</surname> <given-names>LE</given-names></string-name>, <string-name><surname>Heutte</surname> <given-names>L</given-names></string-name>, <string-name><surname>Honeine</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Multiple instance learning for histopathological breast cancer image classification</article-title>. <source>Expert Syst Appl</source>. <year>2019</year>;<volume>117</volume>(<issue>9</issue>):<fpage>103</fpage>&#x2013;<lpage>11</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eswa.2018.09.049</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>W</given-names></string-name></person-group>. <article-title>ANC: attention network for COVID-19 explainable diagnosis based on convolutional block attention module</article-title>. <source>Comput Model Eng Sci</source>. <year>2021</year>;<volume>127</volume>(<issue>3</issue>):<fpage>1037</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2021.015807</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ponnarengan</surname> <given-names>H</given-names></string-name>, <string-name><surname>Rajendran</surname> <given-names>S</given-names></string-name>, <string-name><surname>Khalkar</surname> <given-names>V</given-names></string-name>, <string-name><surname>Devarajan</surname> <given-names>G</given-names></string-name>, <string-name><surname>Kamaraj</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Data-driven healthcare: the role of computational methods in medical innovation</article-title>. <source>Comput Model Eng Sci</source>. <year>2025</year>;<volume>142</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>48</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2024.056605</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dinh</surname> <given-names>PH</given-names></string-name>, <string-name><surname>Giang</surname> <given-names>NL</given-names></string-name></person-group>. <article-title>A new medical image enhancement algorithm using adaptive parameters</article-title>. <source>Int J Imag Syst Technol</source>. <year>2022</year>;<volume>32</volume>(<issue>6</issue>):<fpage>2198</fpage>&#x2013;<lpage>218</lpage>. doi:<pub-id pub-id-type="doi">10.1002/ima.22778</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alalwan</surname> <given-names>N</given-names></string-name>, <string-name><surname>Taloba</surname> <given-names>AI</given-names></string-name>, <string-name><surname>Abozeid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alzahrani</surname> <given-names>AI</given-names></string-name>, <string-name><surname>Al-Bayatti</surname> <given-names>AH</given-names></string-name></person-group>. <article-title>A hybrid classification and identification of pneumonia using African buffalo optimization and CNN from chest X-ray images</article-title>. <source>Comput Model Eng Sci</source>. <year>2024</year>;<volume>138</volume>(<issue>3</issue>):<fpage>2497</fpage>&#x2013;<lpage>517</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2023.029910</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khan</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Waqar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Raja</surname> <given-names>MJAA</given-names></string-name>, <string-name><surname>Chaudhary</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>ATMA</given-names></string-name>, <string-name><surname>Raja</surname> <given-names>MAZ</given-names></string-name></person-group>. <article-title>Generalized fractional optimization-based explainable lightweight CNN model for malaria disease classification</article-title>. <source>Comput Biol Med</source>. <year>2025</year>;<volume>185</volume>(<issue>4</issue>):<fpage>109593</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compbiomed.2024.109593</pub-id>; <pub-id pub-id-type="pmid">39709870</pub-id></mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alnuaimi</surname> <given-names>MN</given-names></string-name>, <string-name><surname>Alqahtani</surname> <given-names>NS</given-names></string-name>, <string-name><surname>Gollapalli</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rahman</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alahmadi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bakry</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Transfer learning empowered skin diseases detection in children</article-title>. <source>Comput Model Eng Sci</source>. <year>2024</year>;<volume>141</volume>(<issue>3</issue>):<fpage>2609</fpage>&#x2013;<lpage>23</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2024.055303</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Waqar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Khawaja</surname> <given-names>ST</given-names></string-name>, <string-name><surname>Chaudhary</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cheema</surname> <given-names>KM</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Explainable clinical diagnosis through unexploited yet optimized fine-tuned ConvNeXt Models for accurate monkeypox disease classification</article-title>. <source>SLAS Technol</source>. <year>2025</year>;<volume>33</volume>(<issue>5</issue>):<fpage>100336</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.slast.2025.100336</pub-id>; <pub-id pub-id-type="pmid">40712913</pub-id></mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tsuneki</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Deep learning models in medical image analysis</article-title>. <source>J Oral Biosci</source>. <year>2022</year>;<volume>64</volume>(<issue>3</issue>):<fpage>312</fpage>&#x2013;<lpage>20</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.job.2022.03.003</pub-id>; <pub-id pub-id-type="pmid">35306172</pub-id></mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khan</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Waqar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>HU</given-names></string-name>, <string-name><surname>Chaudhary</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>AT</given-names></string-name>, <string-name><surname>Ishtiaq</surname> <given-names>I</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Fine-tuned deep transfer learning: an effective strategy for the accurate chronic kidney disease classification</article-title>. <source>PeerJ Comput Sci</source>. <year>2025</year>;<volume>11</volume>(<issue>2</issue>):<fpage>e2800</fpage>. doi:<pub-id pub-id-type="doi">10.7717/peerj-cs.2800</pub-id>; <pub-id pub-id-type="pmid">40567689</pub-id></mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>N</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>M</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>VP</given-names></string-name>, <string-name><surname>Madan</surname> <given-names>C</given-names></string-name>, <string-name><surname>Mehandia</surname> <given-names>S</given-names></string-name></person-group>. <article-title>An empirical study of handcrafted and dense feature extraction techniques for lung and colon cancer classification from histopathological images</article-title>. <source>Biomed Signal Process Control</source>. <year>2022</year>;<volume>75</volume>(<issue>1</issue>):<fpage>103596</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.bspc.2022.103596</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Masud</surname> <given-names>M</given-names></string-name>, <string-name><surname>Sikder</surname> <given-names>N</given-names></string-name>, <string-name><surname>Nahid</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Bairagi</surname> <given-names>AK</given-names></string-name>, <string-name><surname>AlZain</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>A machine learning approach to diagnosing lung and colon cancer using a deep learning-based classification framework</article-title>. <source>Sensors</source>. <year>2021</year>;<volume>21</volume>(<issue>3</issue>):<fpage>748</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s21030748</pub-id>; <pub-id pub-id-type="pmid">33499364</pub-id></mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ali</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ali</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Multi-input dual-stream capsule network for improved lung and colon cancer classification</article-title>. <source>Diagnostics</source>. <year>2021</year>;<volume>11</volume>(<issue>8</issue>):<fpage>1485</fpage>. doi:<pub-id pub-id-type="doi">10.3390/diagnostics11081485</pub-id>; <pub-id pub-id-type="pmid">34441419</pub-id></mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hatuwal</surname> <given-names>BK</given-names></string-name>, <string-name><surname>Thapa</surname> <given-names>HC</given-names></string-name></person-group>. <article-title>Lung cancer detection using convolutional neural network on histopathological images</article-title>. <source>Int J Comput Trends Technol</source>. <year>2020</year>;<volume>68</volume>(<issue>10</issue>):<fpage>21</fpage>&#x2013;<lpage>4</lpage>. doi:<pub-id pub-id-type="doi">10.14445/22312803/ijctt-v68i10p104</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mehmood</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ghazal</surname> <given-names>TM</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Zubair</surname> <given-names>M</given-names></string-name>, <string-name><surname>Naseem</surname> <given-names>MT</given-names></string-name>, <string-name><surname>Faiz</surname> <given-names>T</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Malignancy detection in lung and colon histopathology images using transfer learning with class selective image processing</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>25657</fpage>&#x2013;<lpage>68</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2022.3150924</pub-id>; <pub-id pub-id-type="pmid">25079929</pub-id></mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Mangal</surname> <given-names>S</given-names></string-name>, <string-name><surname>Chaurasia</surname> <given-names>A</given-names></string-name>, <string-name><surname>Khajanchi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Convolution Neural Networks for diagnosing colon and lung cancer histopathological images</article-title>. <comment>arXiv:2009.03878. 2020</comment>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Civit-Masot</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ba&#x00F1;uls-Beaterio</surname> <given-names>A</given-names></string-name>, <string-name><surname>Dom&#x00ED;nguez-Morales</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rivas-P&#x00E9;rez</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mu&#x00F1;oz-Saavedra</surname> <given-names>L</given-names></string-name>, <string-name><surname>Rodr&#x00ED;guez Corral</surname> <given-names>JM</given-names></string-name></person-group>. <article-title>Non-small cell lung cancer diagnosis aid with histopathological images using Explainable Deep Learning techniques</article-title>. <source>Comput Methods Programs Biomed</source>. <year>2022</year>;<volume>226</volume>(<issue>3</issue>):<fpage>107108</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cmpb.2022.107108</pub-id>; <pub-id pub-id-type="pmid">36113183</pub-id></mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mamun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Farjana</surname> <given-names>A</given-names></string-name>, <string-name><surname>Al Mamun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ahammed</surname> <given-names>MS</given-names></string-name></person-group>. <article-title>Lung cancer prediction model using ensemble learning techniques and a systematic review analysis</article-title>. In: <conf-name>2022 IEEE World AI IoT Congress (AIIoT); 2022 Jun 6&#x2013;9</conf-name>; <publisher-loc>Seattle, WA, USA</publisher-loc>. p. <fpage>187</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1109/AIIoT54504.2022.9817326</pub-id>; <pub-id pub-id-type="pmid">25079929</pub-id></mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ramesh</surname> <given-names>M</given-names></string-name>, <string-name><surname>Maheswaran</surname> <given-names>S</given-names></string-name>, <string-name><surname>Theivanayaki</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Efficient lung cancer classification on multi level convolution neural network using histopathological images</article-title>. In: <conf-name>2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT); 2023 Jul 6&#x2013;8</conf-name>; <publisher-loc>Delhi, India</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICCCNT56998.2023.10307852</pub-id>; <pub-id pub-id-type="pmid">25079929</pub-id></mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shanmugam</surname> <given-names>K</given-names></string-name>, <string-name><surname>Rajaguru</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Exploration and enhancement of classifiers in the detection of lung cancer from histopathological images</article-title>. <source>Diagnostics</source>. <year>2023</year>;<volume>13</volume>(<issue>20</issue>):<fpage>3289</fpage>. doi:<pub-id pub-id-type="doi">10.3390/diagnostics13203289</pub-id>; <pub-id pub-id-type="pmid">37892110</pub-id></mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Krishnan</surname> <given-names>SD</given-names></string-name>, <string-name><surname>Pelusi</surname> <given-names>D</given-names></string-name>, <string-name><surname>Daniel</surname> <given-names>A</given-names></string-name>, <string-name><surname>Suresh</surname> <given-names>V</given-names></string-name>, <string-name><surname>Balusamy</surname> <given-names>B</given-names></string-name></person-group>. <article-title>Improved graph neural network-based green anaconda optimization for segmenting and classifying the lung cancer</article-title>. <source>Math Biosci Eng</source>. <year>2023</year>;<volume>20</volume>(<issue>9</issue>):<fpage>17138</fpage>&#x2013;<lpage>57</lpage>. doi:<pub-id pub-id-type="doi">10.3934/mbe.2023764</pub-id>; <pub-id pub-id-type="pmid">37920050</pub-id></mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Phankokkruad</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Ensemble transfer learning for lung cancer detection</article-title>. In: <conf-name>2021 4th International Conference on Data Science and Information Technology; 2021 Jul 23&#x2013;25</conf-name>; <publisher-loc>Shanghai China</publisher-loc>. p. <fpage>438</fpage>&#x2013;<lpage>42</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3478905.3478995</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pradhan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Bhuiyan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Mishra</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Histopathological lung cancer detection using enhanced grasshopper optimization algorithm with random forest</article-title>. <source>Int J Intell Eng Syst</source>. <year>2022</year>;<volume>15</volume>(<issue>6</issue>):<fpage>11</fpage>&#x2013;<lpage>20</lpage>. doi:<pub-id pub-id-type="doi">10.22266/ijies2022.1231.02</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Setiawan</surname> <given-names>W</given-names></string-name>, <string-name><surname>Suhadi</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Pramudita</surname> <given-names>YD</given-names></string-name></person-group>. <article-title>Histopathology of lung cancer classification using convolutional neural network with gamma correction</article-title>. <source>Commun Math Biol Neurosci</source>. <year>2022</year>;<volume>2022</volume>:<fpage>81</fpage>. doi:<pub-id pub-id-type="doi">10.28919/cmbn/7611</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Tan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Le</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Efficientnetv2: smaller models and faster training</article-title>. In: <conf-name>Proceedings of the International Conference on Machine Learning; 2021 Jul 18&#x2013;24; Online</conf-name>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Borkowski</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Bui</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Thomas</surname> <given-names>LB</given-names></string-name>, <string-name><surname>Wilson</surname> <given-names>CP</given-names></string-name>, <string-name><surname>DeLand</surname> <given-names>LA</given-names></string-name>, <string-name><surname>Mastorides</surname> <given-names>SM</given-names></string-name></person-group>. <article-title>Lung and colon cancer histopathological image dataset (LC25000)</article-title>. <comment>arXiv:1912.12142. 2019</comment>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zullig</surname> <given-names>LL</given-names></string-name>, <string-name><surname>Jackson</surname> <given-names>GL</given-names></string-name>, <string-name><surname>Dorn</surname> <given-names>RA</given-names></string-name>, <string-name><surname>Provenzale</surname> <given-names>DT</given-names></string-name>, <string-name><surname>McNeil</surname> <given-names>R</given-names></string-name>, <string-name><surname>Thomas</surname> <given-names>CM</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Cancer incidence among patients of the U.S. veterans affairs health care system</article-title>. <source>Mil Med</source>. <year>2012</year>;<volume>177</volume>(<issue>6</issue>):<fpage>693</fpage>&#x2013;<lpage>701</lpage>. doi:<pub-id pub-id-type="doi">10.7205/milmed-d-11-00434</pub-id>; <pub-id pub-id-type="pmid">22730846</pub-id></mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Borkowski</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Wilson</surname> <given-names>CP</given-names></string-name>, <string-name><surname>Borkowski</surname> <given-names>SA</given-names></string-name>, <string-name><surname>Thomas</surname> <given-names>LB</given-names></string-name>, <string-name><surname>Deland</surname> <given-names>LA</given-names></string-name>, <string-name><surname>Grewe</surname> <given-names>SJ</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Comparing artificial intelligence platforms for histopathologic cancer diagnosis</article-title>. <source>Fed Pract</source>. <year>2019</year>;<volume>36</volume>(<issue>10</issue>):<fpage>456</fpage>&#x2013;<lpage>63</lpage>; <pub-id pub-id-type="pmid">31768096</pub-id></mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bloice</surname> <given-names>MD</given-names></string-name>, <string-name><surname>Roth</surname> <given-names>PM</given-names></string-name>, <string-name><surname>Holzinger</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Biomedical image augmentation using Augmentor</article-title>. <source>Bioinformatics</source>. <year>2019</year>;<volume>35</volume>(<issue>21</issue>):<fpage>4522</fpage>&#x2013;<lpage>4</lpage>. doi:<pub-id pub-id-type="doi">10.1093/bioinformatics/btz259</pub-id>; <pub-id pub-id-type="pmid">30989173</pub-id></mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hayati</surname> <given-names>M</given-names></string-name>, <string-name><surname>Muchtar</surname> <given-names>K</given-names></string-name>, <collab>Roslidar</collab>, <string-name><surname>Maulina</surname> <given-names>N</given-names></string-name>, <string-name><surname>Syamsuddin</surname> <given-names>I</given-names></string-name>, <string-name><surname>Elwirehardja</surname> <given-names>GN</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Impact of CLAHE-based image enhancement for diabetic retinopathy classification through deep learning</article-title>. <source>Procedia Comput Sci</source>. <year>2023</year>;<volume>216</volume>(<issue>1</issue>):<fpage>57</fpage>&#x2013;<lpage>66</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.procs.2022.12.111</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Angelov</surname> <given-names>PP</given-names></string-name>, <string-name><surname>Soares</surname> <given-names>EA</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>R</given-names></string-name>, <string-name><surname>Arnold</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Atkinson</surname> <given-names>PM</given-names></string-name></person-group>. <article-title>Explainable artificial intelligence: an analytical review</article-title>. <source>WIREs Data Min Knowl</source>. <year>2021</year>;<volume>11</volume>(<issue>5</issue>):<fpage>e1424</fpage>. doi:<pub-id pub-id-type="doi">10.1002/widm.1424</pub-id>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>F</given-names></string-name>, <string-name><surname>Uszkoreit</surname> <given-names>H</given-names></string-name>, <string-name><surname>Du</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>J</given-names></string-name></person-group>. <chapter-title>Explainable AI: a brief survey on history, research areas, approaches and challenges</chapter-title>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>; <year>2019</year>. p. <fpage>563</fpage>&#x2013;<lpage>74</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-030-32236-6_51</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Selvaraju</surname> <given-names>RR</given-names></string-name>, <string-name><surname>Cogswell</surname> <given-names>M</given-names></string-name>, <string-name><surname>Das</surname> <given-names>A</given-names></string-name>, <string-name><surname>Vedantam</surname> <given-names>R</given-names></string-name>, <string-name><surname>Parikh</surname> <given-names>D</given-names></string-name>, <string-name><surname>Batra</surname> <given-names>D</given-names></string-name></person-group>. <article-title>VGrad-CAM: visual explanations from deep networks via gradient-based localization</article-title>. In: <conf-name>2017 IEEE International Conference on Computer Vision (ICCV); 2017 Oct 22&#x2013;29</conf-name>; <publisher-loc>Venice, Italy</publisher-loc>. p. <fpage>618</fpage>&#x2013;<lpage>26</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICCV.2017.74</pub-id>; <pub-id pub-id-type="pmid">25079929</pub-id></mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ivison</surname> <given-names>H</given-names></string-name>, <string-name><surname>Han</surname> <given-names>SC</given-names></string-name>, <string-name><surname>Poon</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Local interpretations for explainable natural language processing: a survey</article-title>. <source>ACM Comput Surv</source>. <year>2024</year>;<volume>56</volume>(<issue>9</issue>):<fpage>1</fpage>&#x2013;<lpage>36</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3649450</pub-id>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>D</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Gu</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Closing the generalization gap of adaptive gradient methods in training deep neural networks</article-title>. In: <conf-name>Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence; 2020 Jul 11&#x2013;17</conf-name>; <publisher-loc>Yokohama, Japan</publisher-loc>. p. <fpage>3267</fpage>&#x2013;<lpage>75</lpage>. doi:<pub-id pub-id-type="doi">10.24963/ijcai.2020/452</pub-id>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sashank</surname> <given-names>JR</given-names></string-name>, <string-name><surname>Satyen</surname> <given-names>K</given-names></string-name>, <string-name><surname>Sanjiv</surname> <given-names>K</given-names></string-name></person-group>. <article-title>On the convergence of Adam and beyond</article-title>. In: <conf-name>Proceedings of the International Conference on Learning Representations; 2018 Apr 4&#x2013;May 3</conf-name>; <publisher-loc>Vancouver, BC, Canada</publisher-loc>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Anvari</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Rahmati</surname> <given-names>D</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>S</given-names></string-name></person-group>. <article-title>t-Distributed stochastic neighbor embedding</article-title>. In: <conf-name>Dimensionality reduction in machine learning</conf-name>. <publisher-loc>San Francisco, CA, USA</publisher-loc>: <publisher-name>Morgan Kaufmann</publisher-name>; <year>2025</year>. p. <fpage>187</fpage>&#x2013;<lpage>207</lpage>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Abid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Abdalla</surname> <given-names>A</given-names></string-name>, <string-name><surname>Abid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>D</given-names></string-name>, <string-name><surname>Alfozan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zou</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Gradio: hassle-free sharing and testing of ML models in the wild</article-title>. <comment>arXiv:1906.02569. 2019</comment>.</mixed-citation></ref>
</ref-list>
</back></article>
















