<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Artif. Intell.</journal-id>
<journal-title>Frontiers in Artificial Intelligence</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Artif. Intell.</abbrev-journal-title>
<issn pub-type="epub">2624-8212</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frai.2025.1639720</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Artificial Intelligence</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Artificial liver classifier: a new alternative to conventional machine learning models</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Jumaah</surname> <given-names>Mahmood A.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2964770/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Ali</surname> <given-names>Yossra H.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Rashid</surname> <given-names>Tarik A.</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1555460/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Computer Science, University of Technology</institution>, <addr-line>Baghdad</addr-line>, <country>Iraq</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Computer Science and Engineering, Artificial Intelligence and Innovation Centre (AIIC), University of Kurdistan Hewl&#x000EA;r</institution>, <addr-line>Erbil</addr-line>, <country>Iraq</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Moolchand Sharma, Maharaja Agrasen Institute of Technology, India</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Chinmay Chakraborty, Kalinga Institute of Industrial Technology (KIIT) Deemed-to-be University, India</p>
<p>Hasi Hays, University of Arkansas, United States</p>
<p>Ben Othman Soufiane, King Faisal University, Saudi Arabia</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Mahmood A. Jumaah <email>cs.22.27&#x00040;grad.uotechnology.edu.iq</email></corresp>
<corresp id="c002">Tarik A. Rashid <email>tarik.ahmed&#x00040;ukh.edu.krd</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>08</day>
<month>08</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>8</volume>
<elocation-id>1639720</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>06</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>16</day>
<month>07</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2025 Jumaah, Ali and Rashid.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Jumaah, Ali and Rashid</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Supervised machine learning classifiers sometimes face challenges related to the performance, accuracy, or overfitting.</p>
</sec>
<sec>
<title>Methods</title>
<p>This paper introduces the Artificial Liver Classifier (ALC), a novel supervised learning model inspired by the human liver&#x00027;s detoxification function. The ALC is characterized by its simplicity, speed, capability to reduce overfitting, and effectiveness in addressing multi-class classification problems through straightforward mathematical operations. To optimize the ALC&#x00027;s parameters, an improved FOX optimization algorithm (IFOX) is employed during training.</p>
</sec>
<sec>
<title>Results</title>
<p>We evaluate the proposed ALC on five benchmark datasets: Iris Flower, Breast Cancer Wisconsin, Wine, Voice Gender, and MNIST. The results demonstrate competitive performance, with ALC achieving up to 100% accuracy on the Iris dataset&#x02013;surpassing logistic regression, multilayer perceptron, and support vector machine&#x02013;and 99.12% accuracy on the Breast Cancer dataset, outperforming XGBoost and logistic regression. Across all datasets, ALC consistently shows smaller generalization gaps and lower loss values compared to conventional classifiers.</p>
</sec>
<sec>
<title>Discussion</title>
<p>These findings highlight the potential of biologically inspired models to develop efficient machine learning classifiers and open new avenues for innovation in the field.</p>
</sec></abstract>
<kwd-group>
<kwd>artificial liver classifier (ALC)</kwd>
<kwd>artificial intelligence</kwd>
<kwd>classification</kwd>
<kwd>intelligent systems</kwd>
<kwd>machine learning</kwd>
<kwd>optimization</kwd>
</kwd-group>
<counts>
<fig-count count="9"/>
<table-count count="10"/>
<equation-count count="14"/>
<ref-count count="68"/>
<page-count count="18"/>
<word-count count="11818"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Medicine and Public Health</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Artificial intelligence (AI) has many branches according to the tasks to be performed, with machine learning (ML) being one of the most well-known branches that has gained prominence alongside the development of computer science. It focuses on developing systems and algorithms that automatically learn from data without explicit programming (Kolides et al., <xref ref-type="bibr" rid="B35">2023</xref>; Dwivedi et al., <xref ref-type="bibr" rid="B14">2021</xref>; Khudhair et al., <xref ref-type="bibr" rid="B34">2024c</xref>). However, two main types of ML are categorized according to the problem to be solved: supervised learning and unsupervised learning. Supervised learning relies on having pre-labeled input data (denoted <italic>X</italic>) and the desired output (denoted <italic>y</italic>). This type of learning aims to understand the hidden relationship between inputs and outputs to predict new outcomes based on unseen (new) input data (Jiang et al., <xref ref-type="bibr" rid="B28">2020</xref>; Beam and Zupancic, <xref ref-type="bibr" rid="B8">2022</xref>; Zhao et al., <xref ref-type="bibr" rid="B68">2024</xref>). On the other hand, unsupervised learning uses input data that is not pre-labeled (does not contain output y). Instead, an unsupervised learning model is applied to discover patterns and hidden relationships in the data autonomously based on the input data only (Watson, <xref ref-type="bibr" rid="B63">2023</xref>; Molnar et al., <xref ref-type="bibr" rid="B43">2020</xref>). Furthermore, there are other types of ML such as reinforcement learning (RL), which interact directly with the problem&#x00027;s environment to build policies that guide decision-making based on rewards and penalties obtained through trial and error (Gao and Schweidtmann, <xref ref-type="bibr" rid="B17">2024</xref>; Mutar and Jawad, <xref ref-type="bibr" rid="B45">2023</xref>; Kumar et al., <xref ref-type="bibr" rid="B38">2023</xref>; Khudhair et al., <xref ref-type="bibr" rid="B33">2024b</xref>).</p>
<p>In the early stages of AI, researchers focused on building systems (with minimal intelligence) capable of performing specific tasks using fixed rules (conditional and logical operations). As the field evolved, scientists realized that intelligent systems needed methods to learn from data, rather than relying on rigid rule-based methods with minimal capabilities (Grzybowski et al., <xref ref-type="bibr" rid="B20">2024</xref>; Jabber et al., <xref ref-type="bibr" rid="B27">2023</xref>). As a result, supervised learning algorithms, specifically classifiers, emerged as tools for learning systems to make predictions or decisions based on the available experiences. However, one of the most preeminent algorithms in supervised learning is artificial neural network (ANN), inspired by the fundamental concept of neurons in the human brain and how they are interconnected (Palanivinayagam et al., <xref ref-type="bibr" rid="B49">2023</xref>). These networks are based on the concept of neurons, which are basic units in the brain that communicate with each other to perform processes such as thinking and learning (Schmidgall et al., <xref ref-type="bibr" rid="B56">2024</xref>). The algorithm simulates the functions of brain cells by proposing multiple layers of artificial neurons (an input layer and an output layer). These neurons interact with each other using weights assigned to each connection, and the role of the algorithm is to optimize these weights to minimize the error resulting from interactions with the input data, thereby producing accurate outputs (Jumaah et al., <xref ref-type="bibr" rid="B29">2024</xref>). Moreover, an older algorithm inspired by mathematics is the logistic regression (LR), which aims to find a perfect line that best fits the data points, minimizing the error between actual and predicted labels. These methods were used in statistical analyses before being adopted in ML (Jumin et al., <xref ref-type="bibr" rid="B30">2020</xref>). The complexity of linear operations increased, leading to more sophisticated methods, such as support vector machine (SVM), where the main idea is to create clear boundaries between different data classes by maximizing the margin between them (Quan and Pu, <xref ref-type="bibr" rid="B52">2022</xref>). Comprehensively, most of ML classifiers have drawn their inspirations from mathematical operations or nature (e.g., simulating the functioning of human brain cells) to create robust systems (classifiers) for solving complex problems. Current ML classifiers face multiple challenges related to performance, accuracy or loss, overfitting, and handling data with complex and non-linear patterns (Tufail et al., <xref ref-type="bibr" rid="B61">2023</xref>; Khudhair et al., <xref ref-type="bibr" rid="B32">2024a</xref>).</p>
<p>In this context, this paper proposes a new classifier called artificial liver classifier (ALC), inspired by the human liver&#x00027;s biological functions. Specifically, it draws on the detoxification function, highlighting its ability to process toxins and convert them into removable forms. Additionally, improvements have been made to FOX optimization algorithm (FOX), a state-of-the-art optimization algorithm, to enhance its performance and ensure compatibility with the proposed ALC. The research aims to bridge the gap in current ML&#x00027;s algorithms by combining the simplicity of mathematical design with solid performance by simulating the detoxification function in the human liver. Furthermore, the proposed classifier aims to improve classification performance by processing data dynamically, simulating the human liver&#x00027;s adaptive ability, enabling its application in fields requiring high-precision solutions and flexibility in dealing with different data patterns. The main challenge lies in transforming the liver&#x00027;s detoxification function into a simplified mathematical model that effectively incorporates properties such as repetition, interaction, and adaptation to the data (Tan et al., <xref ref-type="bibr" rid="B60">2024</xref>). By comparing the proposed classifier with established ML classifiers, the study expects to improve the performance of ML, including increased computation speed, better handling of overfitting problems, and avoidance of excessive computational complexity. Additionally, this paper introduces a new concept for drawing inspiration from biological systems, opening up extensive opportunities for researchers to develop mathematical models based on other biological functions of the liver, such as filtering blood or amino acid regulation (Ishibashi et al., <xref ref-type="bibr" rid="B26">2009</xref>). Moreover, it represents a starting point for interdisciplinary applications combining biology, mathematics, and AI, enhancing our understanding of incorporating natural processes into ML techniques to create efficient, reliable, and intelligent systems.</p>
<p>The proposed ALC has been evaluated using a variety of commonly used ML datasets, including Wine, Breast Cancer Wisconsin, Iris Flower, MNIST, and Voice Gender (Hoffmann et al., <xref ref-type="bibr" rid="B25">2019</xref>), which are explained in detail in Section 4.1. This diversity in the datasets ensures extensive coverage of different data types, including text, images, and audio, and enables handling binary and multi-class classification problems (Seliya et al., <xref ref-type="bibr" rid="B57">2021</xref>; Parimala and Muneeswari, <xref ref-type="bibr" rid="B50">2023</xref>; Sidumo et al., <xref ref-type="bibr" rid="B58">2022</xref>). The purpose of using these datasets is to conduct comprehensive tests to assess the performance of the proposed ALC and compare it with the established classifiers. The originality and contributions that distinguish this research are as follows:</p>
<list list-type="order">
<list-item><p>Introducing a new classifier inspired by the liver&#x00027;s biological functions, specifically detoxification, highlighting new possibilities in designing effective classification algorithms based on biological behavior.</p></list-item>
<list-item><p>Enhancing the FOX to improve its performance, address existing limitations, and ensure better compatibility with the proposed ALC.</p></list-item>
<list-item><p>Relying on simple mathematical models that simulate the liver&#x00027;s biological interactions, ensuring a balance between design simplicity and high performance.</p></list-item>
<list-item><p>Opening new avenues for researchers to draw inspiration from human organ functions, such as the liver, and simulate them in computational ways to contribute innovative solutions for real-world challenges.</p></list-item>
<list-item><p>Testing the proposed ALC on diverse datasets demonstrates its effectiveness through experimental results and comparisons with established classifiers.</p></list-item>
</list>
<p>This paper is structured as follows: Section 2 reviews the literature that has attempted to address classification issues across various data types. Section 3 provides an analytical overview of the human liver, focusing on detoxification function and the study&#x00027;s motivation. Section 4 present the used materials and the proposed methodology, including the improvement of classifier design and FOX training algorithm. Sections 5,6 cover the presentation and analysis of results, including comparisons with previous works. Finally, the study concludes with findings, recommendations, limitations, and future research directions in Section 7.</p>
</sec>
<sec id="s2">
<title>2 Related works</title>
<p>This section reviews the standard algorithms used in ML classification, with their practical applications across various datasets highlighted (Sarker, <xref ref-type="bibr" rid="B54">2021</xref>). Additionally, recent studies in the field are discussed to identify existing challenges and to shed light on research gaps requiring further attention (Azevedo et al., <xref ref-type="bibr" rid="B7">2024</xref>). Accordingly, the extent to which the proposed classifier can offer practical solutions to these gaps and contribute to the future advancement of the field will be investigated. However, Xiao et al. utilized 12 standard ML classifiers on the MNIST dataset, demonstrating its suitability as a benchmark for evaluating the proposed ALC. Their results identified the Support Vector Classifier (SVC) with a polynomial kernel (C = 100) as the best-performing model, achieving an accuracy of 0.978 (Xiao et al., <xref ref-type="bibr" rid="B65">2017</xref>). This comparable result poses a challenge for the proposed ALC to surpass. Furthermore, the study (Cohen et al., <xref ref-type="bibr" rid="B11">2017</xref>) employed online pseudo-inverse update method (OPIUM) to classify the MNIST dataset, achieving an accuracy of 0.9590. However, the author noted that these results do not represent cutting-edge methods but rather serve as an instructive baseline and a means of validating the dataset. This makes it feasible to compare the performance of the proposed ALC against OPIUM, as surpassing this baseline would demonstrate an improvement over existing methods. On the other hand, in a comparative study by Cortez et al., three classifiers&#x02014;SVM, multiple regression (MR), and ANN&#x02014;were evaluated on the Wine dataset. The SVM model demonstrated superior performance, achieving accuracies of 0.8900 for red wine and 0.8600 for white wine, outperforming the other methods with an average accuracy of 0.8790 (Cortez et al., <xref ref-type="bibr" rid="B12">2009</xref>). Hence, the findings of Cortez et al. serve as a foundation for further advancements in ML applications, providing a basis for evaluating the proposed ALC.</p>
<p>Another study utilized a recursive recurrent neural network (RRNN) on Breast Cancer Wisconsin dataset. The results demonstrated that the proposed model achieved an accuracy of 0.9950 (Rajeswari and Sakthi Priya, <xref ref-type="bibr" rid="B53">2025</xref>). Despite its outstanding performance, the computational demands of RRNN require substantial resources, which may limit their applicability in resource-constrained environments. Moreover, the study (Fan et al., <xref ref-type="bibr" rid="B16">2024</xref>) presents a new classification model called CS3W-IFLMC. This model incorporates intuitionistic fuzzy (IF) and cost-sensitive three-way decisions (CS3WD) approaches, contributing to improved classification accuracy and reduced costs associated with incorrect decisions. The proposed model has been evaluated using 12 benchmark datasets, demonstrating superior performance compared to large margin distribution machine (LDM), FSVM, and SVM. However, the study remains limited in scope, as it focuses solely on binary classification tasks and does not extend to multi-class classification problems (Fan et al., <xref ref-type="bibr" rid="B16">2024</xref>). Furthermore, in another study, the researchers examined gender classification (male or female) based on voice data using multi-layer perceptron (MLP). The findings showed that the MLP model outperformed several other methods, including LR, classification and regression tree (CART), random forest (RF), and SVM. The MLP achieved a classification accuracy of 0.9675. This study concluded that the proposed model demonstrates strong discriminative power between genders, which enhances its applicability in auditory data classification tasks (Buyukyilmaz and Cibikdiken, <xref ref-type="bibr" rid="B10">2016</xref>).</p>
<p>The reviewed literature, highlights significant advancements in classification models, primarily focusing on improving performance and addressing computational challenges. However, several limitations and research gaps remain. One major issue is the reliance on computationally intensive methods, which can hinder applicability in resource-constrained environments. The absence of practical hyperparameter tuning or reduction mechanisms may also contribute to overfitting and computational inefficiencies. These limitations underscore the need for a new classifier to address such challenges. Hence, the proposed ALC should emphasize simplicity in design to ensure faster training time with lower cost.</p>
</sec>
<sec id="s3">
<title>3 Detoxification in liver and motivation</title>
<p>The liver, as illustrated in <xref ref-type="fig" rid="F1">Figure 1</xref>, is the largest internal organ in the human body and is vital in numerous complex physiological processes. It is located in the right upper quadrant of the abdominal cavity and consists of two primary lobes, the right and left, surrounded by a thin membrane known as the hepatic capsule (Moradi et al., <xref ref-type="bibr" rid="B44">2020</xref>). Internally, the liver is composed of microscopic units called hepatic lobules. These hexagonal structures contain hepatic cells organized around a central vein. The lobules are permeated by a network of hepatic sinusoids, which are small channels through which blood flows, facilitating the exchange of oxygen and nutrients between the blood and hepatic cells (Kennedy et al., <xref ref-type="bibr" rid="B31">2021</xref>). Furthermore, the liver receives blood from two sources, each contributing different functions. The oxygenated blood enters via the hepatic artery from the aorta, meeting the liver&#x00027;s energy demands. While, the portal vein delivers nutrient-rich and toxin-rich blood from the gastrointestinal tract and spleen (Schlegel et al., <xref ref-type="bibr" rid="B55">2023</xref>). The blood from both sources mixes in the hepatic sinusoids, allowing the hepatic cells to perform metabolic and regulatory functions efficiently (Gibert-Ramos et al., <xref ref-type="bibr" rid="B18">2021</xref>).</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Structural and functional organization of the liver: hepatic lobule and blood flow pathways, concept inspired by Nikmaneshi et al. (<xref ref-type="bibr" rid="B47">2020</xref>).</p></caption>
<alt-text>Illustration of the liver anatomy and lobule structure. The liver shows the hepatic vein, artery, portal vein, and gall bladder. A detailed view of a lobule displays the central vein, connective tissue, plates of hepatocytes, sinusoids, portal arteriole, portal venule, and bile duct. Arrows indicate blood flow direction from the portal vein to the lobule and from the central vein.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0001.tif"/>
</fig>
<p>However, detoxification is one of the most important liver&#x00027;s functions, which removes toxins from the bloodstream (Donati et al., <xref ref-type="bibr" rid="B13">2020</xref>). Detoxification occurs in two phases. In the phase I, hepatic enzymes known as cytochrome P450 chemically modify toxins through oxidation and reduction reactions, altering their structures to make them more reactive (Guengerich, <xref ref-type="bibr" rid="B21">2020</xref>). In the phase II, the modified compounds are conjugated with water-soluble molecules such as sulfates or glucuronic acid, making them easier to excrete (Sun and Schanze, <xref ref-type="bibr" rid="B59">2022</xref>). Finally, the toxins are either excreted via bile into the digestive tract or removed from the bloodstream by the kidneys (Zhang et al., <xref ref-type="bibr" rid="B67">2020</xref>).</p>
<p>The complex biochemical system of the liver has inspired us to develop a new ML classifier known as ALC, modeled after the liver&#x00027;s detoxification mechanisms. The design of the proposed ALC was guided by an in-depth understanding of the liver&#x00027;s two primary detoxification phases&#x02014;Cytochrome P450 enzymes and Conjugation pathways&#x02014;where toxins are transformed into excretable compounds. The proposed ALC classify feature vectors effectively with minimum training time by simulating these phases using simple ML and optimization methods. This innovation marks a significant step forward, demonstrating how biological systems can inspire advanced computational models. It particularly encourages researchers in computer science to explore biological processes for developing intelligent ML models.</p>
</sec>
<sec sec-type="materials and methods" id="s4">
<title>4 Materials and methods</title>
<p>This section presents the standard datasets employed for evaluating the proposed ALC in the conducted experiments. Additionally, the architecture of the proposed ALC is provided, including mathematical equations, algorithms, and flowcharts. Furthermore, the section elaborates on the FOX, which serves as the learning algorithm for the proposed ALC, highlighting its improvements.</p>
<sec>
<title>4.1 Materials</title>
<p>The following datasets are widely used by ML researchers to evaluate their work, making these benchmark datasets suitable for this paper. The MNIST dataset comprises 70,000 grayscale images of handwritten digits (0&#x02013;9), each of size 28 &#x000D7; 28 pixels. It is widely used for multi-class classification tasks due to its diversity and large size (Elizabeth Rani et al., <xref ref-type="bibr" rid="B15">2022</xref>). To utilize the MNIST dataset with the proposed ALC, each image was preprocessed by flattening it to a vector of 784 dimensions. Each pixel was normalized, with its value transformed to have zero mean and unit variance to ensure consistent scaling. This was then followed by the use of linear discriminant analysis (LDA) to project or reduce the data into a low-dimensional space. Hence, LDA reduces each image to a nine-dimensional feature vector to effectively capture the most discriminative features while also reducing computational requirements (Lasalvia et al., <xref ref-type="bibr" rid="B39">2022</xref>). Additionally, the Iris dataset, a small-scale collection containing 150 instances across three classes with four features per instance, was included in the proposed ALC evaluation (Goyal et al., <xref ref-type="bibr" rid="B19">2021</xref>; Oladejo et al., <xref ref-type="bibr" rid="B48">2024</xref>; Kumar et al., <xref ref-type="bibr" rid="B37">2024</xref>). The Breast Cancer Wisconsin dataset, a binary dataset containing 569 samples with 30 features each, was employed to assess the proposed ALC&#x00027;s performance on high-dimensional data (Alshayeji et al., <xref ref-type="bibr" rid="B4">2022</xref>; Rajeswari and Sakthi Priya, <xref ref-type="bibr" rid="B53">2025</xref>). Furthermore, the Wine dataset, consisting of 178 samples across three classes with 13 features per instance, was selected for its multi-class nature (Oladejo et al., <xref ref-type="bibr" rid="B48">2024</xref>; Waheed and Humaidi, <xref ref-type="bibr" rid="B62">2023</xref>). Finally, the Voice Gender dataset was employed to ensure feature diversity. This dataset comprises 3,168 samples, each defined by 21 acoustic features, aimed at distinguishing gender (male or female) by leveraging unique vocal characteristics (Buyukyilmaz and Cibikdiken, <xref ref-type="bibr" rid="B10">2016</xref>). These datasets collectively provided a diverse range of classification challenges, enabling a comprehensive evaluation of the proposed ALC&#x00027;s performance.</p>
</sec>
<sec>
<title>4.2 Methods</title>
<p>This section begins with a detailed introduction to the architecture of the proposed ALC. Moreover, it delves into the improvements made to the FOX as a learning algorithm, highlighting its key modifications.</p>
<sec>
<title>4.2.1 Artificial liver classifier</title>
<p>As explained earlier in Section 3, the detoxification process involves the liver&#x00027;s ability to process toxins. Oxygenated blood enters the liver via the hepatic artery, while nutrient-rich blood flows through the portal vein. These sources mix within the hepatic sinusoids, enabling hepatic cells to perform essential functions, including a detoxification function that comprises two phases.</p>
<p>In order to model the detoxification process in the liver, a biologically inspired computational model was chosen to be implemented, where every mathematical operation is merely treated as a simplistic representation of various known mechanisms regarding hepatic detoxification (Donati et al., <xref ref-type="bibr" rid="B13">2020</xref>). The major biochemical steps taken by hepatocytes in the elimination process are considered to include detoxification in two phases: oxidation (Phase I), which is carried out by specialized enzymes and cofactors, and conjugation (Phase II), which is also supported by specific enzymes and cofactors (Sun and Schanze, <xref ref-type="bibr" rid="B59">2022</xref>; Guengerich, <xref ref-type="bibr" rid="B21">2020</xref>). In this formulation, these steps are coordinated by being transformed into operations in matrices. A set of molecular input toxins is first linearly overlaid by a cofactor matrix <italic>C</italic> to model the oxidation action of cytochrome P450, followed by being passed through a non-linear activation grid to model metabolite selection at a threshold. The second transformation is modeled in the form of conjugation through the interaction of vitamins, and this is subsequently normalized through the use of softmax to represent the classification of detoxified products. Although these operations are not intended to accurately reproduce the actual biochemical kinetics, they are carefully selected so that the structural and functional analogies are preserved&#x02014;allowing the multi-staged, enzyme-driven, and spatially distributed nature of detoxification to be reproduced within a mathematically consistent and learnable system.</p>
<p>Phase I: toxins are chemically modified to become more reactive. This phase is mathematically simulated by the following equation:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>A</italic><sub><italic>ji</italic></sub> is the matrix of reactive toxins, <italic>X</italic> is the input toxins matrix and <italic>n</italic> is the number of inputs. The <italic>C</italic> is initialized randomly within the range [&#x02212;1, 1] and has dimensions (<italic>f, p</italic>), where <italic>f</italic> corresponds to the number of features in the input feature vector, and <italic>p</italic> is the number of lobules. The term <inline-formula><mml:math id="M2"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:mfrac><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:munderover><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the mean of all elements in the cofactor matrix <italic>C</italic> that used to balance the reaction.</p>
<p>A human liver has a very large number of microscopic functional unit called lobules which are estimated to be of around 100,000 (Krebs et al., <xref ref-type="bibr" rid="B36">2007</xref>). In our model the parameter <italic>p</italic> is an abstraction of a range of choice in lobular diversity, and the columns of the cofactor matrix <italic>C</italic> implement the various simulated lobular processing units. This structure allows introducing a spatial heterogeneity and an enzymatic variation, which can be witnessed in hepatic tissue, as part of the model. Although the biological premise of <italic>p</italic> can be that of a number of lobules, direct insertion of a figure like <italic>p</italic> &#x0003D; 100, 000 in computation would be inefficient and also inconvenient because it has a high dimensionality and costs more computations. Thus, we introduce a practical range <italic>f</italic> &#x02264; <italic>p</italic> &#x0003C; 100, 000. This will ensure there is diversity, and that every input feature interacts with a number of simulated lobules ensuring the model is computationally straightforward. The parameter <italic>p</italic> in this range may be chosen by empirical methods of hyperparameter tuning, a compromise between the richness of the representation, and efficiency. It follows that the range is not arbitrary, but rather biological based on biological modeling under constrains. However, the reactive toxins (<italic>A</italic>) must be activated to enhance their reactivity before progressing to phase II. This activation involves eliminating all negative values, effectively transforming them to zero while retaining only the positive values. This process is mathematically expressed by the following equation:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mtext>max</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>A</italic>&#x02032; is the activated toxins matrix. However, <xref ref-type="disp-formula" rid="E2">Equation 2</xref> uses ReLU activation to imitate the biological selectivity that occurs in Phase I detoxification in which only reactive (positive) products pass to the next stage. This selection eliminates the non-reactive outputs keeps the computational efficiency and provides the non-linearity necessary in the downstream processing.</p>
<p>Phase II: involves the conjugation of modified compounds from phase I with water-soluble molecules to make them excretable. This phase reduces the toxicity of compounds and facilitates their elimination from the body. this phase can be mathematically modeled using <xref ref-type="disp-formula" rid="E1">Equation 1</xref>, but with key differences. Instead of toxins, the matrix <italic>A</italic>&#x02032; is used as input, representing the modified compounds (activated toxins) generated in phase I. Additionally, a matrix referred to as the vitamin matrix <italic>V</italic> is employed in place of the cofactor matrix <italic>C</italic>. This matrix is initialized randomly within the range [&#x02212;1, 1] and has dimensions (<italic>p, n</italic>).</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>B</italic><sub><italic>ji</italic></sub> represents the conjugated compounds and <inline-formula><mml:math id="M5"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:munderover><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the mean of all elements in the vitamin matrix <italic>V</italic>.</p>
<p>Lastly, when the reactions in Phase I and Phase II are finished, detoxification is then complete. The outcome is some less dangerous and water-soluble wastes that can be removed by means of bile, urine, stool, etc. The softmax activation function is used as a model of the elimination process: not only does it allow formulating a probabilistic output for each of the classes, but also captures the selective and competitive characteristic of biological excretion (Bridle, <xref ref-type="bibr" rid="B9">1990</xref>; Arora et al., <xref ref-type="bibr" rid="B5">2020</xref>; Maharjan et al., <xref ref-type="bibr" rid="B41">2020</xref>). Many detoxified compounds simultaneously compete to be eliminated in the liver depending on issues such as solvency, the availability of transporters as well as priorities at the cellular level. Softmax reflects this behavior by placing higher probabilities on those compounds that are most dominant, or easily excreted, and thereby simulates the preferential clearance mechanism of the body.</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:msubsup><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:mstyle><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the normalized probability for output class <italic>i</italic>.</p>
<p>The <xref ref-type="table" rid="T11">Algorithm 1</xref> and <xref ref-type="fig" rid="F2">Figure 2</xref> describes the architecture of the proposed ALC. First, the cofactor and vitamin matrices are initialized randomly, where these matrices are defined based on the dimensions corresponding to the number of features (<italic>f</italic>), number of lobules (<italic>p</italic>), and number of output classes (<italic>n</italic>). Next, the IFOX, as presented in <xref ref-type="table" rid="T12">Algorithm 2</xref>, is configured, specifying the number of detoxification cycles (maximum number of training epochs) and detoxification power (maximum number of fox agents). The IFOX then optimizes the cofactor and vitamin matrices by minimizing the reaction error (i.e., loss). Finally, the optimized cofactor and vitamin matrices, resulting from this process, are subsequently used together with the toxin inputs (feature vectors) to predict the output classes.</p>
<table-wrap position="float" id="T11">
<label>Algorithm 1</label>
<caption><p>Artificial liver classifier (ALC).</p></caption>
<table frame="lhs" rules="none">
<tbody>
<tr>
<td align="left" valign="top"><monospace>&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>Input</bold>: toxins, number of features, number of lobules <italic>p</italic>, number of outputs, detoxification cycles, and detoxification power.</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>Output</bold>: predicted classes.</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>1: &#x000A0;Initialize cofactor matrix <italic>C</italic> and vitamin matrix <italic>V</italic> randomly.</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>2: &#x000A0;Initialize the IFOX training algorithm.&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x022B3; See Algorithm 2</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>3: &#x000A0;Optimize <italic>C</italic> and <italic>V</italic> using IFOX over defined cycles.</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>4: &#x000A0;Compute reactive toxins.&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x022B3; using <xref ref-type="disp-formula" rid="E1">Equation 1</xref></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>5: &#x000A0;Activate reactive toxins.&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x022B3; Phase I, using <xref ref-type="disp-formula" rid="E2">Equation 2</xref></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>6: &#x000A0;Perform conjugation to make toxins less harmful. &#x022B3; Phase II, using <xref ref-type="disp-formula" rid="E3">Equation 3</xref></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>7: &#x000A0;Normalize outputs to obtain predicted classes.&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x022B3; Elimination, using <xref ref-type="disp-formula" rid="E4">Equation 4</xref></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>8: &#x000A0;return predicted classes &#x00177;.</monospace></td></tr>
</tbody>
</table>
</table-wrap>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Architecture illustrating Phase I and Phase II reactions simulated by the proposed ALC, designed to mimic liver detoxification pathways.</p></caption>
<alt-text>Diagram illustrating the detoxification process in the human liver. It shows Phase I and Phase II reactions. In Phase I, cofactors interact with toxins. In Phase II, vitamins facilitate further reactions. The cycle starts with toxins and ends with waste products, showing detoxification.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0002.tif"/>
</fig>
<table-wrap position="float" id="T12">
<label>Algorithm 2</label>
<caption><p>IFOX: new variation of FOX optimization algorithm.</p></caption>
<table frame="lhs" rules="none">
<tbody>
<tr>
<td align="left" valign="top"><monospace>&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>Input</bold>: Maximum number of epochs <italic>epochs</italic>, maximum number of fox agents <italic>max</italic><sub><italic>fa</italic></sub></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>Output</bold>: <italic>BestX</italic> and <italic>BestFitness</italic></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>1: &#x000A0;Initialize the fox agents population <italic>X</italic><sub><italic>fa</italic></sub> (<italic>fa</italic> &#x0003D; 1, 2, 3, ..., <italic>max</italic><sub><italic>fa</italic></sub>)</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>2: &#x000A0;Initialize <italic>BestX, BestFitness</italic></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>3: &#x000A0;<bold>while</bold> <italic>it</italic> &#x0003C; <italic>epochs</italic> <bold>do</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>4: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>for all</bold> <inline-formula><mml:math id="M14"><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow><mml:mi>A</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> <bold>do</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>5: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>f</italic>&#x02190;Fitness(<italic>X</italic><sub><italic>fa</italic></sub>)</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>6: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>if</bold> <italic>f</italic> &#x0003C; <italic>BestFitness</italic> <bold>then</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>7: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>BestFitness</italic> &#x02190; <italic>f</italic></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>8: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>BestX</italic> &#x02190; <italic>X</italic><sub><italic>fa</italic></sub></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>9: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>end if</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>10: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>end for</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>11: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <inline-formula><mml:math id="M15"><mml:msub><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02190;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:math></inline-formula></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>12: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; &#x003B1;&#x02190;&#x003B1;<sub><italic>min</italic></sub> &#x0002B; (1 &#x02212; &#x003B1;<sub><italic>min</italic></sub>) &#x000D7; (1 &#x02212; <italic>it</italic>/<italic>epochs</italic>)</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>13: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>t</italic>&#x02190;0.5 &#x000D7; &#x003BC;(rand(0, 1, size(<italic>BestX</italic>)))</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>14: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>Jump</italic>&#x02190;4.905 &#x000D7; <italic>t</italic><sup>2</sup></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>15: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>for all</bold> <inline-formula><mml:math id="M16"><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow><mml:mi>A</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> <bold>do</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>16: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; &#x003B2;&#x02190;rand(&#x02212;&#x003B1;, &#x003B1;, size(<italic>BestX</italic>))</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>17: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>if</bold> rand(0, 1) &#x0003C; &#x003B1; <bold>then</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>18: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>X</italic><sub><italic>fa</italic></sub> &#x02190; <italic>BestX</italic> &#x0002B; &#x003B2; &#x000D7; &#x003B1;</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>19: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>else</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>20: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <inline-formula><mml:math id="M17"><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02190;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mi>B</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>X</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x003B2;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mi>J</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:mfrac></mml:math></inline-formula></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>21: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>end if</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>22: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <bold>end for</bold></monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>23: &#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0; <italic>it</italic> &#x02190; <italic>it</italic> &#x0002B; 1</monospace></td>
</tr>
<tr>
<td align="left" valign="top"><monospace>24: &#x000A0;<bold>end while</bold></monospace></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Furthermore, the flowchart visualized the proposed ALC is presented in <xref ref-type="fig" rid="F3">Figure 3</xref>. Additionally, the source code for the implementation of the proposed ALC can be accessed at the following repository: <ext-link ext-link-type="uri" xlink:href="https://github.com/mwdx93/alc">https://github.com/mwdx93/alc</ext-link>, which includes the main ALC implementation, training scripts, and example datasets.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Flowchart of the proposed ALC.</p></caption>
<alt-text>Flowchart of a detoxification algorithm. It begins with initializing a feature vector, cofactor, vitamin, and detoxification cycles. It splits into two processes: optimizing cofactor and vitamin via a training algorithm, and detoxification reaction in two phases using equations. The cycle checks if the maximum detoxification cycle is reached. If not, it loops back; if yes, it predicts the output and ends.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0003.tif"/>
</fig>
</sec>
<sec>
<title>4.2.2 Training algorithm</title>
<p>The FOX, developed by Mohammed and Rashid in 2022, mimics the hunting behavior of red foxes by incorporating physics-based principles. These include prey detection based on sound and distance, agent&#x00027;s jumping during the attack governed by gravity, and direction, as well as additional computations such as timing and walking (Mohammed and Rashid, <xref ref-type="bibr" rid="B42">2022</xref>; Jumaah et al., <xref ref-type="bibr" rid="B29">2024</xref>). These features make FOX a competitive optimization algorithm, outperformed several methods such as particle swarm optimization (PSO) and fitness dependent optimizer (FDO). The FOX is works as follows: Initially, the ground is covered with snow, requiring the fox agent to search randomly for its prey. During this random search, the fox agent uses the Doppler effect to detect and gradually approach the source of the sound. This process takes time and enables the fox agent to estimate the prey&#x00027;s location by calculating the distance. Once the prey&#x00027;s position is determined, the fox agent computes the required jump to catch it. Additionally, the search process is facilitated through controlled random walks, ensuring the fox agent progresses toward the prey while maintaining an element of randomness. The FOX balances exploitation and exploration phases statically, with a 50% probability for each (Aula and Rashid, <xref ref-type="bibr" rid="B6">2025</xref>). Thus, the FOX operates as follows:</p>
<list list-type="order">
<list-item><p>Computing the distance <italic>D</italic><sub><italic>i</italic></sub> of sound travel using the best position and random time:</p>
<p><disp-formula id="E5"><label>(5)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>B</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>P</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Where <italic>T</italic><sub><italic>i</italic></sub> is a random time in [0, 1] and <italic>i</italic> is the fox agent.</p></list-item>
<list-item><p>Determining the distance between the fox agent and its prey:</p>
<p><disp-formula id="E6"><label>(6)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>D</mml:mi><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
<list-item><p>Computing the jump <italic>J</italic><sub><italic>i</italic></sub> by multiplying half of the gravity acceleration constant with half squared mean of the time:</p>
<p><disp-formula id="E7"><label>(7)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>J</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mn>9</mml:mn><mml:mo>.</mml:mo><mml:mn>81</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
<list-item><p>Updating the fox agent&#x00027;s position based on a directional equation, either northward <italic>c</italic><sub>1</sub> &#x0003D; 0.18 or in the opposite direction <italic>c</italic><sub>2</sub> &#x0003D; 0.82 based on the the jump probability <italic>p</italic> in [0, 1].</p>
<p><disp-formula id="E8"><label>(8)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>J</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left" style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mtext class="textrm" mathvariant="normal">if&#x000A0;</mml:mtext><mml:mi>p</mml:mi><mml:mo>&#x0003E;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>18</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mtext class="textrm" mathvariant="normal">otherwise</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
<list-item><p>The following equation used for exploration:</p>
<p><disp-formula id="E9"><label>(9)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>B</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>P</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>a</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>where <italic>dim</italic> is the problem dimension, <italic>Mint</italic> is the minimum time iteratively updated based on <italic>T</italic><sub><italic>i</italic></sub>, <italic>a</italic> is an adjustment parameter computed as: <inline-formula><mml:math id="M13"><mml:mn>2</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, and <italic>it</italic> is the current iteration.</p></list-item>
</list>
<p>However, the FOX has some limitations in its design. These limitations were acknowledged by the author of FOX (Mohammed and Rashid, <xref ref-type="bibr" rid="B42">2022</xref>), while others have been identified through further analysis. For instance, one notable drawback is its static approach to balancing exploration and exploitation. This paper aims to address these limitations by proposing a new variation of the FOX called IFOX to make it integrable with the proposed ALC as a training algorithm to optimize the cofactor and vitamin matrices. For reference, the implementation of the FOX can be accessed at <ext-link ext-link-type="uri" xlink:href="https://github.com/hardi-mohammed/fox">https://github.com/hardi-mohammed/fox</ext-link>.</p>
<p>The IFOX, as visualized in <xref ref-type="table" rid="T12">Algorithm 2</xref>, incorporates several improvements over the FOX. First, it transforms the balance between exploitation and exploration into a dynamic process using the &#x003F5;-greedy method, rather than a static approach (Liu et al., <xref ref-type="bibr" rid="B40">2020</xref>; Abdalrdha et al., <xref ref-type="bibr" rid="B1">2023</xref>). This dynamic adjustment is controlled by the parameter &#x003B1;, which decreases progressively as the optimization process iterate. Second, the computation of distances is eliminated in favor of directly using the best position, facilitated by the parameter &#x003B2;, derived from &#x003B1;. This modification simplifies the FOX by removing <xref ref-type="disp-formula" rid="E5">Equations 5</xref>, <xref ref-type="disp-formula" rid="E6">6</xref>, and simplifying <xref ref-type="disp-formula" rid="E8">Equations 8</xref> by eliminating the probability parameter <italic>p</italic> and the directional variables (<italic>c</italic><sub>1</sub> and <italic>c</italic><sub>2</sub>). Third, in <xref ref-type="disp-formula" rid="E9">Equations 9</xref>, the variables <italic>a</italic> and <italic>Mint</italic> are excluded.</p>
</sec>
</sec>
</sec>
<sec sec-type="results" id="s5">
<title>5 Results</title>
<p>This section presents the performance results of the proposed ALC on multiple benchmark datasets, as described in Section 4.1. The experimental parameter settings were configured for each dataset as follows: 500 detoxification cycles, a detoxification power of 10, and dataset-specific numbers of lobules. Specifically, the number of lobules was set to 10 for Iris Flower and Breast Cancer Wisconsin, 15 for Wine and Voice Gender, and 50 for MNIST. The choice of these values was done through a systematic empirical search, where a predetermined set of possible values has been considered, a validation based approach used. Different values of <italic>p</italic> were searched over each dataset and the value that provided the maximum average classification accuracy on a held-out validation split was selected. This strategy makes sure that the hyperparameters being chosen are tuned in a reproducible and performance-based fashion. In order to have an efficient and fair assessment on the performance of the models, cross-validation was used on the basis of <italic>k</italic>. In particular, each of the datasets has been split into <italic>k</italic> equal size folds (10-folds were used in our experiments), and the test has been repeated on every fold. Mean results of each of the runs were used to compute final performance metrics. To facilitate later comparison and analysis, additional classifiers, including MLP, SVM, LR, and XGBoost (XGB), were executed on the same datasets. However, all experiments were conducted on an MSI GL63 8RD laptop equipped with an Intel<sup>&#x000AE;</sup> Core&#x02122; i7-8750H &#x000D7; 12 processor and 32 GB of memory. This consistent setup ensured a robust evaluation of the proposed ALC alongside the other classifiers under the same conditions.</p>
<sec>
<title>5.1 Performance metrics</title>
<p>To evaluate the performance of the proposed ALC, several metrics were employed, including log loss (cross-entropy loss), accuracy, precision, recall, F1-score, and training time. Initially, Log loss (<xref ref-type="disp-formula" rid="E10">Equation 10</xref>) quantifies the divergence between predicted probabilities and actual labels, where lower values indicate better predictive performance (Xue et al., <xref ref-type="bibr" rid="B66">2023</xref>). The accuracy (<xref ref-type="disp-formula" rid="E11">Equation 11</xref>) measures the proportion of correctly classified instances, serving as a straightforward indicator of overall correctness. Moreover, precision (<xref ref-type="disp-formula" rid="E12">Equation 12</xref>) evaluates the proportion of true positives among all positive predictions, emphasizing the model&#x00027;s ability to reduce false positives. In contrast, recall <xref ref-type="disp-formula" rid="E13">Equation 13</xref> focuses on the proportion of true positives among all actual positive instances, highlighting the importance of minimizing false negatives. Furthermore, the F1-score (<xref ref-type="disp-formula" rid="E14">Equation 14</xref>), as the harmonic mean of precision and recall, provides a balanced assessment when class distributions are imbalanced (Naidu et al., <xref ref-type="bibr" rid="B46">2023</xref>). Moreover, the overfitting gap defined as the difference between training and validation accuracy, provides insights into generalization. A smaller value indicate better generalization, while a larger value indicates overfitting, where the model excels on the training set but struggles with unseen data. Finally, the training time reflects the duration required to train the model, offering insight into its computational efficiency.</p>
<disp-formula id="E10"><label>(10)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>c</mml:mi><mml:mtext class="textrm" mathvariant="normal">Log Loss</mml:mtext><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x00177;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x00177;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E11"><label>(11)</label><mml:math id="M19"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Accuracy</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E12"><label>(12)</label><mml:math id="M20"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E13"><label>(13)</label><mml:math id="M21"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Recall</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E14"><label>(14)</label><mml:math id="M22"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">F1-Score</mml:mtext><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Recall</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Precision</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Recall</mml:mtext></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where TP, TN, FP, and FN represent the true positive, true negative, false positive, and false negative counts, respectively. Additionally, <italic>y</italic> denotes the actual labels, while &#x00177; represents the predicted labels.</p>
</sec>
<sec>
<title>5.2 Convergence result of the training algorithm IFOX</title>
<p><xref ref-type="table" rid="T1">Table 1</xref> provides the empirical result of the convergence behavior of IFOX based on selected benchmark functions of the CEC2019 suite. Unlike the original FOX, IFOX invariably reaches lower average objective values in most of the test functions, with vastly less variance and greater stability, especially on high-dimensional and multimodal functions like F3 through F7. Furthermore, four recent and competitive optimizers were added to the test in order to prove the effectiveness of IFOX over its predecessor. They consist of GOOSE, ant nesting algorithm (ANA), lagrange elementary optimization (LEO), and FDO, which have shown rather good performance in the literature (Hamad and Rashid, <xref ref-type="bibr" rid="B23">2024</xref>; Hama Rashid et al., <xref ref-type="bibr" rid="B22">2021</xref>; Aladdin and Rashid, <xref ref-type="bibr" rid="B3">2025</xref>; Abdullah and Ahmed, <xref ref-type="bibr" rid="B2">2019</xref>). The relative performance assures that IFOX attains better convergence characteristics and final solution quality most of the time. Moreover, the gain noticed in performance increase is explained based on adding adaptive inertia control and better search dynamics in IFOX. It is a design that puts an emphasis on more extensive exploration during the initial phases and more targeted exploitation as optimization goes on. Additionally, convergence curves in <xref ref-type="fig" rid="F4">Figure 4</xref> demonstrate that IFOX converges more rapidly compared to the original FOX and, in addition, obtains better final values. This can be seen by the fact that the fitness trajectory flattened very fast as compared to other methods. Although formal theoretical demonstration of convergence is outside the scope of this paper, the similar results in independent runs (30 runs) give good evidence of the soundness and reliability of IFOX in varied and different optimization landscapes.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Comparison of best objective values obtained by the proposed IFOX algorithm across selected CEC2019 benchmark functions over 30 independent runs.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Function/optimizer</bold></th>
<th valign="top" align="center"><bold>F1</bold></th>
<th valign="top" align="center"><bold>F2</bold></th>
<th valign="top" align="center"><bold>F3</bold></th>
<th valign="top" align="center"><bold>F4</bold></th>
<th valign="top" align="center"><bold>F5</bold></th>
<th valign="top" align="center"><bold>F6</bold></th>
<th valign="top" align="center"><bold>F7</bold></th>
<th valign="top" align="center"><bold>F8</bold></th>
<th valign="top" align="center"><bold>F9</bold></th>
<th valign="top" align="center"><bold>F10</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">GOOSE</td>
<td valign="top" align="center">1.8E12</td>
<td valign="top" align="center">6.8E3</td>
<td valign="top" align="center">13.70</td>
<td valign="top" align="center">1.60E3</td>
<td valign="top" align="center">6.09</td>
<td valign="top" align="center">4.79</td>
<td valign="top" align="center">274.35</td>
<td valign="top" align="center">5.57</td>
<td valign="top" align="center">3.81</td>
<td valign="top" align="center">20.98</td>
</tr> <tr>
<td valign="top" align="left">ANA</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">13.70</td>
<td valign="top" align="center">38.50</td>
<td valign="top" align="center">1.22</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">116.59</td>
<td valign="top" align="center">5.47</td>
<td valign="top" align="center">2.00</td>
<td valign="top" align="center">2.71</td>
</tr> <tr>
<td valign="top" align="left">LEO</td>
<td valign="top" align="center">7.3E9</td>
<td valign="top" align="center">17.47</td>
<td valign="top" align="center">12.70</td>
<td valign="top" align="center">69.86</td>
<td valign="top" align="center">2.76</td>
<td valign="top" align="center">3.01</td>
<td valign="top" align="center">195.56</td>
<td valign="top" align="center">5.06</td>
<td valign="top" align="center">3.26</td>
<td valign="top" align="center">20.01</td>
</tr> <tr>
<td valign="top" align="left">FDO</td>
<td valign="top" align="center">4585.27</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">13.7</td>
<td valign="top" align="center">34.08</td>
<td valign="top" align="center">2.13</td>
<td valign="top" align="center">12.13</td>
<td valign="top" align="center">120.40</td>
<td valign="top" align="center">6.1</td>
<td valign="top" align="center">2.01</td>
<td valign="top" align="center">2.71</td>
</tr> <tr>
<td valign="top" align="left">FOX</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">4.72</td>
<td valign="top" align="center">9.88</td>
<td valign="top" align="center">147.21</td>
<td valign="top" align="center">5.13</td>
<td valign="top" align="center">298.10</td>
<td valign="top" align="center">1.017</td>
<td valign="top" align="center">1.38</td>
<td valign="top" align="center">1.41</td>
<td valign="top" align="center">21.49</td>
</tr> <tr>
<td valign="top" align="left">IFOX</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">4.61</td>
<td valign="top" align="center">2.42</td>
<td valign="top" align="center">35.80</td>
<td valign="top" align="center">1.88</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.24</td>
<td valign="top" align="center">1.33</td>
<td valign="top" align="center">20.99</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The results are compared with those of FOX and several recent optimization algorithms. Lower objective values indicate better performance.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Convergence performance curve of the FOX (blue) and IFOX (red) on the CEC2019 benchmark test functions. Lower fitness values indicate better convergence performance.</p></caption>
<alt-text>Ten line graphs depict fitness over iterations for functions F1 to F10. Blue lines represent FOX, and red lines represent IFOX. Most graphs show IFOX converging faster with lower fitness values compared to FOX.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0004.tif"/>
</fig>
<p>In order to compare performance on the whole, each optimization algorithm was ranked by the number of functions with the best objective value. The overall and the average ranking of all functions is given in <xref ref-type="table" rid="T2">Table 2</xref>. IFOX presented a minimum total (18) and average (1.8) rank and maintained a better performance as compared to the rest of the optimization algorithms. Due to IFOX&#x00027;s superior convergence and stability, it was chosen as the training algorithm in this study.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Function-wise ranks, total rank, and average rank for each optimization algorithm across the 10 selected CEC2019 benchmark functions.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Function/optimizer</bold></th>
<th valign="top" align="center"><bold>F1</bold></th>
<th valign="top" align="center"><bold>F2</bold></th>
<th valign="top" align="center"><bold>F3</bold></th>
<th valign="top" align="center"><bold>F4</bold></th>
<th valign="top" align="center"><bold>F5</bold></th>
<th valign="top" align="center"><bold>F6</bold></th>
<th valign="top" align="center"><bold>F7</bold></th>
<th valign="top" align="center"><bold>F8</bold></th>
<th valign="top" align="center"><bold>F9</bold></th>
<th valign="top" align="center"><bold>F10</bold></th>
<th valign="top" align="center"><bold>Total rank</bold></th>
<th valign="top" align="center"><bold>Avg. rank</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">IFOX</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">18</td>
<td valign="top" align="center">1.8</td>
</tr> <tr>
<td valign="top" align="left">FDO</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">31</td>
<td valign="top" align="center">3.1</td>
</tr> <tr>
<td valign="top" align="left">ANA</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">3.2</td>
</tr> <tr>
<td valign="top" align="left">FOX</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">34</td>
<td valign="top" align="center">3.4</td>
</tr> <tr>
<td valign="top" align="left">LEO</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">38</td>
<td valign="top" align="center">3.8</td>
</tr> <tr>
<td valign="top" align="left">GOOSE</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">52</td>
<td valign="top" align="center">5.2</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>Lower ranks indicate better performance.</p>
</table-wrap-foot>
</table-wrap>
</sec>
<sec>
<title>5.3 Experimental results of ALC</title>
<p>The performance results of the proposed ALC are presents through this subsection, summarized in the figures and tables. Additionally, comparisons with other classifiers, including MLP, SVM, LR, and XGB, have been conducted on the five datasets described in Section 4.1. <xref ref-type="table" rid="T3">Table 3</xref> presents the performance results of the proposed ALC and other classifiers on the Iris Flower dataset. Additionally, <xref ref-type="fig" rid="F5">Figures 5a</xref>, <xref ref-type="fig" rid="F5">b</xref> show the loss and accuracy, respectively, across the validation folds. The proposed ALC achieved 100% accuracy with a loss of 0.0169, an overfitting gap of &#x02212;0.0231%, and a training time of 2.12 s. The XGB also achieved 100% accuracy with a loss of 0.0085, an overfitting gap of &#x02212;0.0144%, and a training time of 0.91 s. Similarly, the SVM reached 100% accuracy with a loss of 0.0704, an overfitting gap of &#x02212;0.0384%, and a training time of 4.42 s. The MLP attained 96.67% accuracy with a loss of 0.2417, an overfitting gap of &#x02212;0.0714%, and a training time of 4.18 s. Lastly, the LR reached 100% accuracy with a loss of 0.0543, an overfitting gap of &#x02212;0.0415%, and a training time of 4.31 s.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Cross-validation performance of the proposed ALC and other classifiers on the Iris Flower dataset (mean over 10-folds).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Metric</bold></th>
<th valign="top" align="center"><bold>ALC</bold></th>
<th valign="top" align="center"><bold>XGB</bold></th>
<th valign="top" align="center"><bold>SVM</bold></th>
<th valign="top" align="center"><bold>MLP</bold></th>
<th valign="top" align="center"><bold>LR</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Loss</td>
<td valign="top" align="center">0.0169</td>
<td valign="top" align="center">0.0085</td>
<td valign="top" align="center">0.0691</td>
<td valign="top" align="center">0.2417</td>
<td valign="top" align="center">0.0543</td>
</tr> <tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9667</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Precision</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9694</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Recall</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9667</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">F1-Score</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9664</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Overfitting</td>
<td valign="top" align="center">-0.0231%</td>
<td valign="top" align="center">-0.0144%</td>
<td valign="top" align="center">-0.0384%</td>
<td valign="top" align="center">-0.0689%</td>
<td valign="top" align="center">-0.0415%</td>
</tr> <tr>
<td valign="top" align="left">Time (sec.)</td>
<td valign="top" align="center">2.12</td>
<td valign="top" align="center">0.91</td>
<td valign="top" align="center">4.42</td>
<td valign="top" align="center">4.18</td>
<td valign="top" align="center">4.31</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Performance results comparison of the proposed ALC (blue) with other classifiers on the validation set of the Iris dataset. <bold>(a)</bold> Shows the log loss values, and <bold>(b)</bold> shows accuracy.</p></caption>
<alt-text>Two line graphs compare machine learning models on the Iris dataset. The left graph shows log loss decreasing over 500 detoxification cycles, using models ALC, XGB, SVM, MLP, and LR with MLP having the highest initial loss. The right graph shows accuracy improving over the same cycles, with all models approaching high accuracy, especially LR and SVM.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0005.tif"/>
</fig>
<p><xref ref-type="table" rid="T4">Table 4</xref> presents the performance results of the proposed ALC and other classifiers on the Breast Cancer Wisconsin dataset. <xref ref-type="fig" rid="F6">Figures 6a</xref>, <xref ref-type="fig" rid="F6">b</xref> display the loss and accuracy, respectively, on the validation folds. The proposed ALC achieved 99.12% accuracy, with a loss of 0.0261 and an overfitting gap of -0.0029%, with a training time of 3.62 s. The XGB achieved 88.36% accuracy, with a loss of 0.1132 and an overfitting gap of 0.1178%, with a training time of 1.09 s. The SVM reached 98.25% accuracy, with a loss of 0.1105 and an overfitting gap of 0.0213%, with a training time of 3.79 s. The MLP achieved 98.25% accuracy, with a loss of 0.0682 and an overfitting gap of 0.0086%, with a training time of 4.53 s. Lastly, the LR achieved 96.49% accuracy, with a loss of 0.1319 and an overfitting gap of 0.0237%, with a training time of 3.81 s.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Cross-validation performance of the proposed ALC and other classifiers on the Breast Cancer Wisconsin dataset (mean over 10-folds).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Metric</bold></th>
<th valign="top" align="center"><bold>ALC</bold></th>
<th valign="top" align="center"><bold>XGB</bold></th>
<th valign="top" align="center"><bold>SVM</bold></th>
<th valign="top" align="center"><bold>MLP</bold></th>
<th valign="top" align="center"><bold>LR</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Loss</td>
<td valign="top" align="center">0.0261</td>
<td valign="top" align="center">0.1132</td>
<td valign="top" align="center">0.1203</td>
<td valign="top" align="center">0.0682</td>
<td valign="top" align="center">0.1319</td>
</tr> <tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="center">0.8927</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9559</td>
</tr> <tr>
<td valign="top" align="left">Precision</td>
<td valign="top" align="center">0.9943</td>
<td valign="top" align="center">0.9233</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9638</td>
</tr> <tr>
<td valign="top" align="left">Recall</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="center">0.9233</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9559</td>
</tr> <tr>
<td valign="top" align="left">F1-Score</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="center">0.9260</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9833</td>
<td valign="top" align="center">0.9631</td>
</tr> <tr>
<td valign="top" align="left">Overfitting</td>
<td valign="top" align="center">-0.0029%</td>
<td valign="top" align="center">0.1178%</td>
<td valign="top" align="center">0.0213%</td>
<td valign="top" align="center">0.0086%</td>
<td valign="top" align="center">0.0237%</td>
</tr> <tr>
<td valign="top" align="left">Time (sec.)</td>
<td valign="top" align="center">3.62</td>
<td valign="top" align="center">1.09</td>
<td valign="top" align="center">3.79</td>
<td valign="top" align="center">4.53</td>
<td valign="top" align="center">3.81</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Performance results comparison of the proposed ALC (blue) with other classifiers on the validation set of the Breast Cancer Wisconsin dataset. <bold>(a)</bold> Shows the log loss values, and <bold>(b)</bold> shows accuracy.</p></caption>
<alt-text>Two line graphs depict model performance on the Breast Cancer Wisconsin dataset. The left graph shows log loss declining over 500 detoxification cycles for ALC, XGB, SVM, MLP, and LR models. The right graph displays accuracy trends, where ALC and XGB show the highest accuracy improvements over cycles, with others stabilizing.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0006.tif"/>
</fig>
<p><xref ref-type="table" rid="T5">Table 5</xref> presents the performance results of the proposed ALC and other classifiers on the Wine dataset. <xref ref-type="fig" rid="F7">Figures 7a</xref>, <xref ref-type="fig" rid="F7">b</xref> display the loss and accuracy, respectively, on the validation folds. The proposed ALC achieved 100% accuracy, with a loss of 0.0011 and an overfitting gap of 0.0000%, with a training time of 2.38 s. The XGB achieved 92.38% accuracy, with a loss of 0.0691 and an overfitting gap of 0.0675%, with a training time of 1.17 s. The SVM achieved 100% accuracy, with a loss of 0.0001 and an overfitting gap of 0.0000%, with a training time of 3.89 s. The MLP achieved 100% accuracy, with a loss of 0.0568 and an overfitting gap of -0.0068%, with a training time of 3.89 s. Lastly, the LR achieved 100% accuracy, with a loss of 0.0012 and an overfitting gap of 0.0000%, with a training time of 3.92 s.</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Cross-validation performance of the proposed ALC and other classifiers on the Wine dataset (mean over 10-folds).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Metric</bold></th>
<th valign="top" align="center"><bold>ALC</bold></th>
<th valign="top" align="center"><bold>XGB</bold></th>
<th valign="top" align="center"><bold>SVM</bold></th>
<th valign="top" align="center"><bold>MLP</bold></th>
<th valign="top" align="center"><bold>LR</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Loss</td>
<td valign="top" align="center">0.0011</td>
<td valign="top" align="center">0.0691</td>
<td valign="top" align="center">0.0001</td>
<td valign="top" align="center">0.0568</td>
<td valign="top" align="center">0.0012</td>
</tr> <tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9258</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Precision</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9534</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Recall</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9424</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">F1-Score</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.9429</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0000</td>
</tr> <tr>
<td valign="top" align="left">Overfitting</td>
<td valign="top" align="center">0.0000%</td>
<td valign="top" align="center">0.0675%</td>
<td valign="top" align="center">0.0000%</td>
<td valign="top" align="center">-0.0068%</td>
<td valign="top" align="center">0.0000%</td>
</tr> <tr>
<td valign="top" align="left">Time (sec.)</td>
<td valign="top" align="center">2.38</td>
<td valign="top" align="center">1.17</td>
<td valign="top" align="center">3.89</td>
<td valign="top" align="center">3.89</td>
<td valign="top" align="center">3.92</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Performance results comparison of the proposed ALC (blue) with other classifiers on the validation set of the Wine dataset. <bold>(a)</bold> Shows the log loss values, and <bold>(b)</bold> shows accuracy.</p></caption>
<alt-text>Two line charts compare machine learning models on a wine dataset over detoxification cycles. Chart a shows log loss decreasing, especially for models ALC and XGB. Chart b shows accuracy stabilizing near one hundred percent for most models. Models include ALC, XGB, SVM, MLP, and LR.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0007.tif"/>
</fig>
<p><xref ref-type="table" rid="T6">Table 6</xref> presents the performance results of the proposed ALC and other classifiers on the Voice Gender dataset. <xref ref-type="fig" rid="F8">Figures 8a</xref>, <xref ref-type="fig" rid="F8">b</xref> display the log loss and accuracy, respectively, on the validation folds. The proposed ALC achieved 97.63% accuracy, with a loss of 0.0613 and an overfitting gap of 0.0004%, with a training time of 3.21 s. The XGB achieved 92.79% accuracy, with a loss of 0.0706 and an overfitting gap of 0.0601%, with a training time of 1.19 s. The SVM achieved 97.32% accuracy, with a loss of 0.1932 and an overfitting gap of 0.0043%, with a training time of 4.35 s. The MLP achieved 98.26% accuracy, with a loss of 0.0622 and an overfitting gap of -0.0036%, with a training time of 12.59 s. Lastly, the LR achieved 98.11% accuracy, with a loss of 0.0601 and an overfitting gap of -0.0063%, with a training time of 4.61 s.</p>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Cross-validation performance of the proposed ALC and other classifiers on the Voice dataset (mean over 10-folds).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Metric</bold></th>
<th valign="top" align="center"><bold>ALC</bold></th>
<th valign="top" align="center"><bold>XGB</bold></th>
<th valign="top" align="center"><bold>SVM</bold></th>
<th valign="top" align="center"><bold>MLP</bold></th>
<th valign="top" align="center"><bold>LR</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Loss</td>
<td valign="top" align="center">0.0613</td>
<td valign="top" align="center">0.0706</td>
<td valign="top" align="center">0.1932</td>
<td valign="top" align="center">0.0622</td>
<td valign="top" align="center">0.0601</td>
</tr> <tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">0.9752</td>
<td valign="top" align="center">0.9164</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9800</td>
<td valign="top" align="center">0.9811</td>
</tr> <tr>
<td valign="top" align="left">Precision</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9325</td>
<td valign="top" align="center">0.9736</td>
<td valign="top" align="center">0.9811</td>
<td valign="top" align="center">0.9811</td>
</tr> <tr>
<td valign="top" align="left">Recall</td>
<td valign="top" align="center">0.9752</td>
<td valign="top" align="center">0.9105</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9800</td>
<td valign="top" align="center">0.9811</td>
</tr> <tr>
<td valign="top" align="left">F1-Score</td>
<td valign="top" align="center">0.9752</td>
<td valign="top" align="center">0.9150</td>
<td valign="top" align="center">0.9750</td>
<td valign="top" align="center">0.9811</td>
<td valign="top" align="center">0.9811</td>
</tr> <tr>
<td valign="top" align="left">Overfitting</td>
<td valign="top" align="center">0.0004%</td>
<td valign="top" align="center">0.0601%</td>
<td valign="top" align="center">0.0043%</td>
<td valign="top" align="center">-0.0036%</td>
<td valign="top" align="center">-0.0063%</td>
</tr> <tr>
<td valign="top" align="left">Time (sec.)</td>
<td valign="top" align="center">3.21</td>
<td valign="top" align="center">1.19</td>
<td valign="top" align="center">4.35</td>
<td valign="top" align="center">12.59</td>
<td valign="top" align="center">4.61</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Performance results comparison of the proposed ALC (blue) with other classifiers on the validation set of the Voice Gender dataset. <bold>(a)</bold> Shows the log loss values, and <bold>(b)</bold> shows accuracy.</p></caption>
<alt-text>Two charts compare model performance over detoxification cycles. The left chart shows log loss decreasing for models ALC, XGB, SVM, MLP, and LR. The right chart shows accuracy increasing, with ALC, XGB, SVM, and MLP peaking above 0.98, while LR remains constant at about 0.92.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0008.tif"/>
</fig>
<p><xref ref-type="table" rid="T7">Table 7</xref> presents the performance results of the proposed ALC and other classifiers on the MNIST dataset. <xref ref-type="fig" rid="F9">Figures 9a</xref>, <xref ref-type="fig" rid="F9">b</xref> display the log loss and accuracy, respectively, on the validation set. The proposed ALC achieved 99.75% accuracy on the validation set, with a loss of 0.0000 and an overfitting gap of 0.0025%, with a training time of 6.18 s. The XGB achieved 94.05% accuracy, with a loss of 0.0581 and an overfitting gap of 0.0571%, with a training time of 2.35 s. The SVM achieved 99.50% accuracy, with a loss of 0.0076 and an overfitting gap of 0.0050%, with a training time of 5.38 s. The MLP achieved 99.00% accuracy, with a loss of 0.0473 and an overfitting gap of 0.0100%, with a training time of 5.22 s. Lastly, the LR achieved 99.50% accuracy, with a loss of 0.0137 and an overfitting gap of 0.0050%, with a training time of 5.61 s.</p>
<table-wrap position="float" id="T7">
<label>Table 7</label>
<caption><p>Cross-validation performance of the proposed ALC and other classifiers on the MNIST dataset (mean over 10-folds).</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Metric</bold></th>
<th valign="top" align="center"><bold>ALC</bold></th>
<th valign="top" align="center"><bold>XGB</bold></th>
<th valign="top" align="center"><bold>SVM</bold></th>
<th valign="top" align="center"><bold>MLP</bold></th>
<th valign="top" align="center"><bold>LR</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Loss</td>
<td valign="top" align="center">0.0000</td>
<td valign="top" align="center">0.0581</td>
<td valign="top" align="center">0.0076</td>
<td valign="top" align="center">0.0473</td>
<td valign="top" align="center">0.0137</td>
</tr> <tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">0.9975</td>
<td valign="top" align="center">0.9421</td>
<td valign="top" align="center">0.9967</td>
<td valign="top" align="center">0.9900</td>
<td valign="top" align="center">0.9967</td>
</tr> <tr>
<td valign="top" align="left">Precision</td>
<td valign="top" align="center">0.9970</td>
<td valign="top" align="center">0.9828</td>
<td valign="top" align="center">0.9953</td>
<td valign="top" align="center">0.9906</td>
<td valign="top" align="center">0.9953</td>
</tr> <tr>
<td valign="top" align="left">Recall</td>
<td valign="top" align="center">0.9967</td>
<td valign="top" align="center">0.9802</td>
<td valign="top" align="center">0.9967</td>
<td valign="top" align="center">0.9900</td>
<td valign="top" align="center">0.9967</td>
</tr> <tr>
<td valign="top" align="left">F1-Score</td>
<td valign="top" align="center">0.9987</td>
<td valign="top" align="center">0.9800</td>
<td valign="top" align="center">0.9967</td>
<td valign="top" align="center">0.9900</td>
<td valign="top" align="center">0.9967</td>
</tr> <tr>
<td valign="top" align="left">Overfitting</td>
<td valign="top" align="center">0.0025%</td>
<td valign="top" align="center">0.0571%</td>
<td valign="top" align="center">0.0050%</td>
<td valign="top" align="center">0.0100%</td>
<td valign="top" align="center">0.0050%</td>
</tr> <tr>
<td valign="top" align="left">Time (sec.)</td>
<td valign="top" align="center">6.18</td>
<td valign="top" align="center">2.35</td>
<td valign="top" align="center">5.38</td>
<td valign="top" align="center">5.22</td>
<td valign="top" align="center">5.61</td>
</tr></tbody>
</table>
</table-wrap>
<fig id="F9" position="float">
<label>Figure 9</label>
<caption><p>Performance results comparison of the proposed ALC (blue) with other classifiers on the validation set of the MNIST dataset. <bold>(a)</bold> Shows the log loss values, and <bold>(b)</bold> shows accuracy.</p></caption>
<alt-text>Two graphs comparing machine learning models on the MNIST dataset over 500 detoxification cycles. The left graph shows log loss decreasing significantly for all models, with ALC reducing notably after initial cycles. The right graph displays accuracy improving significantly, with most models maintaining high accuracy early on, except ALC, which improves over time. Models include ALC, XGB, SVM, MLP, and LR, indicated in blue, orange, green, red, and purple respectively.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639720-g0009.tif"/>
</fig>
<p>In summary, the proposed ALC outperformed or matched other classifiers across the datasets tested, including Iris, Breast Cancer Wisconsin, Wine, Voice Gender, and MNIST. The results demonstrated superior loss, accuracy, precision, recall, and F1-scores, highlighting the reliability and generalization of the proposed ALC in achieving high classification performance. Furthermore, the proposed ALC exhibited minimal overfitting and efficient training times compared to other classifiers. However, the next section will provide a detailed analysis and interpretation of these results, and shedding light on limitations and imperfections of the proposed ALC.</p>
</sec>
</sec>
<sec sec-type="discussion" id="s6">
<title>6 Discussion</title>
<p>The results presented in Section 5.3, derived from experiments conducted on the datasets described in Section 4.1, highlight the superior performance of the proposed ALC compared to other classifiers. However, a more in-depth statistical analysis is necessary, particularly of the validation set results, as they are considered more reliable indicators of classifier performance due to being obtained from unseen data. The statistical analysis presented in <xref ref-type="table" rid="T8">Table 8</xref> compare the performance of the proposed ALC with four classifiers&#x02014;XGB, SVM, MLP, and LR&#x02014;across the five datasets described in Section 4.1. The analysis focuses on four metrics: loss, accuracy, overfitting gap, and training time, with statistical significance determined using the Wilcoxon signed-rank test at a threshold of <italic>P</italic>-value &#x0003C; 0.05. The Wilcoxon signed-rank test is used to compare paired samples, particularly when data may not follow a normal distribution. It assesses whether the differences between paired observations are statistically significant (Hodges et al., <xref ref-type="bibr" rid="B24">2022</xref>). Hence, this analysis results provide insights into the strengths of the proposed ALC in terms of its generalization, accuracy, and computational efficiency.</p>
<table-wrap position="float" id="T8">
<label>Table 8</label>
<caption><p>Wilcoxon signed-rank test results comparing classifier pairs on validation set metrics across all datasets.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" rowspan="2"><bold>ALC vs</bold>.</th>
<th valign="top" align="left" rowspan="2"><bold>Dataset</bold></th>
<th valign="top" align="center" colspan="4"><bold>P-value</bold></th>
</tr>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="center"><bold>Loss</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>Overfitting</bold></th>
<th valign="top" align="center"><bold>Time</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">XGB</td>
<td valign="top" align="left">Iris Flower</td>
<td valign="top" align="center">0.432</td>
<td valign="top" align="center">0.872</td>
<td valign="top" align="center">0.481</td>
<td valign="top" align="center">0.493</td>
</tr> <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="left">Iris Flower</td>
<td valign="top" align="center">0.012</td>
<td valign="top" align="center">0.950</td>
<td valign="top" align="center">0.008</td>
<td valign="top" align="center">0.025</td>
</tr> <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="left">Iris Flower</td>
<td valign="top" align="center">0.006</td>
<td valign="top" align="center">0.951</td>
<td valign="top" align="center">0.021</td>
<td valign="top" align="center">0.001</td>
</tr> <tr>
<td valign="top" align="left">LR</td>
<td valign="top" align="left">Iris Flower</td>
<td valign="top" align="center">0.037</td>
<td valign="top" align="center">0.042</td>
<td valign="top" align="center">0.029</td>
<td valign="top" align="center">0.017</td>
</tr> <tr>
<td valign="top" align="left">XGB</td>
<td valign="top" align="left">Breast Cancer</td>
<td valign="top" align="center">0.004</td>
<td valign="top" align="center">0.015</td>
<td valign="top" align="center">0.007</td>
<td valign="top" align="center">0.970</td>
</tr> <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="left">Breast Cancer</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.009</td>
<td valign="top" align="center">0.013</td>
<td valign="top" align="center">0.064</td>
</tr> <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="left">Breast Cancer</td>
<td valign="top" align="center">0.015</td>
<td valign="top" align="center">0.011</td>
<td valign="top" align="center">0.012</td>
<td valign="top" align="center">0.004</td>
</tr> <tr>
<td valign="top" align="left">LR</td>
<td valign="top" align="left">Breast Cancer</td>
<td valign="top" align="center">0.000</td>
<td valign="top" align="center">0.020</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.005</td>
</tr> <tr>
<td valign="top" align="left">XGB</td>
<td valign="top" align="left">Wine</td>
<td valign="top" align="center">0.022</td>
<td valign="top" align="center">0.763</td>
<td valign="top" align="center">0.012</td>
<td valign="top" align="center">0.974</td>
</tr> <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="left">Wine</td>
<td valign="top" align="center">0.893</td>
<td valign="top" align="center">0.004</td>
<td valign="top" align="center">0.706</td>
<td valign="top" align="center">0.002</td>
</tr> <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="left">Wine</td>
<td valign="top" align="center">0.005</td>
<td valign="top" align="center">0.681</td>
<td valign="top" align="center">0.023</td>
<td valign="top" align="center">0.003</td>
</tr> <tr>
<td valign="top" align="left">LR</td>
<td valign="top" align="left">Wine</td>
<td valign="top" align="center">0.031</td>
<td valign="top" align="center">0.822</td>
<td valign="top" align="center">0.748</td>
<td valign="top" align="center">0.002</td>
</tr> <tr>
<td valign="top" align="left">XGB</td>
<td valign="top" align="left">Voice Gender</td>
<td valign="top" align="center">0.011</td>
<td valign="top" align="center">0.019</td>
<td valign="top" align="center">0.005</td>
<td valign="top" align="center">0.951</td>
</tr> <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="left">Voice Gender</td>
<td valign="top" align="center">0.000</td>
<td valign="top" align="center">0.002</td>
<td valign="top" align="center">0.007</td>
<td valign="top" align="center">0.001</td>
</tr> <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="left">Voice Gender</td>
<td valign="top" align="center">0.851</td>
<td valign="top" align="center">0.804</td>
<td valign="top" align="center">0.029</td>
<td valign="top" align="center">0.002</td>
</tr> <tr>
<td valign="top" align="left">LR</td>
<td valign="top" align="left">Voice Gender</td>
<td valign="top" align="center">0.019</td>
<td valign="top" align="center">0.781</td>
<td valign="top" align="center">0.003</td>
<td valign="top" align="center">0.001</td>
</tr> <tr>
<td valign="top" align="left">XGB</td>
<td valign="top" align="left">MNIST</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.014</td>
<td valign="top" align="center">0.004</td>
<td valign="top" align="center">0.993</td>
</tr> <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="left">MNIST</td>
<td valign="top" align="center">0.003</td>
<td valign="top" align="center">0.043</td>
<td valign="top" align="center">0.012</td>
<td valign="top" align="center">0.945</td>
</tr> <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="left">MNIST</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.017</td>
<td valign="top" align="center">0.008</td>
<td valign="top" align="center">0.936</td>
</tr> <tr>
<td valign="top" align="left">LR</td>
<td valign="top" align="left">MNIST</td>
<td valign="top" align="center">0.002</td>
<td valign="top" align="center">0.041</td>
<td valign="top" align="center">0.009</td>
<td valign="top" align="center">0.898</td>
</tr></tbody>
</table>
</table-wrap>
<p>The loss metric, which is a primary indicator of classifier generalizability, demonstrates that the proposed ALC outperforms other classifiers in several datasets. Specifically, in the Iris Flower dataset, the proposed ALC showed statistically significant improvements in loss compared to SVM (<italic>P</italic> &#x0003D; 0.012), MLP (<italic>P</italic> &#x0003D; 0.006), and LR (<italic>P</italic> &#x0003D; 0.037), while its performance was comparable to XGB (<italic>P</italic> &#x0003D; 0.432), indicating XGB outperforms the proposed ALC. Similarly, in the Breast Cancer Wisconsin dataset, the proposed ALC showed significant improvements over XGB (<italic>P</italic> &#x0003D; 0.004), SVM (<italic>P</italic> &#x0003D; 0.001), MLP (<italic>P</italic> &#x0003D; 0.015), and LR (<italic>P</italic> &#x0003D; 0.000). In the Wine dataset, the proposed ALC demonstrated significant improvements compared to XGB (<italic>P</italic> &#x0003D; 0.022), MLP (<italic>P</italic> &#x0003D; 0.005), and LR (<italic>P</italic> &#x0003D; 0.031), but did not show statistically significant with SVM (<italic>P</italic> &#x0003D; 0.893). These trends were consistent in more complex datasets like Voice Gender and MNIST, where the proposed ALC achieved lower loss values compared to other classifiers in most cases (<italic>P</italic> &#x0003C; 0.05). The findings indicate that the proposed ALC offers better generalization across these datasets of varying complexity.</p>
<p>In terms of accuracy, the differences between the proposed ALC and other classifiers were generally less pronounced, as reflected by <italic>P</italic>-values exceeding 0.05 in most datasets. Notable exceptions include the Voice Gender dataset, where the proposed ALC significantly outperformed SVM (<italic>P</italic> &#x0003D; 0.002), and the Breast Cancer Wisconsin dataset, where the proposed ALC showed an advantage over XGB (<italic>P</italic> &#x0003D; 0.015). Furthermore, additional accuracy comparisons were conducted with other models discussed in the related work Section 2, as presented in <xref ref-type="table" rid="T9">Table 9</xref>, demonstrating the superiority of the proposed ALC. These results suggest that while accuracy remains an important metric, it may not always effectively differentiate the performance of classifiers, particularly when accuracy levels are already high across classifiers (Qu et al., <xref ref-type="bibr" rid="B51">2022</xref>).</p>
<table-wrap position="float" id="T9">
<label>Table 9</label>
<caption><p>Performance comparison (accuracy metric) of the proposed ALC with models discussed in the related work.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="left"><bold>Dataset</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="left"><bold>Ref</bold>.</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="2">ALC</td>
<td valign="top" align="left">Iris Flower</td>
<td valign="top" align="center"><bold>1.0000</bold></td>
<td valign="top" align="left">Proposed</td>
</tr>
 <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">0.9600</td>
<td valign="top" align="left">Fan et al., <xref ref-type="bibr" rid="B16">2024</xref></td>
</tr> <tr>
<td valign="top" align="left" rowspan="2">ALC</td>
<td valign="top" align="left">Breast Cancer</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="left">Proposed</td>
</tr>
 <tr>
<td valign="top" align="left">RRNN</td>
<td valign="top" align="center"><bold>0.9951</bold></td>
<td valign="top" align="left">Rajeswari and Sakthi Priya, <xref ref-type="bibr" rid="B53">2025</xref></td>
</tr> <tr>
<td valign="top" align="left" rowspan="5">ALC</td>
<td valign="top" align="left">Wine</td>
<td valign="top" align="center"><bold>1.0000</bold></td>
<td valign="top" align="left">Proposed</td>
</tr>
 <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">0.8790</td>
<td valign="top" align="left">Cortez et al., <xref ref-type="bibr" rid="B12">2009</xref></td>
</tr>
 <tr>
<td valign="top" align="left">MR</td>
<td valign="top" align="center">0.8645</td>
<td valign="top" align="left">Cortez et al., <xref ref-type="bibr" rid="B12">2009</xref></td>
</tr>
 <tr>
<td valign="top" align="left">ANN</td>
<td valign="top" align="center">0.8675</td>
<td valign="top" align="left">Cortez et al., <xref ref-type="bibr" rid="B12">2009</xref></td>
</tr>
 <tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">0.9830</td>
<td valign="top" align="left">Fan et al., <xref ref-type="bibr" rid="B16">2024</xref></td>
</tr> <tr>
<td valign="top" align="left" rowspan="2">ALC</td>
<td valign="top" align="left">Voice Gender</td>
<td valign="top" align="center"><bold>0.9752</bold></td>
<td valign="top" align="left">Proposed</td>
</tr>
 <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="center">0.9674</td>
<td valign="top" align="left">Buyukyilmaz and Cibikdiken, <xref ref-type="bibr" rid="B10">2016</xref></td>
</tr> <tr>
<td valign="top" align="left" rowspan="6">ALC</td>
<td valign="top" align="left">MNIST</td>
<td valign="top" align="center"><bold>0.9975</bold></td>
<td valign="top" align="left">Proposed</td>
</tr>
 <tr>
<td valign="top" align="left">SVC</td>
<td valign="top" align="center">0.9780</td>
<td valign="top" align="left">Xiao et al., <xref ref-type="bibr" rid="B65">2017</xref></td>
</tr>
 <tr>
<td valign="top" align="left">DT</td>
<td valign="top" align="center">0.8860</td>
<td valign="top" align="left">Xiao et al., <xref ref-type="bibr" rid="B65">2017</xref></td>
</tr>
 <tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="center">0.9590</td>
<td valign="top" align="left">Xiao et al., <xref ref-type="bibr" rid="B65">2017</xref></td>
</tr>
 <tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="center">0.9720</td>
<td valign="top" align="left">Xiao et al., <xref ref-type="bibr" rid="B65">2017</xref></td>
</tr>
 <tr>
<td valign="top" align="left">OPIUM</td>
<td valign="top" align="center">0.9590</td>
<td valign="top" align="left">Cohen et al., <xref ref-type="bibr" rid="B11">2017</xref></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>Bold values indicate that the corresponding method achieved superior results compared to other competing algorithms.</p>
</table-wrap-foot>
</table-wrap>
<p>The overfitting gap metric, which evaluates the difference between the performance on training and validation folds, reveals that the proposed ALC demonstrates superior generalization. In most datasets, significant improvements were observed, such as in the Breast Cancer Wisconsin and MNIST datasets, where all <italic>P</italic>-values were &#x0003C; 0.05. In contrast, the overfitting gap in the Wine dataset showed inconsistent patterns, with <italic>P</italic>-values largely exceeding the significance threshold (<italic>P</italic> &#x0003D; 0.500). These results support the ability of the proposed ALC to reduce the risk of overfitting. Furthermore, the training time metric is used to measure the speed of classifiers. The statistical results suggest that the proposed ALC is competitive and efficient. The training time differed considerably (at least) in datasets that are smaller, including Iris Flower (<italic>P</italic> &#x0003C; 0.01), Breast Cancer Wisconsin (<italic>P</italic> &#x0003D; 0.002), Wine (<italic>P</italic> &#x0003D; 0.002), and voice Gender (<italic>P</italic> &#x0003D; 0.001). But on a bigger and more complicated dataset such as MNIST, the training time of the proposed ALC was similar to that of other classifiers (<italic>P</italic> &#x0003E; 0.90). The advocated ALC had no significant differences with XGB since it utilized tree-based models, which tend to have short processing times.</p>
<sec>
<title>6.1 Computational complexity and ablation analysis</title>
<p>The complexity of the proposed ALC is mostly influenced by matrix manipulation and optimization procedure. Suppose that there are n input samples, f features, p lobules, o output classes, and the number of iterations of the optimization (i.e., detoxification cycles) = I. The initial large step is the product of the input toxin matrix <italic>X</italic> &#x02208; &#x0211D;<sup><italic>n</italic>&#x000D7;<italic>f</italic></sup> by the cofactor matrix <italic>C</italic> &#x02208; &#x0211D;<sup><italic>f</italic>&#x000D7;<italic>p</italic></sup> in Phase I and takes <inline-formula><mml:math id="M23"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>f</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> time. This is then summed with an element-wise ReLU activation of the resultant matrix whose cost is <inline-formula><mml:math id="M24"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. During Phase II, a similar model of conjugation is treated as the second matrix multiplication involving the activated toxin matrix and the vitamin matrix <italic>V</italic> &#x02208; &#x0211D;<sup><italic>npo</italic></sup>, which would lead to time complexity of <inline-formula><mml:math id="M25"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>p</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. This last elimination step runs the softmax on each of the <italic>n</italic> output vectors, and costs <inline-formula><mml:math id="M26"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. The training is based on IFOX that successively optimizes the cofactor and vitamin matrices. Suppose every iteration uses the entire dataset, training will hence have time complexity <inline-formula><mml:math id="M27"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. So, this term dominates the overall time complexity of the ALC when training. Moreover, in the space complexity, the model will need <inline-formula><mml:math id="M28"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>f</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> storage of the input data, <inline-formula><mml:math id="M29"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> memory to hold the cofactor matrix <italic>C</italic>, <inline-formula><mml:math id="M30"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> memory to hold the vitamin matrix <italic>V</italic>, and <inline-formula><mml:math id="M31"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> intermediate activation and outputs. Thus, the overall space complexity is <inline-formula><mml:math id="M32"><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>f</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>n</mml:mi><mml:mi>p</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. The parameter matrices and batch level intermediate results consume the most memory. Hence, the ALC has a scalable architecture whose complexity scales linearly with size of input and size of optimization steps and quadratically with size of internal representation (lobules).</p>
<p>The ablation study results were summarized in <xref ref-type="table" rid="T10">Table 10</xref>, where the significance of each component of ALC was revealed. The complete model (Phase I &#x0002B; Phase II) represented the optimal result, reaching 99.12 percent accuracy and demonstrating small overfitting. Withdrawing Phase II or replacing Phase I output freedom with a constant value resulted in significant accuracy declines (95.20% and 91.45%, respectively), and this fact shows that both steps are needed. The replacement of the cofactor matrix <italic>C</italic> by random numbers or an identity vitamin matrix also lowered performance indicating the need to learn both matrices. These findings demonstrate that all its components play a significant role in the work of the proposed ALC as a whole.</p>
<table-wrap position="float" id="T10">
<label>Table 10</label>
<caption><p>Ablation study results showing the contribution of Phase I, Phase II, and the respective matrices in the proposed ALC on the Breast Cancer Wilcoxon dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Model variant</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>Loss</bold></th>
<th valign="top" align="center"><bold>F1-Score</bold></th>
<th valign="top" align="center"><bold>Overfitting</bold></th>
<th valign="top" align="center"><bold>Time (sec.)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Full ALC (phase I &#x0002B; phase II)</td>
<td valign="top" align="center">99.12%</td>
<td valign="top" align="center">0.0261</td>
<td valign="top" align="center">0.9932</td>
<td valign="top" align="center">-0.0029%</td>
<td valign="top" align="center">3.62</td>
</tr> <tr>
<td valign="top" align="left">Phase I only</td>
<td valign="top" align="center">95.20%</td>
<td valign="top" align="center">0.0745</td>
<td valign="top" align="center">0.9517</td>
<td valign="top" align="center">0.0121%</td>
<td valign="top" align="center">2.58</td>
</tr> <tr>
<td valign="top" align="left">Phase II only</td>
<td valign="top" align="center">91.45%</td>
<td valign="top" align="center">0.1123</td>
<td valign="top" align="center">0.9140</td>
<td valign="top" align="center">0.0450%</td>
<td valign="top" align="center">2.89</td>
</tr> <tr>
<td valign="top" align="left">Random cofactor matrix</td>
<td valign="top" align="center">88.36%</td>
<td valign="top" align="center">0.1341</td>
<td valign="top" align="center">0.8823</td>
<td valign="top" align="center">0.0663%</td>
<td valign="top" align="center">2.51</td>
</tr> <tr>
<td valign="top" align="left">Identity vitamin matrix</td>
<td valign="top" align="center">93.62%</td>
<td valign="top" align="center">0.0897</td>
<td valign="top" align="center">0.9312</td>
<td valign="top" align="center">0.0387%</td>
<td valign="top" align="center">2.73</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>6.2 Failure case analysis</title>
<p>Although the proposed ALC can deliver good results irrespective of the data encountered, a few limitations can be associated with it, based on an application during certain situations. ALC does not utilize any mini-batch training mechanism, e.g., stochastic gradient descent (Wojtowytsch, <xref ref-type="bibr" rid="B64">2023</xref>), which is normally applied to large-scale learning to minimize computing costs. This consequence can cause longer runtimes in full-batch training working with mass data. There is also slower convergence in the model in that it uses the stochastic IFOX that does not directly optimize training error when applied to cofactor and vitamin matrices. It could influence either the stability or efficiency of convergence. From a model behavior perspective, ALC might fail to perform well on datasets with poor non-linear structure, noisy or sparse features, or extreme class skew, where the biological metaphor might not find any useful patterns. In addition to that, errors can be propagated and replicated by the sequential dependency between Phase I and Phase II. These constraints point to the directions of further research, such as utilizing mini-batch techniques, improving the IFOX, implementing hybrid optimization schemes, or reorganizing the bio-chemical paradigm to be less rigid and more flexible.</p>
</sec>
</sec>
<sec sec-type="conclusions" id="s7">
<title>7 Conclusions</title>
<p>In conclusion, this paper suggests a novel supervised learning classifier, termed the artificial liver classifier (ALC), inspired by the human liver&#x00027;s detoxification function. The ALC is easy to implement, fast, and capable of reducing overfitting by simulating the detoxification function through straightforward mathematical operations. Furthermore, it introduces an improvement to the FOX optimization algorithm, referred to as IFOX, which is integrated with the ALC as training algorithm to optimize parameters effectively. Furthermore, the ALC was evaluated on five benchmark machine learning datasets: Iris Flower, Breast Cancer Wisconsin, Wine, Voice Gender, and MNIST. The empirical results demonstrated its superior performance compared to support vector machines, multilayer perceptron, logistic regression, XGBoost and other established classifiers. Despite these superiority, the ALC has limitations, such as longer training times on large datasets and slower convergence rates, which could be addressed in future work using methods like mini-batch training or parallel processing. Finally, this paper underscores the potential of biologically inspired models and encourages researchers to simulate natural functions to develop more efficient and powerful machine learning models.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s8">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>MJ: Conceptualization, Data curation, Formal analysis, Investigation, Methodology, Resources, Software, Validation, Visualization, Writing &#x02013; original draft. YA: Project administration, Supervision, Validation, Writing &#x02013; review &#x00026; editing. TR: Conceptualization, Investigation, Methodology, Project administration, Resources, Supervision, Validation, Visualization, Writing &#x02013; review &#x00026; editing.</p>
</sec>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s11">
<title>Generative AI statement</title>
<p>The author(s) declare that no Gen AI was used in the creation of this manuscript.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Abdalrdha</surname> <given-names>Z. K.</given-names></name> <name><surname>Al-Bakry</surname> <given-names>A. M.</given-names></name> <name><surname>Farhan</surname> <given-names>A. K.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;CNN hyper-parameter optimizer based on evolutionary selection and gow approach for crimes tweet detection,&#x0201D;</article-title> in <source>2023 16th International Conference on Developments in eSystems Engineering (DeSE)</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>IEEE</publisher-name>). <pub-id pub-id-type="doi">10.1109/DeSE60595.2023.10469361</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abdullah</surname> <given-names>J. M.</given-names></name> <name><surname>Ahmed</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>Fitness dependent optimizer: inspired by the bee swarming reproductive process</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>43473</fpage>&#x02013;<lpage>43486</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2907012</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aladdin</surname> <given-names>A. M.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name></person-group> (<year>2025</year>). <article-title>Leo: Lagrange elementary optimization</article-title>. <source>Neural Comput. Appl</source>. <volume>37</volume>, <fpage>14365</fpage>&#x02013;<lpage>14397</lpage>. <pub-id pub-id-type="doi">10.1007/s00521-025-11225-2</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alshayeji</surname> <given-names>M. H.</given-names></name> <name><surname>Ellethy</surname> <given-names>H.</given-names></name> <name><surname>Abed</surname> <given-names>S.</given-names></name> <name><surname>Gupta</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>Computer-aided detection of breast cancer on the wisconsin dataset: an artificial neural networks approach</article-title>. <source>Biomed. Signal Process. Control</source> <volume>71</volume>:<fpage>103141</fpage>. <pub-id pub-id-type="doi">10.1016/j.bspc.2021.103141</pub-id><pub-id pub-id-type="pmid">36017156</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Arora</surname> <given-names>A.</given-names></name> <name><surname>Alsadoon</surname> <given-names>O. H.</given-names></name> <name><surname>Khairi</surname> <given-names>T. W. A.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;A novel softmax regression enhancement for handwritten digits recognition using tensor flow library,&#x0201D;</article-title> in <source>2020 5th International Conference on Innovative Technologies in Intelligent Systems and Industrial Applications (CITISIA)</source> (<publisher-loc>Sydney, NSW</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1109/CITISIA50690.2020.9371821</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aula</surname> <given-names>S. A.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name></person-group> (<year>2025</year>). <article-title>FOX-TSA: navigating complex search spaces and superior performance in benchmark and real-world optimization problems</article-title>. <source>Ain Shams Eng. J</source>. <volume>16</volume>:<fpage>103185</fpage>. <pub-id pub-id-type="doi">10.1016/j.asej.2024.103185</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Azevedo</surname> <given-names>B. F.</given-names></name> <name><surname>Rocha</surname> <given-names>A. M. A. C.</given-names></name> <name><surname>Pereira</surname> <given-names>A. I.</given-names></name></person-group> (<year>2024</year>). <article-title>Hybrid approaches to optimization and machine learning methods: a systematic literature review</article-title>. <source>Mach. Learn</source>. <volume>113</volume>, <fpage>4055</fpage>&#x02013;<lpage>4097</lpage>. <pub-id pub-id-type="doi">10.1007/s10994-023-06467-x</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Beam</surname> <given-names>K. S.</given-names></name> <name><surname>Zupancic</surname> <given-names>J. A. F.</given-names></name></person-group> (<year>2022</year>). <article-title>Machine learning: remember the fundamentals</article-title>. <source>Pediatr. Res</source>. <volume>93</volume>, <fpage>291</fpage>&#x02013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1038/s41390-022-02420-1</pub-id><pub-id pub-id-type="pmid">36550355</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bridle</surname> <given-names>J. S.</given-names></name></person-group> (<year>1990</year>). <article-title>&#x0201C;Probabilistic interpretation of feedforward classification network outputs, with relationships to statistical pattern recognition,&#x0201D;</article-title> in <source>Neurocomputing</source>, eds. F. F. Souli&#x000E9; and J. H&#x000E9;rault (Springer Berlin: Heidelberg), <fpage>227</fpage>&#x02013;<lpage>236</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-76153-9_28</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Buyukyilmaz</surname> <given-names>M.</given-names></name> <name><surname>Cibikdiken</surname> <given-names>A. O.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;Voice gender recognition using deep learning,&#x0201D;</article-title> in <source>Proceedings of 2016 International Conference on Modeling, Simulation and Optimization Technologies and Applications (MSOTA2016)</source> (<publisher-loc>Xiamen</publisher-loc>: <publisher-name>Atlantis Press</publisher-name>), msota-16. <pub-id pub-id-type="doi">10.2991/msota-16.2016.90</pub-id><pub-id pub-id-type="pmid">32175718</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cohen</surname> <given-names>G.</given-names></name> <name><surname>Afshar</surname> <given-names>S.</given-names></name> <name><surname>Tapson</surname> <given-names>J.</given-names></name> <name><surname>van Schaik</surname> <given-names>A.</given-names></name></person-group> (<year>2017</year>). <article-title>EMNIST: an extension of mnist to handwritten letters</article-title>. <source>arXiv Preprint arXiv:1702.05373</source>. <pub-id pub-id-type="doi">10.48550/arXiv.1702.05373</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cortez</surname> <given-names>P.</given-names></name> <name><surname>Cerdeira</surname> <given-names>A.</given-names></name> <name><surname>Almeida</surname> <given-names>F.</given-names></name> <name><surname>Matos</surname> <given-names>T.</given-names></name> <name><surname>Reis</surname> <given-names>J.</given-names></name></person-group> (<year>2009</year>). <article-title>Modeling wine preferences by data mining from physicochemical properties</article-title>. <source>Decis. Support Syst</source>. <volume>47</volume>, <fpage>547</fpage>&#x02013;<lpage>553</lpage>. <pub-id pub-id-type="doi">10.1016/j.dss.2009.05.016</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Donati</surname> <given-names>G.</given-names></name> <name><surname>Angeletti</surname> <given-names>A.</given-names></name> <name><surname>Gasperoni</surname> <given-names>L.</given-names></name> <name><surname>Piscaglia</surname> <given-names>F.</given-names></name> <name><surname>Croci Chiocchini</surname> <given-names>A. L.</given-names></name> <name><surname>Scrivo</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Detoxification of bilirubin and bile acids with intermittent coupled plasmafiltration and adsorption in liver failure (hercole study)</article-title>. <source>J. Nephrol</source>. <volume>34</volume>, <fpage>77</fpage>&#x02013;<lpage>88</lpage>. <pub-id pub-id-type="doi">10.1007/s40620-020-00799-w</pub-id><pub-id pub-id-type="pmid">32710265</pub-id></citation></ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dwivedi</surname> <given-names>Y. K.</given-names></name> <name><surname>Hughes</surname> <given-names>L.</given-names></name> <name><surname>Ismagilova</surname> <given-names>E.</given-names></name> <name><surname>Aarts</surname> <given-names>G.</given-names></name> <name><surname>Coombs</surname> <given-names>C.</given-names></name> <name><surname>Crick</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Artificial intelligence (AI): multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy</article-title>. <source>Int. J. Inf. Manage</source>. <volume>57</volume>:<fpage>101994</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijinfomgt.2019.08.002</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Elizabeth Rani</surname> <given-names>G.</given-names></name> <name><surname>Sakthimohan</surname> <given-names>M.</given-names></name> <name><surname>Abhigna Reddy</surname> <given-names>G.</given-names></name> <name><surname>Selvalakshmi</surname> <given-names>D.</given-names></name> <name><surname>Keerthi</surname> <given-names>T.</given-names></name> <name><surname>Raja Sekar</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>&#x0201C;Mnist handwritten digit recognition using machine learning,&#x0201D;</article-title> in <source>2022 2nd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE)</source> (<publisher-loc>Noida</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>768</fpage>&#x02013;<lpage>772</lpage>. <pub-id pub-id-type="doi">10.1109/ICACITE53722.2022.9823806</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fan</surname> <given-names>S.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name> <name><surname>Guo</surname> <given-names>C.</given-names></name> <name><surname>Liu</surname> <given-names>D.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name></person-group> (<year>2024</year>). <article-title>A novel cost-sensitive three-way intuitionistic fuzzy large margin classifier</article-title>. <source>Inf. Sci</source>. <volume>674</volume>:<fpage>120726</fpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2024.120726</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname> <given-names>Q.</given-names></name> <name><surname>Schweidtmann</surname> <given-names>A. M.</given-names></name></person-group> (<year>2024</year>). <article-title>Deep reinforcement learning for process design: review and perspective</article-title>. <source>Curr. Opin. Chem. Eng</source>. <volume>44</volume>:<fpage>101012</fpage>. <pub-id pub-id-type="doi">10.1016/j.coche.2024.101012</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gibert-Ramos</surname> <given-names>A.</given-names></name> <name><surname>Sanfeliu-Redondo</surname> <given-names>D.</given-names></name> <name><surname>Aristu-Zabalza</surname> <given-names>P.</given-names></name> <name><surname>Mart&#x000ED;nez-Alcocer</surname> <given-names>A.</given-names></name> <name><surname>Gracia-Sancho</surname> <given-names>J.</given-names></name> <name><surname>Guix&#x000E9;-Muntet</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>The hepatic sinusoid in chronic liver disease: the optimal milieu for cancer</article-title>. <source>Cancers</source> <volume>13</volume>:<fpage>5719</fpage>. <pub-id pub-id-type="doi">10.3390/cancers13225719</pub-id><pub-id pub-id-type="pmid">34830874</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Goyal</surname> <given-names>S.</given-names></name> <name><surname>Sharma</surname> <given-names>A.</given-names></name> <name><surname>Gupta</surname> <given-names>P.</given-names></name> <name><surname>Chandi</surname> <given-names>P.</given-names></name></person-group> (<year>2021</year>). <source>Assessment of Iris Flower Classification Using Machine Learning Algorithms</source>. <publisher-name>Springer</publisher-name>: <publisher-loc>Singapore</publisher-loc>, <fpage>641</fpage>&#x02013;<lpage>649</lpage>. <pub-id pub-id-type="doi">10.1007/978-981-16-1048-6_50</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Grzybowski</surname> <given-names>A.</given-names></name> <name><surname>Pawlikowska-&#x00141;ag&#x000F3;d</surname> <given-names>K.</given-names></name> <name><surname>Lambert</surname> <given-names>W. C.</given-names></name></person-group> (<year>2024</year>). <article-title>A history of artificial intelligence</article-title>. <source>Clin. Dermatol</source>. <volume>42</volume>, <fpage>221</fpage>&#x02013;<lpage>229</lpage>. <pub-id pub-id-type="doi">10.1016/j.clindermatol.2023.12.016</pub-id><pub-id pub-id-type="pmid">38185196</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guengerich</surname> <given-names>F. P.</given-names></name></person-group> (<year>2020</year>). <article-title>A history of the roles of cytochrome p450 enzymes in the toxicity of drugs</article-title>. <source>Toxicol. Res</source>. <volume>37</volume>, <fpage>1</fpage>&#x02013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1007/s43188-020-00056-z</pub-id><pub-id pub-id-type="pmid">32837681</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hama Rashid</surname> <given-names>D. N.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name> <name><surname>Mirjalili</surname> <given-names>S.</given-names></name></person-group> (<year>2021</year>). <article-title>ANA: ANT nesting algorithm for optimizing real-world problems</article-title>. <source>Mathematics</source> <volume>9</volume>:<fpage>3111</fpage>. <pub-id pub-id-type="doi">10.3390/math9233111</pub-id><pub-id pub-id-type="pmid">39811291</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hamad</surname> <given-names>R. K.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name></person-group> (<year>2024</year>). <article-title>Goose algorithm: a powerful optimization tool for real-world engineering challenges and beyond</article-title>. <source>Evol. Syst</source>. <volume>15</volume>, <fpage>1249</fpage>&#x02013;<lpage>1274</lpage>. <pub-id pub-id-type="doi">10.1007/s12530-023-09553-6</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hodges</surname> <given-names>C. B.</given-names></name> <name><surname>Stone</surname> <given-names>B. M.</given-names></name> <name><surname>Johnson</surname> <given-names>P. K.</given-names></name> <name><surname>Carter</surname> <given-names>J. H.</given-names></name> <name><surname>Sawyers</surname> <given-names>C. K.</given-names></name> <name><surname>Roby</surname> <given-names>P. R.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Researcher degrees of freedom in statistical software contribute to unreliable results: a comparison of nonparametric analyses conducted in SPSS, SAS, STATA, and R</article-title>. <source>Behav. Res. Methods</source> <volume>55</volume>, <fpage>2813</fpage>&#x02013;<lpage>2837</lpage>. <pub-id pub-id-type="doi">10.3758/s13428-022-01932-2</pub-id><pub-id pub-id-type="pmid">35953660</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hoffmann</surname> <given-names>F.</given-names></name> <name><surname>Bertram</surname> <given-names>T.</given-names></name> <name><surname>Mikut</surname> <given-names>R.</given-names></name> <name><surname>Reischl</surname> <given-names>M.</given-names></name> <name><surname>Nelles</surname> <given-names>O.</given-names></name></person-group> (<year>2019</year>). <article-title>Benchmarking in classification and regression</article-title>. <source>WIREs Data Mining and Knowledge Discovery</source> <volume>9</volume>:<fpage>1318</fpage>. <pub-id pub-id-type="doi">10.1002/widm.1318</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ishibashi</surname> <given-names>H.</given-names></name> <name><surname>Nakamura</surname> <given-names>M.</given-names></name> <name><surname>Komori</surname> <given-names>A.</given-names></name> <name><surname>Migita</surname> <given-names>K.</given-names></name> <name><surname>Shimoda</surname> <given-names>S.</given-names></name></person-group> (<year>2009</year>). <article-title>Liver architecture, cell function, and disease</article-title>. <source>Semin. Immunopathol</source>. <volume>31</volume>, <fpage>399</fpage>&#x02013;<lpage>409</lpage>. <pub-id pub-id-type="doi">10.1007/s00281-009-0155-6</pub-id><pub-id pub-id-type="pmid">19468732</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jabber</surname> <given-names>S.</given-names></name> <name><surname>Hashem</surname> <given-names>S.</given-names></name> <name><surname>Jafer</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Analytical and comparative study for optimization problems</article-title>. <source>Iraqi J. Comput. Commun. Control Syst. Eng</source>. <volume>23</volume>, <fpage>46</fpage>&#x02013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.33103/uot.ijccce.23.4.5</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname> <given-names>T.</given-names></name> <name><surname>Gradus</surname> <given-names>J. L.</given-names></name> <name><surname>Rosellini</surname> <given-names>A. J.</given-names></name></person-group> (<year>2020</year>). <article-title>Supervised machine learning: a brief primer</article-title>. <source>Behav. Ther</source>. <volume>51</volume>, <fpage>675</fpage>&#x02013;<lpage>687</lpage>. <pub-id pub-id-type="doi">10.1016/j.beth.2020.05.002</pub-id><pub-id pub-id-type="pmid">32800297</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jumaah</surname> <given-names>M. A.</given-names></name> <name><surname>Ali</surname> <given-names>Y. H.</given-names></name> <name><surname>Rashid</surname> <given-names>T. A.</given-names></name> <name><surname>Vimal</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>FOXANN: a method for boosting neural network performance</article-title>. <source>J. Soft Comput. Comput. Appl</source>. <volume>1</volume>:<fpage>2</fpage>. <pub-id pub-id-type="doi">10.70403/3008-1084.1001</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jumin</surname> <given-names>E.</given-names></name> <name><surname>Zaini</surname> <given-names>N.</given-names></name> <name><surname>Ahmed</surname> <given-names>A. N.</given-names></name> <name><surname>Abdullah</surname> <given-names>S.</given-names></name> <name><surname>Ismail</surname> <given-names>M.</given-names></name> <name><surname>Sherif</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Machine learning versus linear regression modelling approach for accurate ozone concentrations prediction</article-title>. <source>Eng. Appl. Comput. Fluid Mech</source>. <volume>14</volume>, <fpage>713</fpage>&#x02013;<lpage>725</lpage>. <pub-id pub-id-type="doi">10.1080/19942060.2020.1758792</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kennedy</surname> <given-names>C. C.</given-names></name> <name><surname>Brown</surname> <given-names>E. E.</given-names></name> <name><surname>Abutaleb</surname> <given-names>N. O.</given-names></name> <name><surname>Truskey</surname> <given-names>G. A.</given-names></name></person-group> (<year>2021</year>). <article-title>Development and application of endothelial cells derived from pluripotent stem cells in microphysiological systems models</article-title>. <source>Front. Cardiovasc. Med</source>. <volume>8</volume>:<fpage>625016</fpage>. <pub-id pub-id-type="doi">10.3389/fcvm.2021.625016</pub-id><pub-id pub-id-type="pmid">33659279</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khudhair</surname> <given-names>A. T.</given-names></name> <name><surname>Maolood</surname> <given-names>A. T.</given-names></name> <name><surname>Gbashi</surname> <given-names>E. K.</given-names></name></person-group> (<year>2024a</year>). <article-title>A novel approach to generate dynamic s-box for lightweight cryptography based on the 3d hindmarsh rose model</article-title>. <source>J. Soft Comput. Comput. Appl</source>. 1. <pub-id pub-id-type="doi">10.70403/3008-1084.1003</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khudhair</surname> <given-names>A. T.</given-names></name> <name><surname>Maolood</surname> <given-names>A. T.</given-names></name> <name><surname>Gbashi</surname> <given-names>E. K.</given-names></name></person-group> (<year>2024b</year>). <article-title>Symmetric keys for lightweight encryption algorithms using a pre&#x02014;trained VGG16 model</article-title>. <source>Telecom</source> <volume>5</volume>, <fpage>892</fpage>&#x02013;<lpage>906</lpage>. <pub-id pub-id-type="doi">10.3390/telecom5030044</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khudhair</surname> <given-names>A. T.</given-names></name> <name><surname>Maolood</surname> <given-names>A. T.</given-names></name> <name><surname>Gbashi</surname> <given-names>E. K.</given-names></name></person-group> (<year>2024c</year>). <article-title>Symmetry analysis in construction two dynamic lightweight s-boxes based on the 2D tinkerbell map and the 2d duffing map</article-title>. <source>Symmetry</source> <volume>16</volume>:<fpage>872</fpage>. <pub-id pub-id-type="doi">10.3390/sym16070872</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kolides</surname> <given-names>A.</given-names></name> <name><surname>Nawaz</surname> <given-names>A.</given-names></name> <name><surname>Rathor</surname> <given-names>A.</given-names></name> <name><surname>Beeman</surname> <given-names>D.</given-names></name> <name><surname>Hashmi</surname> <given-names>M.</given-names></name> <name><surname>Fatima</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Artificial intelligence foundation and pre-trained models: fundamentals, applications, opportunities, and social impacts</article-title>. <source>Simul. Model. Pract. Theory</source>. <volume>126</volume>:<fpage>102754</fpage>. <pub-id pub-id-type="doi">10.1016/j.simpat.2023.102754</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Krebs</surname> <given-names>N. J.</given-names></name> <name><surname>Neville</surname> <given-names>C.</given-names></name> <name><surname>Vacanti</surname> <given-names>J. P.</given-names></name></person-group> (<year>2007</year>). <source>Cellular Transplants for Liver Diseases</source> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>Elsevier</publisher-name>), <fpage>215</fpage>&#x02013;<lpage>240</lpage>. <pub-id pub-id-type="doi">10.1016/B978-012369415-7/50013-2</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>M.</given-names></name> <name><surname>Mehta</surname> <given-names>U.</given-names></name> <name><surname>Cirrincione</surname> <given-names>G.</given-names></name></person-group> (<year>2024</year>). <article-title>Enhancing neural network classification using fractional-order activation functions</article-title>. <source>AI Open</source> <volume>5</volume>, <fpage>10</fpage>&#x02013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1016/j.aiopen.2023.12.003</pub-id><pub-id pub-id-type="pmid">37875469</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>S.</given-names></name> <name><surname>Yildiz</surname> <given-names>B. S.</given-names></name> <name><surname>Mehta</surname> <given-names>P.</given-names></name> <name><surname>Panagant</surname> <given-names>N.</given-names></name> <name><surname>Sait</surname> <given-names>S. M.</given-names></name> <name><surname>Mirjalili</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Chaotic marine predators algorithm for global optimization of real-world engineering problems</article-title>. <source>Knowl. Based Syst.</source> <volume>261</volume>:<fpage>110192</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2022.110192</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lasalvia</surname> <given-names>M.</given-names></name> <name><surname>Capozzi</surname> <given-names>V.</given-names></name> <name><surname>Perna</surname> <given-names>G.</given-names></name></person-group> (<year>2022</year>). <article-title>A comparison of PCA-LDA and PLS-DA techniques for classification of vibrational spectra</article-title>. <source>Appl. Sci</source>. <volume>12</volume>:<fpage>5345</fpage>. <pub-id pub-id-type="doi">10.3390/app12115345</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Cao</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>Improving ant colony optimization algorithm with epsilon greedy and levy flight</article-title>. <source>Complex Intell. Syst</source>. <volume>7</volume>, <fpage>1711</fpage>&#x02013;<lpage>1722</lpage>. <pub-id pub-id-type="doi">10.1007/s40747-020-00138-3</pub-id></citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Maharjan</surname> <given-names>S.</given-names></name> <name><surname>Alsadoon</surname> <given-names>A.</given-names></name> <name><surname>Prasad</surname> <given-names>P.</given-names></name> <name><surname>Al-Dalain</surname> <given-names>T.</given-names></name> <name><surname>Alsadoon</surname> <given-names>O. H.</given-names></name></person-group> (<year>2020</year>). <article-title>A novel enhanced softmax loss function for brain tumour detection using deep learning</article-title>. <source>J. Neurosci. Methods</source> <volume>330</volume>:<fpage>108520</fpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2019.108520</pub-id><pub-id pub-id-type="pmid">31734325</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohammed</surname> <given-names>H.</given-names></name> <name><surname>Rashid</surname> <given-names>T.</given-names></name></person-group> (<year>2022</year>). <article-title>Fox: a fox-inspired optimization algorithm</article-title>. <source>Appl. Intell</source>. <volume>53</volume>, <fpage>1030</fpage>&#x02013;<lpage>1050</lpage>. <pub-id pub-id-type="doi">10.1007/s10489-022-03533-0</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Molnar</surname> <given-names>C.</given-names></name> <name><surname>Casalicchio</surname> <given-names>G.</given-names></name> <name><surname>Bischl</surname> <given-names>B.</given-names></name></person-group> (<year>2020</year>). <source>Interpretable Machine Learning</source>&#x02014;<italic>A Brief History, State-of-the-Art and Challenges</italic> (Springer International Publishing: New York), <fpage>417</fpage>&#x02013;<lpage>431</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-65965-3_28</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Moradi</surname> <given-names>E.</given-names></name> <name><surname>Jalili-Firoozinezhad</surname> <given-names>S.</given-names></name> <name><surname>Solati-Hashjin</surname> <given-names>M.</given-names></name></person-group> (<year>2020</year>). <article-title>Microfluidic organ-on-a-chip models of human liver tissue</article-title>. <source>Acta Biomater</source>. <volume>116</volume>, <fpage>67</fpage>&#x02013;<lpage>83</lpage>. <pub-id pub-id-type="doi">10.1016/j.actbio.2020.08.041</pub-id><pub-id pub-id-type="pmid">32890749</pub-id></citation></ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mutar</surname> <given-names>H.</given-names></name> <name><surname>Jawad</surname> <given-names>M.</given-names></name></person-group> (<year>2023</year>). <article-title>Analytical study for optimization techniques to prolong wsns life</article-title>. <source>Iraqi J. Comput. Commun. Control Syst. Eng</source>. <volume>23</volume>, <fpage>13</fpage>&#x02013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.33103/uot.ijccce.23.2.2</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Naidu</surname> <given-names>G.</given-names></name> <name><surname>Zuva</surname> <given-names>T.</given-names></name> <name><surname>Sibanda</surname> <given-names>E. M.</given-names></name></person-group> (<year>2023</year>). <source>A Review of Evaluation Metrics in Machine Learning Algorithms</source> (<publisher-loc>Springer International Publishing</publisher-loc>: <publisher-name>New York</publisher-name>), <fpage>15</fpage>&#x02013;<lpage>25</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-031-35314-7_2</pub-id></citation>
</ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nikmaneshi</surname> <given-names>M. R.</given-names></name> <name><surname>Firoozabadi</surname> <given-names>B.</given-names></name> <name><surname>Munn</surname> <given-names>L. L.</given-names></name></person-group> (<year>2020</year>). <article-title>A mechanobiological mathematical model of liver metabolism</article-title>. <source>Biotechnol. Bioeng</source>. <volume>117</volume>, <fpage>2861</fpage>&#x02013;<lpage>2874</lpage>. <pub-id pub-id-type="doi">10.1002/bit.27451</pub-id><pub-id pub-id-type="pmid">32501531</pub-id></citation></ref>
<ref id="B48">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Oladejo</surname> <given-names>S. O.</given-names></name> <name><surname>Ekwe</surname> <given-names>S. O.</given-names></name> <name><surname>Ajibare</surname> <given-names>A. T.</given-names></name> <name><surname>Akinyemi</surname> <given-names>L. A.</given-names></name> <name><surname>Mirjalili</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>&#x0201C;Tuning SVMs&#x00027; hyperparameters using the whale optimization algorithm,&#x0201D;</article-title> in <source>Handbook of Whale Optimization Algorithm Variants, Hybrids, Improvements, and Applications Book</source> (<publisher-loc>London</publisher-loc>: <publisher-name>Elsevier</publisher-name>), <fpage>495</fpage>&#x02013;<lpage>521</lpage>. <pub-id pub-id-type="doi">10.1016/B978-0-32-395365-8.00042-7</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Palanivinayagam</surname> <given-names>A.</given-names></name> <name><surname>El-Bayeh</surname> <given-names>C. Z.</given-names></name> <name><surname>Dama&#x00161;evi&#x0010D;ius</surname> <given-names>R.</given-names></name></person-group> (<year>2023</year>). <article-title>Twenty years of machine-learning-based text classification: a systematic review</article-title>. <source>Algorithms</source> <volume>16</volume>:<fpage>236</fpage>. <pub-id pub-id-type="doi">10.3390/a16050236</pub-id></citation>
</ref>
<ref id="B50">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Parimala</surname> <given-names>N.</given-names></name> <name><surname>Muneeswari</surname> <given-names>G.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;A review: binary classification and hybrid segmentation of brain stroke using transfer learning-based approach,&#x0201D;</article-title> in <source>2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT)</source> (<publisher-loc>New Delhi</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1109/ICCCNT56998.2023.10307442</pub-id></citation>
</ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qu</surname> <given-names>Y.</given-names></name> <name><surname>Roitero</surname> <given-names>K.</given-names></name> <name><surname>Barbera</surname> <given-names>D. L.</given-names></name> <name><surname>Spina</surname> <given-names>D.</given-names></name> <name><surname>Mizzaro</surname> <given-names>S.</given-names></name> <name><surname>Demartini</surname> <given-names>G.</given-names></name></person-group> (<year>2022</year>). <article-title>Combining human and machine confidence in truthfulness assessment</article-title>. <source>J. Data Inf. Qual</source>. <volume>15</volume>, <fpage>1</fpage>&#x02013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1145/3546916</pub-id></citation>
</ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Quan</surname> <given-names>Z.</given-names></name> <name><surname>Pu</surname> <given-names>L.</given-names></name></person-group> (<year>2022</year>). <article-title>An improved accurate classification method for online education resources based on support vector machine (SVM): algorithm and experiment</article-title>. <source>Educ. Inf. Technol</source>. <volume>28</volume>, <fpage>8097</fpage>&#x02013;<lpage>8111</lpage>. <pub-id pub-id-type="doi">10.1007/s10639-022-11514-6</pub-id><pub-id pub-id-type="pmid">36536868</pub-id></citation></ref>
<ref id="B53">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rajeswari</surname> <given-names>V.</given-names></name> <name><surname>Sakthi Priya</surname> <given-names>K.</given-names></name></person-group> (<year>2025</year>). <article-title>Ontological modeling with recursive recurrent neural network and crayfish optimization for reliable breast cancer prediction</article-title>. <source>Biomed. Signal Process. Control</source> <volume>99</volume>:<fpage>106810</fpage>. <pub-id pub-id-type="doi">10.1016/j.bspc.2024.106810</pub-id></citation>
</ref>
<ref id="B54">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sarker</surname> <given-names>I. H.</given-names></name></person-group> (<year>2021</year>). <article-title>Machine learning: algorithms, real-world applications and research directions</article-title>. <source>SN Comput. Sci</source>. <volume>2</volume>:<fpage>160</fpage>. <pub-id pub-id-type="doi">10.1007/s42979-021-00592-x</pub-id><pub-id pub-id-type="pmid">33778771</pub-id></citation></ref>
<ref id="B55">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schlegel</surname> <given-names>A.</given-names></name> <name><surname>Mergental</surname> <given-names>H.</given-names></name> <name><surname>Fondevila</surname> <given-names>C.</given-names></name> <name><surname>Porte</surname> <given-names>R. J.</given-names></name> <name><surname>Friend</surname> <given-names>P. J.</given-names></name> <name><surname>Dutkowski</surname> <given-names>P.</given-names></name></person-group> (<year>2023</year>). <article-title>Machine perfusion of the liver and bioengineering</article-title>. <source>J. Hepatol</source>. <volume>78</volume>, <fpage>1181</fpage>&#x02013;<lpage>1198</lpage>. <pub-id pub-id-type="doi">10.1016/j.jhep.2023.02.009</pub-id><pub-id pub-id-type="pmid">37208105</pub-id></citation></ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schmidgall</surname> <given-names>S.</given-names></name> <name><surname>Ziaei</surname> <given-names>R.</given-names></name> <name><surname>Achterberg</surname> <given-names>J.</given-names></name> <name><surname>Kirsch</surname> <given-names>L.</given-names></name> <name><surname>Hajiseyedrazi</surname> <given-names>S. P.</given-names></name> <name><surname>Eshraghian</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>Brain-inspired learning in artificial neural networks: a review</article-title>. <source>APL Mach. Learn</source>. 2. <pub-id pub-id-type="doi">10.1063/5.0186054</pub-id></citation>
</ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Seliya</surname> <given-names>N.</given-names></name> <name><surname>Abdollah Zadeh</surname> <given-names>A.</given-names></name> <name><surname>Khoshgoftaar</surname> <given-names>T. M.</given-names></name></person-group> (<year>2021</year>). <article-title>A literature review on one-class classification and its potential applications in big data</article-title>. <source>J. Big Data</source> <fpage>8</fpage>. <pub-id pub-id-type="doi">10.1186/s40537-021-00514-x</pub-id></citation>
</ref>
<ref id="B58">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sidumo</surname> <given-names>B.</given-names></name> <name><surname>Sonono</surname> <given-names>E.</given-names></name> <name><surname>Takaidza</surname> <given-names>I.</given-names></name></person-group> (<year>2022</year>). <article-title>An approach to multi-class imbalanced problem in ecology using machine learning</article-title>. <source>Ecol. Inform</source>. <volume>71</volume>:<fpage>101822</fpage>. <pub-id pub-id-type="doi">10.1016/j.ecoinf.2022.101822</pub-id></citation>
</ref>
<ref id="B59">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>H.</given-names></name> <name><surname>Schanze</surname> <given-names>K. S.</given-names></name></person-group> (<year>2022</year>). <article-title>Functionalization of water-soluble conjugated polymers for bioapplications</article-title>. <source>ACS Appl. Mater. Interfaces</source> <volume>14</volume>, <fpage>20506</fpage>&#x02013;<lpage>20519</lpage>. <pub-id pub-id-type="doi">10.1021/acsami.2c02475</pub-id><pub-id pub-id-type="pmid">35473368</pub-id></citation></ref>
<ref id="B60">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>Y.</given-names></name> <name><surname>An</surname> <given-names>K.</given-names></name> <name><surname>Su</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>Review: mechanism of herbivores synergistically metabolizing toxic plants through liver and intestinal microbiota</article-title>. <source>Comp. Biochem. Physiol. C Toxicol. Pharmacol</source>. <volume>281</volume>:<fpage>109925</fpage>. <pub-id pub-id-type="doi">10.1016/j.cbpc.2024.109925</pub-id><pub-id pub-id-type="pmid">38643812</pub-id></citation></ref>
<ref id="B61">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tufail</surname> <given-names>S.</given-names></name> <name><surname>Riggs</surname> <given-names>H.</given-names></name> <name><surname>Tariq</surname> <given-names>M.</given-names></name> <name><surname>Sarwat</surname> <given-names>A. I.</given-names></name></person-group> (<year>2023</year>). <article-title>Advancements and challenges in machine learning: a comprehensive review of models, libraries, applications, and algorithms</article-title>. <source>Electronics</source> <volume>12</volume>:<fpage>1789</fpage>. <pub-id pub-id-type="doi">10.3390/electronics12081789</pub-id></citation>
</ref>
<ref id="B62">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Waheed</surname> <given-names>Z.</given-names></name> <name><surname>Humaidi</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Whale optimization algorithm enhances the performance of knee-exoskeleton system controlled by smc</article-title>. <source>Iraqi J. Comput. Commun. Control Syst. Eng</source>. <volume>23</volume>, <fpage>125</fpage>&#x02013;<lpage>135</lpage>. <pub-id pub-id-type="doi">10.33103/uot.ijccce.23.2.10</pub-id></citation>
</ref>
<ref id="B63">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Watson</surname> <given-names>D. S.</given-names></name></person-group> (<year>2023</year>). <article-title>On the philosophy of unsupervised learning</article-title>. <source>Philos. Technol</source>. <volume>36</volume>:<fpage>28</fpage>. <pub-id pub-id-type="doi">10.1007/s13347-023-00635-6</pub-id></citation>
</ref>
<ref id="B64">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wojtowytsch</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Stochastic gradient descent with noise of machine learning type part I: Discrete time analysis</article-title>. <source>J. Nonlinear Sci</source>. <volume>33</volume>:<fpage>45</fpage>. <pub-id pub-id-type="doi">10.1007/s00332-023-09903-3</pub-id></citation>
</ref>
<ref id="B65">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xiao</surname> <given-names>H.</given-names></name> <name><surname>Rasul</surname> <given-names>K.</given-names></name> <name><surname>Vollgraf</surname> <given-names>R.</given-names></name></person-group> (<year>2017</year>). <article-title>Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms</article-title>. <source>arXiv preprint</source> arXiv:1708.07747. <pub-id pub-id-type="doi">10.48550/arxiv.1708.07747</pub-id></citation>
</ref>
<ref id="B66">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xue</surname> <given-names>Y.</given-names></name> <name><surname>Jin</surname> <given-names>G.</given-names></name> <name><surname>Shen</surname> <given-names>T.</given-names></name> <name><surname>Tan</surname> <given-names>L.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name></person-group> (<year>2023</year>). <article-title>Template-guided frequency attention and adaptive cross-entropy loss for UAV visual tracking</article-title>. <source>Chin. J. Aeronaut</source>. <volume>36</volume>, <fpage>299</fpage>&#x02013;<lpage>312</lpage>. <pub-id pub-id-type="doi">10.1016/j.cja.2023.03.048</pub-id></citation>
</ref>
<ref id="B67">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>A.</given-names></name> <name><surname>Meng</surname> <given-names>K.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Pan</surname> <given-names>Y.</given-names></name> <name><surname>Qu</surname> <given-names>W.</given-names></name> <name><surname>Chen</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Absorption, distribution, metabolism, and excretion of nanocarriers <italic>in vivo</italic> and their influences</article-title>. <source>Adv. Colloid Interface Sci</source>. <volume>284</volume>:<fpage>102261</fpage>. <pub-id pub-id-type="doi">10.1016/j.cis.2020.102261</pub-id><pub-id pub-id-type="pmid">32942181</pub-id></citation></ref>
<ref id="B68">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>Z.</given-names></name> <name><surname>Alzubaidi</surname> <given-names>L.</given-names></name> <name><surname>Zhang</surname> <given-names>J.</given-names></name> <name><surname>Duan</surname> <given-names>Y.</given-names></name> <name><surname>Gu</surname> <given-names>Y.</given-names></name></person-group> (<year>2024</year>). <article-title>A comparison review of transfer learning and self-supervised learning: definitions, applications, advantages and limitations</article-title>. <source>Expert Syst. Appl</source>. <volume>242</volume>:<fpage>122807</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.122807</pub-id></citation>
</ref>
</ref-list>
</back>
</article>