<?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.1594372</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>Deep learning-based feature selection for detection of autism spectrum disorder</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Nafisah</surname> <given-names>Ibrahim</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<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/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Mahmoud</surname> <given-names>Nermine</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Ewees</surname> <given-names>Ahmed A.</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Khattap</surname> <given-names>Mohamed G.</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<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/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Dahou</surname> <given-names>Abdelghani</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<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/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Alghamdi</surname> <given-names>Safar M.</given-names></name>
<xref ref-type="aff" rid="aff6"><sup>6</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Fares</surname> <given-names>Ibrahim A.</given-names></name>
<xref ref-type="aff" rid="aff7"><sup>7</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2863513/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Azmi Al-Betar</surname> <given-names>Mohammed</given-names></name>
<xref ref-type="aff" rid="aff8"><sup>8</sup></xref>
<xref ref-type="aff" rid="aff9"><sup>9</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Abd Elaziz</surname> <given-names>Mohamed</given-names></name>
<xref ref-type="aff" rid="aff7"><sup>7</sup></xref>
<xref ref-type="aff" rid="aff10"><sup>10</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1660817/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Statistics and Operations Research, College of Sciences, King Saud University</institution>, <addr-line>Riyadh</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff2"><sup>2</sup><institution>Faculty of Human Science, Galala University</institution>, <addr-line>Suez</addr-line>, <country>Egypt</country></aff>
<aff id="aff3"><sup>3</sup><institution>Department of Computer, Damietta University</institution>, <addr-line>Damietta</addr-line>, <country>Egypt</country></aff>
<aff id="aff4"><sup>4</sup><institution>Technology of Radiology and Medical Imaging Program, Faculty of Applied Health Sciences Technology, Galala University</institution>, <addr-line>Suez</addr-line>, <country>Egypt</country></aff>
<aff id="aff5"><sup>5</sup><institution>School of Computer Science and Technology, Zhejiang Normal University</institution>, <addr-line>Jinhua</addr-line>, <country>China</country></aff>
<aff id="aff6"><sup>6</sup><institution>Department of Mathematics and Statistics, College of Science, Taif University</institution>, <addr-line>Taif</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff7"><sup>7</sup><institution>Department of Mathematics, Faculty of Science, Zagazig University</institution>, <addr-line>Zagazig</addr-line>, <country>Egypt</country></aff>
<aff id="aff8"><sup>8</sup><institution>Artificial Intelligence Research Center (AIRC), College of Engineering and Information Technology, Ajman University</institution>, <addr-line>Ajman</addr-line>, <country>United Arab Emirates</country></aff>
<aff id="aff9"><sup>9</sup><institution>Hourani Center for Applied Scientific Research, Al-Ahliyya Amman University</institution>, <addr-line>Amman</addr-line>, <country>Jordan</country></aff>
<aff id="aff10"><sup>10</sup><institution>Faculty of Computer Science and Engineering, Galala University</institution>, <addr-line>Suez</addr-line>, <country>Egypt</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Alaa Eleyan, American University of the Middle East, Kuwait</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Shijun Li, People&#x00027;s Liberation Army General Hospital, China</p>
<p>Judy Simon, SRM Arts and Science College, India</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Mohamed Abd Elaziz <email>abd_el_aziz_m&#x00040;yahoo.com</email></corresp>
<corresp id="c002">Ibrahim A. Fares <email>ifares.cs&#x00040;gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>25</day>
<month>06</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>8</volume>
<elocation-id>1594372</elocation-id>
<history>
<date date-type="received">
<day>20</day>
<month>03</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>05</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2025 Nafisah, Mahmoud, Ewees, Khattap, Dahou, Alghamdi, Fares, Azmi Al-Betar and Abd Elaziz.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Nafisah, Mahmoud, Ewees, Khattap, Dahou, Alghamdi, Fares, Azmi Al-Betar and Abd Elaziz</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>Autism Spectrum Disorder (ASD) is a neurodevelopmental condition characterized by challenges in communication, social interactions, and repetitive behaviors. The heterogeneity of symptoms across individuals complicates diagnosis. Neuroimaging techniques, particularly resting-state functional MRI (rs-fMRI), have shown potential for identifying neural signatures of ASD, though challenges such as high dimensionality, noise, and small sample sizes hinder their clinical application.</p>
</sec>
<sec>
<title>Methods</title>
<p>This study proposes a novel approach for ASD detection utilizing deep learning and advanced feature selection techniques. A hybrid model combining Stacked Sparse Denoising Autoencoder (SSDAE) and Multi-Layer Perceptron (MLP) is employed to extract relevant features from rs-fMRI data in the ABIDE I dataset, which was preprocessed using the CPAC pipeline. Feature selection is enhanced through an optimized Hiking Optimization Algorithm (HOA) that integrates DynamicOpposites Learning (DOL) and Double Attractors to improve convergence toward the optimal subset of features.</p>
</sec>
<sec>
<title>Results</title>
<p>The proposed model is evaluated using multiple ASD datasets. The performance metrics include an average accuracy of 0.735, sensitivity of 0.765, and specificity of 0.752, surpassing the results of existing state-of-the-art methods.</p>
</sec>
<sec>
<title>Discussion</title>
<p>The findings demonstrate the effectiveness of the hybrid deep learning approach for ASD detection. The enhanced feature selection process, coupled with the hybrid model, addresses limitations in current neuroimaging analyses and offers a promising direction for more accurate and clinically applicable ASD detection models.</p>
</sec></abstract>
<kwd-group>
<kwd>autism detection</kwd>
<kwd>deep learning</kwd>
<kwd>resting-state functional MRI (rs-fMRI)</kwd>
<kwd>feature selection</kwd>
<kwd>Hiking Optimization Algorithm</kwd>
<kwd>dynamic-opposite learning</kwd>
<kwd>double attractors</kwd>
</kwd-group>
<counts>
<fig-count count="4"/>
<table-count count="4"/>
<equation-count count="25"/>
<ref-count count="61"/>
<page-count count="15"/>
<word-count count="10964"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Pattern Recognition</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Autism can be defined as a set of behavioral manifestations that include restricted activities, barriers to communication, as well as social interaction problems. A more accurate term for this condition is autism spectrum disorder (ASD) (Lord et al., <xref ref-type="bibr" rid="B40">2018</xref>). Diagnosis can be made as early as 18 to 24 months, when symptoms become distinguishable from typical development and other cognitive or developmental challenges (Sayers et al., <xref ref-type="bibr" rid="B50">2023</xref>). ASD is classified under neurodevelopmental disorders in the Diagnostic and Statistical Manual of Mental Disorders (DSM-5) and is associated with language impairments, poor social engagement, and limited or repetitive interests and activities. Parents of children with ASD face considerable psychological, physical, and financial burdens (John and Sala, <xref ref-type="bibr" rid="B33">2018</xref>). Various tools have been used to diagnose ASD, such as the Autism Spectrum Quotient (AQ), the Childhood Autism Rating Scale (CARS-2), and the Screening Tool for Autism in Toddlers and Young Children (STAT) (Al-Hendawi et al., <xref ref-type="bibr" rid="B6">2023</xref>). These assessments help identify symptoms and determine the severity of the condition, facilitating early intervention and support. However, there is a pressing need for more advanced and accurate methods, particularly those employing artificial intelligence (AI) to enhance the effectiveness of these traditional techniques.</p>
<p>According to the Global Burden of Disease (GBD) Study, ASD ranks among the six most common developmental disabilities in children under 5 years old. The prevalence of ASD has increased significantly in recent decades, likely due to greater awareness and improved recognition of the condition (Zeidan et al., <xref ref-type="bibr" rid="B60">2022</xref>). In 2010, approximately 52 million children were diagnosed with ASD, translating to a prevalence of 7.6 per 1,000 individuals. In 2018, the Centers for Disease Control and Prevention (CDC) reported that 1 in 59 children had ASD, a figure that rose to 1 in 44 by 2020 (Zeidan et al., <xref ref-type="bibr" rid="B60">2022</xref>). Studies in Europe and the United States suggest that ASD diagnoses have increased markedly over the last two decades, from 0.48% to 3.13% (Zeidan et al., <xref ref-type="bibr" rid="B60">2022</xref>). However, most research on ASD prevalence in Arab countries has focused on wealthier nations. A systematic meta-analysis found that ASD prevalence rates vary across Oman, the UAE, Saudi Arabia, Bahrain, Kuwait, and Qatar (Sayers et al., <xref ref-type="bibr" rid="B50">2023</xref>). In Egypt, ASD prevalence estimates have varied significantly, ranging from 5.4 per 1,000 to as high as 33.6% (Zeidan et al., <xref ref-type="bibr" rid="B60">2022</xref>). However, Egyptian studies are often limited to specific regions, institutional settings, and small sample sizes.</p>
<p>Diagnosing ASD remains challenging due to its frequent co-occurrence with other disorders such as epilepsy, attention deficit hyperactivity disorder (ADHD), and sensory processing disorders, often resulting in delayed or missed diagnoses (Simonoff et al., <xref ref-type="bibr" rid="B52">2008</xref>). Recent research estimates that 1 in 36 children in the United States are diagnosed with ASD, a figure substantially higher than in previous decades, attributable to broadened diagnostic criteria and increased public awareness (Christensen, <xref ref-type="bibr" rid="B12">2016</xref>; Qin et al., <xref ref-type="bibr" rid="B48">2024</xref>). This growing prevalence places considerable strain on healthcare systems, with families often incurring annual therapy and treatment costs exceeding 60, 000 per child, underscoring the critical need for accessible and advanced detection tools (Lavelle et al., <xref ref-type="bibr" rid="B37">2014</xref>; Huda et al., <xref ref-type="bibr" rid="B30">2024</xref>).</p>
<p>Traditional ASD diagnosis primarily relies on parent-reported developmental milestones and behavioral observations, which are inherently subjective and susceptible to cultural and gender biases (Patil et al., <xref ref-type="bibr" rid="B47">2024</xref>; Bahathiq et al., <xref ref-type="bibr" rid="B8">2022</xref>). Consequently, many adolescents and adults, especially females without intellectual disabilities, remain undiagnosed until secondary mental health issues arise (Giarelli et al., <xref ref-type="bibr" rid="B24">2010</xref>). In response, neuroimaging techniques such as resting-state functional MRI (rs-fMRI) have gained prominence by revealing abnormal connectivity patterns within brain networks related to social cognition and sensory processing (Supekar et al., <xref ref-type="bibr" rid="B53">2013</xref>). Yet, bringing such findings to the clinical realm necessitates surmounting the computational challenges: one rs-fMRI dataset comprises tens of thousands of regional connectivity features but scarcely over 1,000 subjects even in public databases like the Autism Brain Imaging Data Exchange (ABIDE) (Di Martino et al., <xref ref-type="bibr" rid="B15">2014</xref>). Therefore, there is an urgent imperative to develop effective diagnostic methods for ASD, which not only facilitate early intervention but also play a crucial role in managing the condition&#x00027;s global prevalence. Implementing such diagnostic tools can provide timely support and resources, ultimately improving outcomes for individuals with ASD and their families.</p>
<p>Machine learning (ML) offers a promising solution by detecting subtle neural signatures associated with ASD. Nonetheless, high dimensionality and noise in neuroimaging data continue to challenge model accuracy (Mellema et al., <xref ref-type="bibr" rid="B41">2022</xref>; Fares et al., <xref ref-type="bibr" rid="B22">2025</xref>). Feature selection (FS) techniques, such as recursive feature elimination, have become essential for removing redundant connections while preserving biomarkers related to social attention and executive function (Mellema et al., <xref ref-type="bibr" rid="B41">2022</xref>; Bahathiq et al., <xref ref-type="bibr" rid="B8">2022</xref>; Fares and Abd Elaziz, <xref ref-type="bibr" rid="B21">2025</xref>). Hybrid approaches that combine deep learning (DL) with FS have demonstrated notable success. For example, methods integrating the Adaptive Bacterial Foraging (ABF) algorithm with Support Vector Machine Recursive Feature Elimination (SVM-RFE) have shown high performance in ASD detection (Lamani and Benadit, <xref ref-type="bibr" rid="B36">2023</xref>). Similarly, convolutional neural networks (CNNs) hybridized with Elephant Herding Optimization (EHO) algorithms have been applied to multiple fMRI datasets, yielding promising results in identifying ASD patients (Chola Raja and Kannimuthu, <xref ref-type="bibr" rid="B11">2023</xref>).</p>
<p>However, despite such progress, various challenges remain. The biological heterogeneity of ASD implies that no neural marker is universally applicable; connectivity changes differ between toddlers and adults, between verbal and non-verbal individuals, or between those with and without genetic syndromes (Alzubaidi et al., <xref ref-type="bibr" rid="B7">2023</xref>). Reproducibility is also constrained by small sample sizes and heterogeneous preprocessing pipelines at imaging sites (Schielen et al., <xref ref-type="bibr" rid="B51">2024</xref>; Chola Raja and Kannimuthu, <xref ref-type="bibr" rid="B11">2023</xref>).</p>
<p>This paper aims to propose a modified version of the autism detection model based on the strengths of DL and FS techniques. In general, the DL model combining a Stacked Sparse Denoising Autoencoder (SSDAE) and a Multi-Layer Perceptron (MLP) is used to extract the relevant features (Liu et al., <xref ref-type="bibr" rid="B39">2024</xref>). Following by using an enhanced version of Hiking Optimization Algorithm (HOA) as an FS technique (Oladejo et al., <xref ref-type="bibr" rid="B45">2024</xref>). This enhancement is conducted through using Dynamic Opposites Learning (DOL) (Ahmad et al., <xref ref-type="bibr" rid="B5">2022</xref>) and Double Attractors (He and Lu, <xref ref-type="bibr" rid="B27">2022</xref>) to enhance the convergence toward the optimal subset of relevant features. These approaches have been established in their performance in different applications. For example, DOL has applied engineering problems (Cao et al., <xref ref-type="bibr" rid="B9">2023</xref>; Xu et al., <xref ref-type="bibr" rid="B57">2020</xref>), job shop scheduling (Yang et al., <xref ref-type="bibr" rid="B58">2022</xref>), IIR system identification (Niu Y. et al., <xref ref-type="bibr" rid="B44">2022</xref>), and skin cancer detection (Dahou et al., <xref ref-type="bibr" rid="B14">2023</xref>). Has applied to enhance design of structures (Kaveh and Yousefpoor, <xref ref-type="bibr" rid="B34">2024</xref>), color image compression (Yao et al., <xref ref-type="bibr" rid="B59">2025</xref>), and KELM diabetes classification (Zhu et al., <xref ref-type="bibr" rid="B61">2025</xref>).</p>
<p>The contributions of this study can be stated as follows:</p>
<list list-type="bullet">
<list-item><p>Development of an autism detection approach using DL and an enhanced FS model based on a modified version of the HOA algorithm.</p></list-item>
<list-item><p>Integration of SSDAE and MLP for learning feature representations from rs-fMRI data and performing feature extraction.</p></list-item>
<list-item><p>Introducing a modified version of HOA using the dynamic opposite-based learning and double attractors.</p></list-item>
<list-item><p>Evaluation of the performance of the developed autism detection technique on multiple datasets and comparison with other well-known methods.</p></list-item>
</list>
<p>The organization of this paper is given as follows: Section 2 introduces the related works of using different AI models to detect autism. Section 3 presents the basic information of the Hiking Optimization Algorithm (HOA), Dynamic-Opposite Learning (DOL), and Double Attractors. The stages of the proposed autism detection model are presented in section 4. The experimental results and discussion are introduced in Section 5. Finally, the conclusion and future works are presented in Section 6.</p>
</sec>
<sec id="s2">
<title>2 Related works</title>
<p>The development of AI-based models for detecting ASD has seen notable progress, particularly with the integration of FS techniques and DL algorithms. Over the past decade, various studies have explored innovative methods for leveraging neuroimaging data, such as rs-fMRI, in combination with DL approaches. This section will review the most influential works that have contributed to the development of ASD detection models, highlighting key advancements in both AI methodologies and neuroimaging techniques used in ASD diagnosis.</p>
<p>Earlier work of Di Martino et al. (<xref ref-type="bibr" rid="B15">2014</xref>) and Guan and Liu (<xref ref-type="bibr" rid="B25">2021</xref>) described Autism Brain Imaging Data Exchange (ABIDE), a multi-site rs-fMRI repository, allowing for high-dimensional analysis of functional connectivity in ASD, and driving development in ML techniques. Nielsen et al. (<xref ref-type="bibr" rid="B42">2013</xref>) displayed multisite fMRI classification with SVMs, but with high-dimensional and site-related biases limiting it. The DL transition began with graph-based techniques. Parisot et al. (<xref ref-type="bibr" rid="B46">2018</xref>) started with graph convolutional networks (GCNs) representing functional connectivity in brain graphs, with 70% accuracy in ABIDE through encoding non-linear relationships between regions of interest (ROIs). In parallel, Heinsfeld et al. (<xref ref-type="bibr" rid="B28">2018</xref>) utilized convolutional neural networks (CNNs) for raw fMRI time-series, with renewed emphasis on automatization of feature extraction in an effort to reduce manual ROI selection. Hybrid architectures soon dominated: Eslami et al. (<xref ref-type="bibr" rid="B19">2019</xref>) combined SVM-RFE FS with 3D CNNs, and 88% accuracy in ABIDE through isolating discriminative connections in the default mode network (DMN). Similarly, Wang et al. (<xref ref-type="bibr" rid="B56">2020</xref>) designed a multi-atlas feature ensemble scheme and showed FS preceding training with DL aided generalizability improvement over ABIDE sites.</p>
<p>FS techniques specific to neuroimaging data gained prominence. Niu X. et al. (<xref ref-type="bibr" rid="B43">2022</xref>) optimized site-wise feature reproducibility with LASSO regularization, while Abraham et al. (<xref ref-type="bibr" rid="B3">2017</xref>) proposed a deep embedded feature selection (DEFS) algorithm, training FS layers and autoencoders together, and discovering cerebellar and somatosensory connectivity to be significant biomarkers. For multi-modal data, Abbas et al. (<xref ref-type="bibr" rid="B1">2023</xref>) merged structural MRI and fMRI features with attention, mapping 87% accuracy for ABIDE-II. Graph-methods saw a quantum jump with Li et al. (<xref ref-type="bibr" rid="B38">2020</xref>), utilizing graph neural networks (GNNs) for investigating modular connectivity profiles, mapping 80% accuracy, and indicating thalamocortical impairment in ASD.</p>
<p>Further, hybrid meta-heuristic algorithms along with CNNs achieved 98.6% on the ABIDE dataset (Chola Raja and Kannimuthu, <xref ref-type="bibr" rid="B11">2023</xref>). Likewise, DL models like YOLOv8 while performing the analysis on facial images, showed 89.64% classification accuracy with a F1-score of 89% (Gautam et al., <xref ref-type="bibr" rid="B23">2023</xref>). The proposed adaptive bacterial foraging optimization along with SVM-RFE and mRMR and followed by the graph convolutional network classifier obtained an accuracy of 97.512% (Lamani and Benadit, <xref ref-type="bibr" rid="B36">2023</xref>).</p>
<p>Liu et al. (<xref ref-type="bibr" rid="B39">2024</xref>) introduced MADE-for-ASD, which integrates the power of various brain atlases and demographic information with fMRI. It presented an accuracy as high as 96.40% by highlighting the essential ASD-relevant brain regions. Furthermore, this efficient model is extendable and available openly for public adoption. A meta-analysis in Ding et al. (<xref ref-type="bibr" rid="B16">2024</xref>) emphasized the classification performance of these deep-learning models in ascertaining the disorder amongst children; thereby it may be exploited in extending present diagnostic methodologies. Chen et al. (<xref ref-type="bibr" rid="B10">2024</xref>) introduced DeepASD, an adversary-regularized GNN, aligning feature distributions between modalities (fMRI &#x0002B; SNPs), and mapping state-of-the-art 93% AUC-ROC performance for ABIDE-II. While the study Joe (<xref ref-type="bibr" rid="B32">2024</xref>) proposed using AI robots integrated with visual strategies to enhance social and communication skills in children with ASD. The author employed interactive robots to deliver structured visual stimuli and personalized learning experiences to improve engagement and skill retention. The author used a tuned CNN model, and it achieved an accuracy of 96% in the detection of ASD.</p>
<p>The study of Khan and Katarya (<xref ref-type="bibr" rid="B35">2025</xref>) proposes a new scheme, WS-BiTM, fusing White Shark Optimization (WSO) for FS and Bidirectional Long Short-Term Memory (Bi-LSTM) for classification for ASD improvement. WSO is utilized for selecting significant features out of sets of datasets for autism screening, and then these are processed with Bi-LSTM for efficient sequential processing. WSO-Bi-LSTM overcomes overfitting and computational efficiency issues effectively. Baseline algorithms outdo through comparative studies with 97.6%, 96.2%, and 96.4% accuracy for datasets for toddlers, adults, and kids, respectively, and proving its efficiency as a dependable tool for ASD classification.</p>
<p>The contribution of Abu-Doleh et al. (<xref ref-type="bibr" rid="B4">2025</xref>) introduces a two-step model for improving ASD classification with volumetric brain MRI images. First, subcortical structures are extracted and processed with a 3D autoencoder in order to detect regions of interest for analysis for ASD-related analysis. Secondly, these regions are classified with a Siamese Convolutional Neural Network (SCNN). SCNN achieved 66% accuracy with regions determined with the Mutual Information FS criterion. This contribution identifies the potential for fusing SCNNs and autoencoders for brain MRI-based ASD improvement. Jabbar et al. (<xref ref-type="bibr" rid="B31">2025</xref>) develop an ML model for early ASD screening by combining parent-reported questionnaires plus video analysis of child behavior. They achieved high accuracy through feature engineering by using data balancing techniques. Their hybrid algorithm outperforms traditional tools in AUC (0.92). The solution enables low-cost, mobile-friendly screening, particularly beneficial in resource-limited settings where clinical access is restricted.</p>
</sec>
<sec id="s3">
<title>3 Background</title>
<p>Optimization algorithms play a crucial role in enhancing the effectiveness of AI models by improving FS processes and model performance. Among these, the Hiking Optimization Algorithm (HOA) has shown promise as an effective tool for solving complex optimization problems, due to its human-inspired search mechanism that mirrors the dynamics of hiking. This section will introduce the key concepts behind HOA, Dynamic-Opposite Learning (DOL), and Double Attractors, which serve as the foundational techniques for the proposed autism detection model.</p>
<sec>
<title>3.1 Hiking Optimization Algorithm</title>
<p>The Hiking Optimization Algorithm (HOA) is a metaheuristic inspired by hiking, where hikers navigate varying terrains to reach a peak (Oladejo et al., <xref ref-type="bibr" rid="B45">2024</xref>). Similar to the unpredictable landscapes of hiking, optimization problems feature complex search spaces. HOA uses Tobler&#x00027;s Hiking Function (THF) to model hikers&#x00027; movement, considering terrain elevation and distance. This approach mimics hikers&#x00027; strategies of avoiding steep paths to maintain a steady pace, helping agents in HOA find optimal solutions while avoiding local optima. The algorithm&#x00027;s human-inspired structure makes it an efficient tool for solving complex optimization problems.</p>
<sec>
<title>3.1.1 Initialization</title>
<p>In the first step of the HOA, the initial positions of the hikers&#x02014;analogous to search agents&#x02014;are established randomly. This method ensures diversity in the search space, promoting a broad exploration of potential solutions. The position of each hiker, denoted as <italic>X</italic><sub><italic>i</italic></sub>(<italic>t</italic>), is determined within a defined search space. This space is bounded by the upper limit <italic>UB</italic><sub><italic>i</italic></sub> and the lower limit <italic>LB</italic><sub><italic>i</italic></sub> for each dimension <italic>j</italic> of the decision variable. The initialization process follows the equation:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mi>L</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mtext>&#x000A0;rand</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>L</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>
<p>where rand() is a uniformly distributed random variable within the range [0, 1].</p>
</sec>
<sec>
<title>3.1.2 Modeling hiker speed using Tobler&#x00027;s Hiking Function</title>
<p>The next step is incorporating the widely recognized <italic>Tobler&#x00027;s Hiking Function</italic> (THF), a mathematical model formulated by the geographer Waldo Tobler. THF is an exponential function that estimates hikers&#x00027; velocity based on the terrain&#x00027;s steepness. This function plays a crucial role in HOA, as it simulates the movement dynamics of search agents (hikers) within the optimization space.</p>
<p>The velocity of a hiker <italic>i</italic> at iteration <italic>t</italic>, denoted as <inline-formula><mml:math id="M2"><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>W</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, is computed using 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:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>W</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>6</mml:mn><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>3</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>05</mml:mn><mml:mo>|</mml:mo></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>S</italic><sub><italic>i, t</italic></sub> represents the slope of the terrain at the hiker&#x00027;s position. The slope itself is determined by the elevation change (<italic>dh</italic>) and the distance traveled (<italic>dx</italic>), given by:</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>S</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo class="qopname">tan</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003B8;<sub><italic>i, t</italic></sub> is the inclination angle of the terrain, constrained within the range [0&#x000B0;, 50&#x000B0;].</p>
<p>The integration of THF into HOA ensures that the movement of hikers (agents) is guided by realistic terrain-based constraints. In essence, steeper inclinations result in slower movement speeds, mirroring real-world hiking behaviors. By leveraging this function, HOA dynamically adjusts the step sizes of agents in the optimization process, enhancing both exploration and exploitation capabilities.</p>
</sec>
<sec>
<title>3.1.3 Exploitation phase</title>
<p>The exploitation phase of the HOA is responsible for refining the search process by guiding hikers (agents) toward promising regions in the optimization landscape. This phase leverages the social intelligence of hikers as a group and their individual cognitive abilities. A key parameter known as the sweep factor (SF) plays a crucial role in defining the balance between exploitation and exploration. The SF regulates the influence of the lead hiker on the movement of other hikers, controlling the extent of their deviation from the leader&#x00027;s trajectory. A higher SF value directs the HOA toward the exploitation phase, allowing agents to converge toward promising solutions. Conversely, a lower SF encourages exploration, enabling the algorithm to investigate diverse regions of the search space. The velocity of a hiker <italic>i</italic> at iteration <italic>t</italic> is updated by:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>W</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:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>W</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:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B3;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">best</mml:mtext></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B1;</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:mi>t</mml:mi></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>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003B3; is a random number within the range [0, 1]. <inline-formula><mml:math id="M6"><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>W</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M7"><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>W</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> represent the actual and initial velocities of the hiker, respectively. The variable <italic>X</italic><sub>best</sub> corresponds to the position of the lead hiker, representing the best solution found so far. Additionally, &#x003B1;<sub><italic>i</italic></sub>(<italic>t</italic>) denotes the sweep factor (SF), which takes values in the range [1, 3].</p>
<p>The updated position of hiker <italic>i</italic> at the next iteration, incorporating its velocity, is expressed as:</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>X</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:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>X</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:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>W</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The complete implementation details of the Hiking Optimization Algorithm, including its initialization, velocity updates, and search mechanisms, are outlined in the pseudocode provided in <xref ref-type="fig" rid="F5">Algorithm 1</xref>.</p>
<fig id="F5" position="float">
<label>Algorithm 1</label>
<caption><p>Pseudo-code of the HOA algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1594372-g0005.tif"/>
</fig>
</sec>
</sec>
<sec>
<title>3.2 Dynamic-opposite learning</title>
<p>Metaheuristic optimization algorithms often struggle with premature convergence, leading to stagnation in local optima. Dynamic-Opposite Learning (DOL) is a recent strategy designed to enhance both exploration and exploitation by dynamically adjusting the search space (Xu et al., <xref ref-type="bibr" rid="B57">2020</xref>). DOL builds upon Opposite-Based Learning (OBL) (Wang et al., <xref ref-type="bibr" rid="B55">2011</xref>; Rahnamayan et al., <xref ref-type="bibr" rid="B49">2007</xref>; El-Abd, <xref ref-type="bibr" rid="B17">2011</xref>), which improves convergence by considering opposite solutions (Tizhoosh, <xref ref-type="bibr" rid="B54">2005</xref>). Traditional OBL methods refine this concept but remain susceptible to local optima (Rahnamayan et al., <xref ref-type="bibr" rid="B49">2007</xref>; Ergezer et al., <xref ref-type="bibr" rid="B18">2009</xref>). To overcome this, DOL introduces an asymmetric and dynamically expanding search space, increasing population diversity and reducing stagnation. A random opposite number is used to create asymmetry, preventing premature convergence, while a weighting factor balances exploration and exploitation. By integrating DOL into metaheuristic frameworks, optimization performance is significantly enhanced, making it a powerful approach for solving complex problems.</p>
<p>The concept behind DOL is to expand the search space dynamically, rather than symmetrically, by introducing a random opposite number <italic>X</italic><sup><italic>RO</italic></sup>, defined as:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mtext class="textrm" mathvariant="normal">&#x000A0;rand&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x02003;where&#x000A0;rand&#x000A0;</mml:mtext><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E7"><label>(7)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>D</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where [<italic>a, b</italic>] represents the search domain of <italic>X</italic>. <italic>D</italic> is the dimension of <italic>X</italic>. In general, replacing the standard opposite number <italic>X</italic><sup><italic>O</italic></sup> with <italic>X</italic><sup><italic>RO</italic></sup> transforms the search into an asymmetric adaptive process, preventing premature convergence. A new candidate solution <italic>X</italic><sup><italic>DO</italic></sup> is then selected as:</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mtext class="textrm" mathvariant="normal">&#x000A0;rand</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>To maintain feasibility, <italic>X</italic><sup><italic>DO</italic></sup> is adjusted if it falls outside the search boundaries [<italic>a, b</italic>]. However, as iterations progress, the search space may shrink, reducing the algorithm&#x00027;s exploitation capability. To counteract this, a weighting factor <italic>w</italic> is introduced, refining the final formulation:</p>
<disp-formula id="E9"><label>(9)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mi>X</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>w</italic> is a positive constant ensuring an optimal balance between exploration and exploitation.</p>
<sec>
<title>3.2.1 Dynamic opposite number</title>
<p>Let <italic>X</italic> be a real number in the search space, where <italic>X</italic>&#x02208;[<italic>a, b</italic>]. To introduce dynamic adaptation, the dynamic opposite number <italic>X</italic><sup><italic>DO</italic></sup> is defined as:</p>
<disp-formula id="E10"><label>(10)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">&#x000A0;rand&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>X</italic><sup><italic>O</italic></sup> represents the opposite number of <italic>X</italic> as defined earlier in the OBL in <xref ref-type="disp-formula" rid="E7">Equation 7</xref>, <italic>w</italic> is a positive weighting factor controlling the expansion range, and <italic>rand</italic> is a random value sampled from (0, 1). The introduction of <italic>w</italic> ensures a balanced adaptation, preventing excessive search space contraction while enhancing exploration capabilities.</p>
</sec>
<sec>
<title>3.2.2 Dynamic opposite point in multi-dimensional space</title>
<p>Extending the DOL approach to higher dimensions, consider <italic>X</italic> &#x0003D; (<italic>X</italic><sub>1</sub>, <italic>X</italic><sub>2</sub>, &#x02026;, <italic>X</italic><sub><italic>D</italic></sub>) as a point in a <italic>D</italic>-dimensional search space, where each coordinate <italic>X</italic><sub><italic>j</italic></sub> falls within the predefined range [<italic>a</italic><sub><italic>j</italic></sub>, <italic>b</italic><sub><italic>j</italic></sub>]. The opposite point in this space is denoted by <inline-formula><mml:math id="M14"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>, as defined in <xref ref-type="disp-formula" rid="E7">Equation 7</xref>. The dynamic opposite point is formulated as:</p>
<disp-formula id="E11"><label>(11)</label><mml:math id="M15"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">&#x000A0;rand&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">rand&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mi>D</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
</sec>
<sec>
<title>3.2.3 DOL-based optimization</title>
<p>The proposed DOL strategy is applied iteratively to guide the optimization process. Given a population of candidate solutions <italic>X</italic>, each point undergoes transformation based on the dynamic opposite learning mechanism. The newly generated opposite candidates <inline-formula><mml:math id="M16"><mml:mrow><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are assessed based on their objective function values.</p>
<p>The selection process follows a simple criterion:</p>
<p>If the fitness of <italic>X</italic><sup><italic>DO</italic></sup> surpasses that of <italic>X</italic>, the new candidate is accepted. Otherwise, <italic>X</italic><sup><italic>DO</italic></sup> is discarded, and the original <italic>X</italic> is retained.</p>
<p>To ensure boundary constraints are maintained, each <inline-formula><mml:math id="M17"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> must satisfy:</p>
<disp-formula id="E12"><label>(12)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><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:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mi>D</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>If any <inline-formula><mml:math id="M19"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>O</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> falls outside this range, it is reinitialized as a random value within [<italic>a</italic><sub><italic>j</italic></sub>, <italic>b</italic><sub><italic>j</italic></sub>].</p>
</sec>
</sec>
<sec>
<title>3.3 Double attractors</title>
<p>In this section, we introduce Double attractors as one of the most important operators that are used to enhance the balancing between exploration and exploitation (He and Lu, <xref ref-type="bibr" rid="B27">2022</xref>). In general, the solutions in the metaheuristic algorithms are updated their values according to the shared information and personal knowledge. Moreover, the solutions during the updating process move toward the feasible solution that is considered as an attraction point. However, the process of balance between the main phases of MH techniques, named exploration and exploitation, is considered one of the main challenges that the MH algorithms suffer from them. Therefore, DA is used to handle this challenge, and this is achieved through using two attractors named <italic>L</italic>1 and <italic>L</italic>2.</p>
<p>Following (He and Lu, <xref ref-type="bibr" rid="B27">2022</xref>), <italic>L</italic>1 is defined as in <xref ref-type="disp-formula" rid="E13">Equation 13</xref>.</p>
<disp-formula id="E13"><label>(13)</label><mml:math id="M20"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:msub><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></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>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In <xref ref-type="disp-formula" rid="E13">Equation 13</xref>, <italic>p</italic><sub><italic>ij</italic></sub>(<italic>t</italic>) indicates the historical best value at <italic>j</italic>th dimension of <italic>X</italic><sub><italic>i</italic></sub> the iteration <italic>t</italic>. Whereas <italic>p</italic><sub><italic>bj</italic></sub>(<italic>t</italic>) indicates the value of <italic>X</italic><sub><italic>b</italic></sub> among dimension <italic>j</italic> among <italic>t</italic>th iteration. &#x003D5;<sub>1</sub> is a parameter that linearly decreased over iterations and it is defined.</p>
<disp-formula id="E14"><label>(14)</label><mml:math id="M21"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mo>-</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>9</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>T</italic> is the maximum number of iterations.</p>
<p>Moreover, the second attractor <italic>L</italic>2 is defined as:</p>
<disp-formula id="E15"><label>(15)</label><mml:math id="M22"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:msub><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></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>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003D5;<sub>2</sub> denotes a constant parameter.</p>
<p>Finally, the solution can be updated using either <italic>L</italic>1 and <italic>L</italic>2 as defined in <xref ref-type="disp-formula" rid="E16">Equation 16</xref>.</p>
<disp-formula id="E16"><label>(16)</label><mml:math id="M23"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msubsup><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msubsup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="E17"><label>(17)</label><mml:math id="M24"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>L</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mfrac><mml:mn>1</mml:mn><mml:mi>u</mml:mi></mml:mfrac><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>L</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mfrac><mml:mn>1</mml:mn><mml:mi>u</mml:mi></mml:mfrac><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="E18"><label>(18)</label><mml:math id="M25"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>L</mml:mi><mml:msub><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mfrac><mml:mn>1</mml:mn><mml:mi>u</mml:mi></mml:mfrac><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>L</mml:mi><mml:msub><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007C;</mml:mo><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mfrac><mml:mn>1</mml:mn><mml:mi>u</mml:mi></mml:mfrac><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
</sec>
</sec>
<sec id="s4">
<title>4 Proposed method</title>
<p>Building on the foundational concepts of HOA, DOL, and Double Attractors introduced in the previous section, this section presents the developed autism detection model. The model integrates DL techniques with the modified HOA to enhance the diagnostic process by extracting meaningful features from raw data and optimizing FS for improved diagnostic accuracy.</p>
<sec>
<title>4.1 Feature extraction process</title>
<p>The feature extraction process in the proposed framework involves leveraging multi-atlas fMRI data to identify discriminative features for ASD diagnosis following the proposed model and process in Liu et al. (<xref ref-type="bibr" rid="B39">2024</xref>). Functional connectivity matrices are derived from three brain atlases (AAL, CC, EZ) using Pearson correlation coefficients, which are flattened into one-dimensional vectors. These vectors are input into a Stacked Sparse Denoising Autoencoder (SSDAE) for pre-training, where sparsity and noise constraints are applied to learn robust feature representations. The SSDAE compresses the data into a reduced encoding, which is then fine-tuned using the MLP. The final 100-unit layer of the MLP extracts learned features, which are subsequently processed by an FS algorithm to identify the most relevant features for classification. This approach ensures the extraction of meaningful and discriminative features from multi-atlas fMRI data, optimizing the model for ASD diagnosis.</p>
</sec>
<sec>
<title>4.2 Feature selection process</title>
<p>The modified HOA plays a pivotal role in the FS process by refining the search for the most relevant features that contribute to accurate ASD detection. By integrating dynamic OBL, HOA enhances the ability to exploit known good solutions while avoiding local optima. The introduction of DA further improves the balance between exploration and exploitation, allowing the algorithm to explore diverse regions of the feature space and converge more effectively on the most discriminative features for ASD classification. This makes the HOA an essential tool for improving the diagnostic accuracy of the proposed model, as it ensures that only the most relevant and informative features are used for classification, which directly impacts the detection of ASD.</p>
<p>Followed by generating a set of solutions <italic>X</italic> and using its opposition using DOL as defined in <xref ref-type="disp-formula" rid="E11">Equation 11</xref>. Then determining the best <italic>N</italic> solutions from <italic>X</italic>&#x0222A;<italic>X</italic><sup><italic>DOL</italic></sup> according to their fitness value. The next process is to update the solutions <italic>X</italic> using the operators of HOA and DA. This process of updating is conducted until the stop conditions are met. The details of the proposed model are given as follows.</p>
<sec>
<title>4.2.1 First stage</title>
<p>This stage aims to generate a suitable population <italic>X</italic> which has <italic>N</italic> solutions based on the DOL techniques. To achieve this task, the first step is to use <xref ref-type="disp-formula" rid="E19">Equation 19</xref> to set the initial value for these solutions.</p>
<disp-formula id="E19"><label>(19)</label><mml:math id="M26"><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:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>D</italic> denotes the dimension of <italic>X</italic> and <italic>r</italic><sub>5</sub>&#x02208;[0, 1] refers to a random value. We apply <xref ref-type="disp-formula" rid="E11">Equation 11</xref> to generate the opposite solutions <italic>X</italic><sup><italic>DO</italic></sup> for each <italic>X</italic><sub><italic>i</italic></sub>, <italic>i</italic> &#x0003D; 1, 2, ..., <italic>N</italic>. Then we compute the fitness value for <italic>X</italic> and <italic>X</italic><sup><italic>DO</italic></sup>, then select the best <italic>N</italic> solutions from <italic>X</italic>&#x0222A;<italic>X</italic><sup><italic>DO</italic></sup> to form the initial solution <italic>X</italic>. In general, this step leads to enhancing the convergence rate toward the optimal solution.</p>
</sec>
<sec>
<title>4.2.2 Second stage</title>
<p>This second stage aims to enhance the value of solutions <italic>X</italic> based on the operators of HOA and DA. This process is conducted by determining the best solution <italic>X</italic><sub><italic>b</italic></sub>.</p>
<p>The next step is to determine the selected features using the current solution <italic>X</italic><sub><italic>i</italic></sub>, and this is achieved by using the binary of <italic>X</italic><sub><italic>i</italic></sub> as defined in the following formula.</p>
<disp-formula id="E20"><label>(20)</label><mml:math id="M27"><mml:mrow><mml:mi>B</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mo>&#x0003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>In <xref ref-type="disp-formula" rid="E20">Equation 20</xref>, <italic>r</italic><sub>6</sub>&#x02208;[0, 1] denotes a random value. After that, we evaluate the quality of the selected features which correspond to the ones in <italic>BX</italic><sub><italic>i</italic></sub>, and this is performed through computing the fitness value (<italic>Fit</italic><sub><italic>i</italic></sub>) as in the following equation.</p>
<disp-formula id="E21"><label>(21)</label><mml:math id="M28"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x003C1;</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>&#x003B3;</mml:mi><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:mi>&#x003C1;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mi>B</mml:mi><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In <xref ref-type="disp-formula" rid="E21">Equation 21</xref>, |<italic>BX</italic><sub><italic>ij</italic></sub>| refers to the number of selected features. &#x003B3; denotes the error of classification using the KNN classifier (we set <italic>K</italic> &#x0003D; 5). &#x003C1;&#x02208;[0, 1] refers to a parameter used to balance between the two terms of <xref ref-type="disp-formula" rid="E21">Equation 21</xref>.</p>
<p>The best <italic>X</italic><sub><italic>b</italic></sub> solution with the best <italic>Fit</italic> is then identified. Then we apply the operators of HOA as defined in <xref ref-type="disp-formula" rid="E2">Equations 2</xref>&#x02013;<xref ref-type="disp-formula" rid="E5">5</xref>. Then we used the DA to enhance <italic>X</italic>, however, to reduce the time complexity of this stage, we used the following formula.</p>
<disp-formula id="E22"><label>(22)</label><mml:math id="M29"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mn>20</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>The steps of this stage are repeated until the stop conditions are met. Then the best solution is returned as the output of this stage.</p>
</sec>
<sec>
<title>4.2.3 Third stage</title>
<p>Finally, we used the testing set to assess the quality of the selected features, and this was conducted by generating the binary version of <italic>X</italic><sub><italic>b</italic></sub> is obtained using <xref ref-type="disp-formula" rid="E20">Equation 20</xref>. Then we select the relevant features from the testing set that correspond to the ones in <italic>BX</italic><sub><italic>b</italic></sub> and assess the quality of those features by computing the performance metrics of the predicted values obtained using the trained KNN model. The steps of the developed model are given in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Phases of the developed autism detection based on the MHOA algorithm.</p></caption>
<alt-text>Flowchart illustrating a process for feature extraction and solution optimization. It begins with applying SSDAE and MLP to a dataset, split into training and testing sets. The MHOA algorithm sets initial parameters, builds a population, and calculates fitness to find the best solution. The loop involves updating parameters and checking a stop condition. Selected features from the testing set are assessed for performance before concluding.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1594372-g0001.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s5">
<title>5 Experimental results and discussion</title>
<p>Having outlined the architecture and processes of the proposed autism detection model, this section presents the results of the proposed autism detection model, including a comprehensive analysis of its performance. The effectiveness of the model is evaluated through various experiments, and its performance is compared with existing models to assess its strengths and limitations.</p>
<sec>
<title>5.1 Dataset preparation</title>
<p>The rs-fMRI data used in this study were sourced from the ABIDE I dataset, comprising 505 autistic individuals and 530 typical controls (TCs). The dataset includes subjects with ASD and TC, with age ranges from 10.0 to 35.0 years for ASD and 10.0 to 33.7 years for TC across different sites. The data is preprocessed using the Configurable Pipeline for the Analysis of Connectomes (CPAC) pipeline, which includes essential steps such as slice timing correction, voxel intensity normalization, motion correction, nuisance signal removal, global signal regression, band-pass filtering, and spatial registration. After preprocessing and quality control, the final dataset consists of 1,035 samples distributed as follows: 623 samples for the training set, 308 samples for the validation set, and 104 samples for the test set. Functional connectivity matrices are generated using three brain atlases (AAL, CC, EZ), and the mean time series for each ROI is calculated following (Liu et al., <xref ref-type="bibr" rid="B39">2024</xref>). These matrices are flattened into one-dimensional vectors, forming the input for the feature extraction model. Finally, we derived three datasets from ABIDE I based on the EZ, AAL, and CC atlases, designated as Dataset-1, Dataset-2, and Dataset-3, respectively.</p>
</sec>
<sec>
<title>5.2 Model configurations</title>
<p>The model architecture integrates an SSDAE followed by an MLP. For the SSDAE, pre-training was conducted with a learning rate of 0.001 using gradient descent (GD) and a batch size of 100. Sparsity and noise constraints were applied to enhance robust feature learning, with dropout set to 0.5 to reduce overfitting. The SSDAE comprises two autoencoder layers: the first encoding layer has 1,000 units, and the second reduces the representation to 600 units. The MLP was subsequently fine-tuned with a learning rate of 0.0005 using stochastic gradient descent (SGD) and a smaller batch size of 10 to allow for finer updates. Dropout was set to 0.3 for the MLP. The final layer of the MLP includes 100 units, outputting the learned features for each atlas. The number of training iterations was selected based on convergence behavior: the first SSDAE autoencoder was trained for 700 iterations, and the second for 1,000 iterations to ensure adequate reconstruction performance.</p>
</sec>
<sec>
<title>5.3 Evaluation metrics</title>
<p>The effectiveness of the suggested method, along with the performance of the comparison algorithms, is assessed using the following evaluation metrics:</p>
<list list-type="bullet">
<list-item><p>Accuracy:</p></list-item>
</list>
<disp-formula id="E23"><label>(23)</label><mml:math id="M30"><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>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</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>
<list list-type="simple">
<list-item><p>In this formula, <italic>TP</italic> and <italic>TN</italic> denote the true positive and true negative counts, while <italic>FP</italic> and <italic>FN</italic> represent the false positives and false negatives, respectively.</p></list-item>
</list>
<list list-type="bullet">
<list-item><p>Sensitivity:</p></list-item>
</list>
<disp-formula id="E24"><label>(24)</label><mml:math id="M31"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Sensitivity</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>
<list list-type="bullet">
<list-item><p>Standard Deviation (StDev):</p></list-item>
</list>
<disp-formula id="E25"><label>(25)</label><mml:math id="M32"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">StDev</mml:mtext><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><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:msup><mml:mrow><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>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msqrt></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<list list-type="simple">
<list-item><p>Where, <italic>N</italic> refers to the total number of runs, <italic>x</italic><sub><italic>i</italic></sub> denotes the individual values, and <inline-formula><mml:math id="M33"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> is the mean of those values.</p></list-item>
</list>
</sec>
<sec>
<title>5.4 Results and discussion</title>
<p>To assess the effectiveness of the proposed MHOA-based ASD detection model, experiments were conducted using multiple datasets derived from the ABIDE I database. Each dataset was preprocessed using a consistent pipeline to extract functional connectivity matrices, which were then transformed into feature vectors for analysis. The experiments used identical training and evaluation procedures across all algorithms to ensure a fair comparison.</p>
<p>The MHOA method was compared against six metaheuristic optimization algorithms: Hiking Optimization Algorithm (HOA), slime mold algorithm (SMA) (Ewees et al., <xref ref-type="bibr" rid="B20">2023</xref>), Attraction-repulsion optimization algorithm (AROA) (Cymerys and Oszust, <xref ref-type="bibr" rid="B13">2024</xref>), Harris hawk optimizer (HHO) (Abd Elaziz and Yousri, <xref ref-type="bibr" rid="B2">2021</xref>), Great Wall Construction Algorithm (GWCA) (Guan et al., <xref ref-type="bibr" rid="B26">2023</xref>), and gray wolf optimizer (GWO) (Helmi et al., <xref ref-type="bibr" rid="B29">2021</xref>). These algorithms were selected based on their demonstrated success in FS and high-dimensional search spaces. All methods were evaluated using a k-nearest neighbors (KNN) classifier with consistent parameter settings. Evaluation metrics included accuracy, sensitivity, AUC, fitness value, and the number of selected features. The same classifier and dataset splits were applied to each method to ensure consistent benchmarking.</p>
<p>The proposed approach introduces a hybrid architecture combining SSDAE and MLP for feature representation, integrated with an enhanced optimization framework based on a modified Hiking Optimization Algorithm. The use of Dynamic Opposite Learning increases population diversity, while the Double Attractors mechanism improves convergence toward better feature subsets. These enhancements were specifically designed to address the high dimensionality and noise in rs-fMRI data and contribute to improved classification outcomes across the datasets.</p>
<p>The results, summarized in <xref ref-type="table" rid="T1">Tables 1</xref>&#x02013;<xref ref-type="table" rid="T3">3</xref>, demonstrate that MHOA consistently achieved competitive performance compared to the other algorithms in most evaluation metrics.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Results of the Dataset-1.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" colspan="2"><bold>Measure</bold></th>
<th valign="top" align="center"><bold>MHOA</bold></th>
<th valign="top" align="center"><bold>HOA</bold></th>
<th valign="top" align="center"><bold>SMA</bold></th>
<th valign="top" align="center"><bold>AROA</bold></th>
<th valign="top" align="center"><bold>HHO</bold></th>
<th valign="top" align="center"><bold>GWCA</bold></th>
<th valign="top" align="center"><bold>GWO</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.7019</bold></td>
<td valign="top" align="center">0.6779</td>
<td valign="top" align="center">0.6635</td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6490</td>
<td valign="top" align="center">0.6587</td>
<td valign="top" align="center">0.6298</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0272</td>
<td valign="top" align="center"><bold>0.0068</bold></td>
<td valign="top" align="center">0.0136</td>
<td valign="top" align="center">0.0136</td>
<td valign="top" align="center">0.0204</td>
<td valign="top" align="center"><bold>0.0068</bold></td>
<td valign="top" align="center">0.0476</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.7212</bold></td>
<td valign="top" align="center">0.6827</td>
<td valign="top" align="center">0.6731</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6635</td>
<td valign="top" align="center">0.6635</td>
<td valign="top" align="center">0.6635</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.6827</bold></td>
<td valign="top" align="center">0.6731</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6346</td>
<td valign="top" align="center">0.6346</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.5962</td>
</tr>
<tr>
<td valign="top" align="left">Sensitivity</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.7400</bold></td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center">0.6700</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.6600</td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center">0.6800</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0566</td>
<td valign="top" align="center">0.0283</td>
<td valign="top" align="center">0.0424</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0283</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0283</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.7800</bold></td>
<td valign="top" align="center">0.7400</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.6800</td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center">0.7000</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.6400</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.6400</td>
<td valign="top" align="center"><bold>0.7200</bold></td>
<td valign="top" align="center">0.6600</td>
</tr>
<tr>
<td valign="top" align="left">AUC</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.7668</bold></td>
<td valign="top" align="center">0.7318</td>
<td valign="top" align="center">0.7161</td>
<td valign="top" align="center">0.6678</td>
<td valign="top" align="center">0.7239</td>
<td valign="top" align="center">0.7092</td>
<td valign="top" align="center">0.7100</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0111</td>
<td valign="top" align="center"><bold>0.0034</bold></td>
<td valign="top" align="center">0.0327</td>
<td valign="top" align="center">0.0079</td>
<td valign="top" align="center">0.0259</td>
<td valign="top" align="center">0.0164</td>
<td valign="top" align="center">0.0352</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.7746</bold></td>
<td valign="top" align="center">0.7342</td>
<td valign="top" align="center">0.7392</td>
<td valign="top" align="center">0.6733</td>
<td valign="top" align="center">0.7422</td>
<td valign="top" align="center">0.7207</td>
<td valign="top" align="center">0.7349</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.7590</bold></td>
<td valign="top" align="center">0.7294</td>
<td valign="top" align="center">0.6930</td>
<td valign="top" align="center">0.6622</td>
<td valign="top" align="center">0.7056</td>
<td valign="top" align="center">0.6976</td>
<td valign="top" align="center">0.6851</td>
</tr>
<tr>
<td valign="top" align="left">Fitness value</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center">0.2777</td>
<td valign="top" align="center">0.2732</td>
<td valign="top" align="center">0.3027</td>
<td valign="top" align="center">0.3102</td>
<td valign="top" align="center"><bold>0.2689</bold></td>
<td valign="top" align="center">0.3664</td>
<td valign="top" align="center">0.2698</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0073</td>
<td valign="top" align="center">0.0048</td>
<td valign="top" align="center">0.0088</td>
<td valign="top" align="center">0.0831</td>
<td valign="top" align="center">0.0281</td>
<td valign="top" align="center"><bold>0.0040</bold></td>
<td valign="top" align="center">0.0253</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center">0.2725</td>
<td valign="top" align="center">0.2698</td>
<td valign="top" align="center">0.2964</td>
<td valign="top" align="center">0.2514</td>
<td valign="top" align="center"><bold>0.2490</bold></td>
<td valign="top" align="center">0.3635</td>
<td valign="top" align="center">0.2519</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center">0.2828</td>
<td valign="top" align="center"><bold>0.2766</bold></td>
<td valign="top" align="center">0.3089</td>
<td valign="top" align="center">0.3689</td>
<td valign="top" align="center">0.2887</td>
<td valign="top" align="center">0.3692</td>
<td valign="top" align="center">0.2876</td>
</tr>
<tr>
<td valign="top" align="left">Features no.</td>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>65.00</bold></td>
<td valign="top" align="center">102.00</td>
<td valign="top" align="center">87.00</td>
<td valign="top" align="center">262.00</td>
<td valign="top" align="center">92.00</td>
<td valign="top" align="center">415.00</td>
<td valign="top" align="center">116.00</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">16.47</td>
<td valign="top" align="center"><bold>7.78</bold></td>
<td valign="top" align="center">66.26</td>
<td valign="top" align="center">167.58</td>
<td valign="top" align="center">94.75</td>
<td valign="top" align="center">24.04</td>
<td valign="top" align="center">31.82</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>76.00</bold></td>
<td valign="top" align="center">107.50</td>
<td valign="top" align="center">134.50</td>
<td valign="top" align="center">380.50</td>
<td valign="top" align="center">159.00</td>
<td valign="top" align="center">432.00</td>
<td valign="top" align="center">138.50</td>
</tr></tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="T1">Table 1</xref> lists the numerical results for DATASET-1. In the table, the accuracy results demonstrated that MHOA achieved the highest mean accuracy, followed closely by HOA and SMA. The stability of MHOA was slightly lower than HOA, as indicated by its higher standard deviation. However, its best and worst accuracy values remained superior to those of the other methods. SMA exhibited moderate performance, with AROA and HHO showing lower mean values. GWO achieved the lowest accuracy.</p>
<p>In terms of sensitivity, MHOA ranked first, achieving the highest mean value. HOA and GWCA followed with comparable mean sensitivity scores, while AROA and GWO were positioned in the middle. HHO showed the lowest mean sensitivity. The standard deviation analysis revealed that AROA and GWCA had the most stable results, while MHOA exhibited intermediate stability. The best sensitivity values confirmed MHOA&#x00027;s advantage, as it reached the highest observed value, while the worst results indicated that GWCA achieved the highest stability, followed by MHOA and HOA.</p>
<p>Regarding the AUC metric, MHOA achieved the highest mean, indicating superior overall classification performance. HOA and HHO also showed competitive results, with SMA ranking slightly lower. AROA exhibited the lowest mean AUC. Standard deviation values indicated that HOA maintained the most stable performance, whereas SMA and GWO showed greater variability. The best and worst AUC values showed MHOA&#x00027;s effectiveness, as it outperformed the compared methods.</p>
<p>For the fitness value, HHO exhibited the best mean. HOA and GWO followed closely, with MHOA ranking slightly lower. However, the standard deviation results indicated that MHOA and HOA provided more stable optimization performance than HHO and AROA, which had higher variance. The best and worst fitness values showed that HHO maintained a strong optimization capability, while GWCA had the highest worst fitness value.</p>
<p>The FS results revealed that MHOA achieved the lowest number of selected features in the Best-case scenario. SMA and HOA followed, while GWCA selected the highest number of features. The standard deviation results indicated that HOA had the most stable FS followed by MHOA, while AROA and HHO exhibited greater variability. The mean values confirmed that MHOA consistently selected fewer features than the other methods and demonstrated its efficacy in reducing dimensionality while preserving classification performance. <xref ref-type="fig" rid="F2">Figure 2</xref> presents a comparison of the algorithms&#x00027; performance on Dataset-1 across Accuracy, Sensitivity, and AUC metrics.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Results of accuracy, sensitivity, and AUC for Dataset-1.</p></caption>
<alt-text>Bar chart comparing performance metrics of seven algorithms: MHOA, HOA, SMA, AROA, HHO, GWCA, and GWO. Metrics include Accuracy, Sensitivity, and AUC. MHOA generally performs highest, especially in AUC. Performance varies across metrics.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1594372-g0002.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, the MHOA algorithm consistently outperformed other algorithms across all three key metrics: accuracy, sensitivity, and AUC. Notably, MHOA achieved the highest average accuracy of 0.7019, indicating improved classification capability. These results validate the effectiveness of combining SSDAE-based feature extraction with the modified HOA in capturing discriminative features from rs-fMRI data.</p>
<p><xref ref-type="table" rid="T2">Table 2</xref> presents the results of the DATASET-2. In the table, MHOA achieved the highest mean accuracy, followed closely by AROA, HHO, and GWCA, which exhibited similar performance. The standard deviation values showed that HOA and GWO exhibited the most stable results. MHOA outperformed other methods in the best and worst accuracy values. SMA, AROA, and HHO exhibited moderate performance, while HOA and GWO had lower rankings.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Results of the Dataset-2.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" colspan="2"><bold>Measure</bold></th>
<th valign="top" align="center"><bold>MHOA</bold></th>
<th valign="top" align="center"><bold>HOA</bold></th>
<th valign="top" align="center"><bold>SMA</bold></th>
<th valign="top" align="center"><bold>AROA</bold></th>
<th valign="top" align="center"><bold>HHO</bold></th>
<th valign="top" align="center"><bold>GWCA</bold></th>
<th valign="top" align="center"><bold>GWO</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.6635</bold></td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6490</td>
<td valign="top" align="center">0.6490</td>
<td valign="top" align="center">0.6490</td>
<td valign="top" align="center">0.6442</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0136</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0136</td>
<td valign="top" align="center">0.0068</td>
<td valign="top" align="center">0.0068</td>
<td valign="top" align="center">0.0068</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.6731</bold></td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6538</td>
<td valign="top" align="center">0.6442</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.6538</bold></td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6346</td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6442</td>
<td valign="top" align="center">0.6442</td>
</tr>
<tr>
<td valign="top" align="left">Sensitivity</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center">0.7300</td>
<td valign="top" align="center">0.7100</td>
<td valign="top" align="center"><bold>0.7400</bold></td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.7300</td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center">0.7200</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0424</td>
<td valign="top" align="center">0.0141</td>
<td valign="top" align="center">0.0283</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0141</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center"><bold>0.0000</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">best</td>
<td valign="top" align="center"><bold>0.7600</bold></td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center"><bold>0.7600</bold></td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.7400</td>
<td valign="top" align="center">0.7200</td>
<td valign="top" align="center">0.7200</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center"><bold>0.7200</bold></td>
<td valign="top" align="center">0.7000</td>
<td valign="top" align="center"><bold>0.7200</bold></td>
<td valign="top" align="center"><bold>0.7200</bold></td>
<td valign="top" align="center"><bold>0.7200</bold></td>
</tr>
<tr>
<td valign="top" align="left">AUC</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.6931</bold></td>
<td valign="top" align="center">0.6873</td>
<td valign="top" align="center">0.6711</td>
<td valign="top" align="center">0.6839</td>
<td valign="top" align="center">0.6794</td>
<td valign="top" align="center">0.6781</td>
<td valign="top" align="center">0.6839</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0076</td>
<td valign="top" align="center">0.0064</td>
<td valign="top" align="center">0.0113</td>
<td valign="top" align="center">0.0060</td>
<td valign="top" align="center">0.0028</td>
<td valign="top" align="center"><bold>0.0009</bold></td>
<td valign="top" align="center">0.0058</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.6985</bold></td>
<td valign="top" align="center">0.6919</td>
<td valign="top" align="center">0.6791</td>
<td valign="top" align="center">0.6881</td>
<td valign="top" align="center">0.6814</td>
<td valign="top" align="center">0.6787</td>
<td valign="top" align="center">0.6880</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.6878</bold></td>
<td valign="top" align="center">0.6828</td>
<td valign="top" align="center">0.6631</td>
<td valign="top" align="center">0.6796</td>
<td valign="top" align="center">0.6774</td>
<td valign="top" align="center">0.6774</td>
<td valign="top" align="center">0.6798</td>
</tr>
<tr>
<td valign="top" align="left">Fitness value</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.1658</bold></td>
<td valign="top" align="center">0.3484</td>
<td valign="top" align="center">0.2846</td>
<td valign="top" align="center">0.2626</td>
<td valign="top" align="center">0.2877</td>
<td valign="top" align="center">0.3482</td>
<td valign="top" align="center">0.3187</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center"><bold>0.0036</bold></td>
<td valign="top" align="center">0.0047</td>
<td valign="top" align="center">0.0089</td>
<td valign="top" align="center">0.0176</td>
<td valign="top" align="center">0.0201</td>
<td valign="top" align="center">0.0065</td>
<td valign="top" align="center">0.0230</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.1633</bold></td>
<td valign="top" align="center">0.3450</td>
<td valign="top" align="center">0.2784</td>
<td valign="top" align="center">0.2501</td>
<td valign="top" align="center">0.2735</td>
<td valign="top" align="center">0.3436</td>
<td valign="top" align="center">0.3025</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.1683</bold></td>
<td valign="top" align="center">0.3517</td>
<td valign="top" align="center">0.2909</td>
<td valign="top" align="center">0.2751</td>
<td valign="top" align="center">0.3019</td>
<td valign="top" align="center">0.3528</td>
<td valign="top" align="center">0.3349</td>
</tr>
<tr>
<td valign="top" align="left">Features no.</td>
<td valign="top" align="center">Best</td>
<td valign="top" align="center">16.00</td>
<td valign="top" align="center">74.00</td>
<td valign="top" align="center"><bold>10.00</bold></td>
<td valign="top" align="center">41.00</td>
<td valign="top" align="center">48.00</td>
<td valign="top" align="center">58.00</td>
<td valign="top" align="center">51.00</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">3.54</td>
<td valign="top" align="center">1.41</td>
<td valign="top" align="center">14.85</td>
<td valign="top" align="center"><bold>0.71</bold></td>
<td valign="top" align="center">7.78</td>
<td valign="top" align="center">5.66</td>
<td valign="top" align="center">10.61</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>18.50</bold></td>
<td valign="top" align="center">75.00</td>
<td valign="top" align="center">20.50</td>
<td valign="top" align="center">41.50</td>
<td valign="top" align="center">53.50</td>
<td valign="top" align="center">62.00</td>
<td valign="top" align="center">58.50</td>
</tr></tbody>
</table>
</table-wrap>
<p>In terms of sensitivity, SMA achieved the highest mean value, with MHOA and HHO ranking closely behind. HOA and AROA exhibited the lowest sensitivity. Standard deviation values showed that AROA, GWCA, and GWO were the most stable. The Best-case confirmed MHOA&#x00027;s strength, while the worst value demonstrated that SMA, HHO, GWCA, and GWO showed similar results, followed by MHOA.</p>
<p>Regarding the AUC metric, MHOA ranked highest in mean performance and demonstrated its superior classification capability. HOA followed closely, while SMA recorded the lowest mean AUC. Standard deviation results indicated that GWCA maintained the most stable AUC performance, whereas SMA showed greater variability. The best and worst values confirmed MHOA&#x00027;s consistently high performance across various scenarios.</p>
<p>For the fitness value, MHOA exhibited the best mean. AROA followed, while HOA recorded the highest mean value. The standard deviation analysis showed that MHOA had the most stable fitness value, whereas GWO and HHO exhibited greater variability. The best and worst fitness values further confirmed that MHOA maintained strong optimization capability, whereas HOA and GWCA showed inconsistent performance.</p>
<p>The FS results revealed that SMA achieved the lowest number of selected features in the best case. MHOA followed closely, while HOA selected the highest number of features. The standard deviation values indicated that AROA maintained the most stable FS, followed by HOA and MHOA, while SMA and GWO exhibited greater variability. The mean values confirmed that MHOA consistently selected fewer features than most methods and proved effective in dimensionality reduction while maintaining classification accuracy. <xref ref-type="fig" rid="F3">Figure 3</xref> presents a comparison of the algorithms&#x00027; performance on Dataset-2 across Accuracy, Sensitivity, and AUC metrics.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Results of accuracy, sensitivity, and AUC for Dataset-2.</p></caption>
<alt-text>Bar chart comparing performance values for different algorithms across accuracy, sensitivity, and AUC metrics. Each bar is color-coded for algorithms: MHOA, HOA, SMA, AROA, HHO, GWCA, and GWO. Sensitivity has the highest values overall.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1594372-g0003.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="F3">Figure 3</xref>, the proposed MHOA model outperforms all competing methods in terms of accuracy and AUC, demonstrating improved classification capability. Although the SMA algorithm achieved slightly higher sensitivity, MHOA exhibits a strong balance between sensitivity and accuracy, which is crucial in minimizing both false negatives and false positives in ASD detection. The GWCA and GWO models showed relatively stable sensitivity but did not match the overall classification performance of MHOA.</p>
<p><xref ref-type="table" rid="T3">Table 3</xref> presents the results and shows that MHOA achieved the highest mean accuracy. AROA and GWO followed closely, while HOA and SMA ranked lower. Standard deviation values indicated that AROA and GWO exhibited stable performance, whereas HOA and SMA showed greater variability. MHOA maintained its dominance in best and worst accuracy values, reinforcing its robustness.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Results of the Dataset-3.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" colspan="2"><bold>Measure</bold></th>
<th valign="top" align="center"><bold>MHOA</bold></th>
<th valign="top" align="center"><bold>HOA</bold></th>
<th valign="top" align="center"><bold>SMA</bold></th>
<th valign="top" align="center"><bold>AROA</bold></th>
<th valign="top" align="center"><bold>HHO</bold></th>
<th valign="top" align="center"><bold>GWCA</bold></th>
<th valign="top" align="center"><bold>GWO</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.8382</bold></td>
<td valign="top" align="center">0.8261</td>
<td valign="top" align="center">0.8164</td>
<td valign="top" align="center">0.8333</td>
<td valign="top" align="center">0.8309</td>
<td valign="top" align="center">0.8285</td>
<td valign="top" align="center">0.8333</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0034</td>
<td valign="top" align="center">0.0137</td>
<td valign="top" align="center">0.0137</td>
<td valign="top" align="center"><bold>0.0034</bold></td>
<td valign="top" align="center">0.0068</td>
<td valign="top" align="center">0.0171</td>
<td valign="top" align="center"><bold>0.0034</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.8406</bold></td>
<td valign="top" align="center">0.8357</td>
<td valign="top" align="center">0.8261</td>
<td valign="top" align="center">0.8357</td>
<td valign="top" align="center">0.8357</td>
<td valign="top" align="center"><bold>0.8406</bold></td>
<td valign="top" align="center">0.8357</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.8357</bold></td>
<td valign="top" align="center">0.8164</td>
<td valign="top" align="center">0.8068</td>
<td valign="top" align="center">0.8309</td>
<td valign="top" align="center">0.8261</td>
<td valign="top" align="center">0.8164</td>
<td valign="top" align="center">0.8309</td>
</tr>
<tr>
<td valign="top" align="left">Sensitivity</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.8257</bold></td>
<td valign="top" align="center">0.7936</td>
<td valign="top" align="center">0.7890</td>
<td valign="top" align="center">0.8165</td>
<td valign="top" align="center">0.8211</td>
<td valign="top" align="center">0.8028</td>
<td valign="top" align="center">0.8211</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0195</td>
<td valign="top" align="center">0.0130</td>
<td valign="top" align="center"><bold>0.0000</bold></td>
<td valign="top" align="center">0.0065</td>
<td valign="top" align="center">0.0324</td>
<td valign="top" align="center">0.0065</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">best</td>
<td valign="top" align="center"><bold>0.8257</bold></td>
<td valign="top" align="center">0.8073</td>
<td valign="top" align="center">0.7982</td>
<td valign="top" align="center">0.8165</td>
<td valign="top" align="center"><bold>0.8257</bold></td>
<td valign="top" align="center"><bold>0.8257</bold></td>
<td valign="top" align="center"><bold>0.8257</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.8257</bold></td>
<td valign="top" align="center">0.7798</td>
<td valign="top" align="center">0.7798</td>
<td valign="top" align="center">0.8165</td>
<td valign="top" align="center">0.8165</td>
<td valign="top" align="center">0.7798</td>
<td valign="top" align="center">0.8165</td>
</tr>
<tr>
<td valign="top" align="left">AUC</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center"><bold>0.9099</bold></td>
<td valign="top" align="center">0.8980</td>
<td valign="top" align="center">0.9006</td>
<td valign="top" align="center">0.9065</td>
<td valign="top" align="center">0.9085</td>
<td valign="top" align="center">0.9008</td>
<td valign="top" align="center">0.9065</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0013</td>
<td valign="top" align="center">0.0018</td>
<td valign="top" align="center">0.0045</td>
<td valign="top" align="center"><bold>0.0010</bold></td>
<td valign="top" align="center">0.0028</td>
<td valign="top" align="center">0.0059</td>
<td valign="top" align="center">0.0029</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center"><bold>0.9108</bold></td>
<td valign="top" align="center">0.8993</td>
<td valign="top" align="center">0.9038</td>
<td valign="top" align="center">0.9072</td>
<td valign="top" align="center">0.9105</td>
<td valign="top" align="center">0.9050</td>
<td valign="top" align="center">0.9086</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center"><bold>0.9091</bold></td>
<td valign="top" align="center">0.8967</td>
<td valign="top" align="center">0.8974</td>
<td valign="top" align="center">0.9058</td>
<td valign="top" align="center">0.9065</td>
<td valign="top" align="center">0.8966</td>
<td valign="top" align="center">0.9045</td>
</tr>
<tr>
<td valign="top" align="left">Fitness value</td>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center">0.2100</td>
<td valign="top" align="center">0.2048</td>
<td valign="top" align="center"><bold>0.1826</bold></td>
<td valign="top" align="center">0.2382</td>
<td valign="top" align="center">0.2681</td>
<td valign="top" align="center">0.2029</td>
<td valign="top" align="center">0.2358</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">0.0257</td>
<td valign="top" align="center">0.0084</td>
<td valign="top" align="center">0.0021</td>
<td valign="top" align="center">0.0274</td>
<td valign="top" align="center"><bold>0.0018</bold></td>
<td valign="top" align="center">0.0034</td>
<td valign="top" align="center">0.0300</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Best</td>
<td valign="top" align="center">0.1919</td>
<td valign="top" align="center">0.1989</td>
<td valign="top" align="center"><bold>0.1811</bold></td>
<td valign="top" align="center">0.2188</td>
<td valign="top" align="center">0.2668</td>
<td valign="top" align="center">0.2005</td>
<td valign="top" align="center">0.2146</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Worst</td>
<td valign="top" align="center">0.2282</td>
<td valign="top" align="center">0.2108</td>
<td valign="top" align="center"><bold>0.1841</bold></td>
<td valign="top" align="center">0.2576</td>
<td valign="top" align="center">0.2694</td>
<td valign="top" align="center">0.2053</td>
<td valign="top" align="center">0.2570</td>
</tr>
<tr>
<td valign="top" align="left">Features no.</td>
<td valign="top" align="center">Best</td>
<td valign="top" align="center">35.00</td>
<td valign="top" align="center"><bold>15.00</bold></td>
<td valign="top" align="center">20.00</td>
<td valign="top" align="center">57.00</td>
<td valign="top" align="center">73.00</td>
<td valign="top" align="center">22.00</td>
<td valign="top" align="center">36.00</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">StDev</td>
<td valign="top" align="center">16.26</td>
<td valign="top" align="center">9.90</td>
<td valign="top" align="center">12.12</td>
<td valign="top" align="center"><bold>6.36</bold></td>
<td valign="top" align="center">13.44</td>
<td valign="top" align="center">15.56</td>
<td valign="top" align="center">29.70</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Mean</td>
<td valign="top" align="center">46.50</td>
<td valign="top" align="center">22.00</td>
<td valign="top" align="center"><bold>21.50</bold></td>
<td valign="top" align="center">61.50</td>
<td valign="top" align="center">82.50</td>
<td valign="top" align="center">33.00</td>
<td valign="top" align="center">57.00</td>
</tr></tbody>
</table>
</table-wrap>
<p>Regarding sensitivity, MHOA ranked the highest with the best mean performance. HHO and GWO followed closely behind. HOA showed the lowest sensitivity and indicated its weakness in detecting positive instances. Standard deviation results indicated that MHOA and AROA were the most stable in sensitivity, while SMA, HOA, and GWCA exhibited higher variability. The best-case values demonstrated that MHOA consistently performed well in identifying positive instances, while HOA&#x00027;s worst-case results showed significant variability.</p>
<p>For AUC, MHOA outperformed all other algorithms in mean performance and demonstrated clear class differentiation capability. HHO and GWO ranked next, while HOA performed the weakest in AUC. Standard deviation analysis revealed that AROA exhibited the most stability in AUC performance, while SMA and GWCA showed higher fluctuations. The best and worst values confirmed that MHOA maintained good performance across different scenarios and indicated its reliability in class separation.</p>
<p>In terms of fitness value, SMA achieved the lowest mean. HOA and GWCA followed, while HHO recorded the highest mean. Standard deviation results showed that HHO was the most stable in optimization performance, while AROA and GWO exhibited higher variability. The best and worst values further supported SMA&#x00027;s optimization efficiency, while MHOA exhibited competitive performance with relatively stable optimization. HHO and AROA displayed less stability in converging to optimal solutions.</p>
<p>Regarding FS, HOA selected the fewest features in the best-case scenario. SMA followed closely behind, while HHO selected the highest number of features. MHOA demonstrated a balanced approach by selecting a moderate number of features, maintaining a trade-off between dimensionality reduction and classification performance. Standard deviation values revealed that AROA exhibited the most stable FS, while GWO showed the greatest variability. The mean values confirmed that HOA and SMA consistently selected fewer features, while MHOA maintained a competitive balance between FS and model performance. <xref ref-type="fig" rid="F4">Figure 4</xref> presents a comparison of the algorithms&#x00027; performance on Dataset-3 across Accuracy, Sensitivity, and AUC metrics.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Results of accuracy, sensitivity, and AUC for Dataset-3.</p></caption>
<alt-text>Bar chart comparing the performance of seven algorithms (MHOA, HOA, SMA, AROA, HHO, GWCA, and GWO) across three metrics: accuracy, Sensitivity, and AUC. Each algorithm is represented by a different color. Performance values range from 0.70 to 0.95. AUC values are generally higher across all algorithms.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1594372-g0004.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, the MHOA algorithm achieved the best results across all metrics. It ranked first in accuracy, followed by AROA, GWO, and HHO. In sensitivity, MHOA again led, while HHO, GWO, and AROA showed similar outcomes. For AUC, MHOA maintained the top position, with HHO, AROA, and GWO close behind. GWCA and HOA showed lower sensitivity and AUC values, and SMA ranked lowest in accuracy and sensitivity.</p>
<p>These observed performance rankings are further supported by the results of the Friedman test, a non-parametric statistical method commonly used to detect differences across multiple conditions when the data does not follow normal distribution assumptions. It is particularly useful in model comparison as it accounts for the ordinal nature of the data and dependencies between repeated measures. The results of the Friedman test, as shown in <xref ref-type="table" rid="T4">Table 4</xref>, reveal considerable variability in performance across the models. MHOA consistently ranks highest in accuracy, AUC, and sensitivity and shows better overall effectiveness. In contrast, GWO ranks lowest in accuracy and reflects relatively lower performance in this context. Models such as HOA, SMA, AROA, HHO, and GWCA demonstrate intermediate performance. These findings highlight differences among the models, with MHOA showing the most consistent results.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Results of the Friedman test.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left"><bold>Measure</bold></th>
<th valign="top" align="center"><bold>MHOA</bold></th>
<th valign="top" align="center"><bold>HOA</bold></th>
<th valign="top" align="center"><bold>SMA</bold></th>
<th valign="top" align="center"><bold>AROA</bold></th>
<th valign="top" align="center"><bold>HHO</bold></th>
<th valign="top" align="center"><bold>GWCA</bold></th>
<th valign="top" align="center"><bold>GWO</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Accuracy</td>
<td valign="top" align="center"><bold>7.00</bold></td>
<td valign="top" align="center">3.33</td>
<td valign="top" align="center">2.67</td>
<td valign="top" align="center">4.17</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">2.83</td>
</tr>
<tr>
<td valign="top" align="left">AUC</td>
<td valign="top" align="center"><bold>7.00</bold></td>
<td valign="top" align="center">4.33</td>
<td valign="top" align="center">2.50</td>
<td valign="top" align="center">3.33</td>
<td valign="top" align="center">4.67</td>
<td valign="top" align="center">2.17</td>
<td valign="top" align="center">4.00</td>
</tr>
<tr>
<td valign="top" align="left">Sensitivity</td>
<td valign="top" align="center"><bold>6.50</bold></td>
<td valign="top" align="center">3.17</td>
<td valign="top" align="center">3.33</td>
<td valign="top" align="center">3.00</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">4.00</td>
<td valign="top" align="center">4.00</td>
</tr></tbody>
</table>
</table-wrap>
<p>To further evaluate the performance of the developed MHOA model to detect ASD, we compared it with the results obtained in Liu et al. (<xref ref-type="bibr" rid="B39">2024</xref>). Since this work uses the same strategy to split ABIDE I dataset. The technique used in Liu et al. (<xref ref-type="bibr" rid="B39">2024</xref>) is named MADE-for-ASD, and its accuracy for CC, AAL, and EZ is 73.42%, 71.20%, and 68.74%, respectively. However, our developed MHOA based on the SSDAE model has accuracy 66.35%, 70.19%, and 83.82% for EZ, AAL, and CC, respectively. So, MADE-for-ASD is better than MHOA at EZ and AAL, whereas MHOA is better according to the results of CC split (dataset-3). In addition, the average accuracy of MADE-for-ASD and our MHOA model overall the three datasets is 71.12% and 73.45%, respectively. This indicates the high ability of the developed model to detect ASD.</p>
<p>In general, MHOA consistently achieved the highest accuracy and AUC across datasets and demonstrated strong classification performance. Sensitivity results confirmed its ability to identify positive instances. Its optimization performance remained competitive with relatively stable fitness values. FS analysis indicated that MHOA maintained a balance between dimensionality reduction and model effectiveness and demonstrating its reliability across diverse evaluation criteria. However, its stability in some metrics, such as fitness value and sensitivity, was lower than that of certain methods and suggesting potential improvements in robustness under varying conditions.</p>
</sec>
</sec>
<sec id="s6">
<title>6 Conclusion and future works</title>
<p>This paper presents a novel DL model integrated with a modified version of the HOA for detecting ASD from rs-fMRI data. The proposed model enhances the accuracy of ASD detection, potentially improving early intervention strategies for individuals who may otherwise be missed by traditional methods. By combining the SSDAE and MLP, the model effectively extracts relevant features, while the enhanced HOA, utilizing dynamic opposite-based learning and double attractors, optimizes FS. The developed model demonstrates promising results, with an average accuracy of 0.735, sensitivity of 0.765, and AUC of 0.790 across various datasets, showing the potential of DL and the MHOA algorithm in automated ASD detection.</p>
<p>Despite the promising results, several challenges remain. The biological heterogeneity of ASD, along with variations in imaging protocols and preprocessing steps, introduces potential limitations that could affect the generalizability and reproducibility of the model. Future work could focus on addressing these challenges by incorporating multi-site datasets with consistent preprocessing pipelines to enhance the model&#x00027;s robustness and external validity. Additionally, the model&#x00027;s interpretability remains a key consideration, as understanding the decision-making process of DL models is crucial for clinical adoption. Efforts toward developing explainable AI techniques could be integrated to provide more transparent insights into the detected features and their relevance to ASD. Moreover, future research should explore the application of this approach to other neurodevelopmental disorders that exhibit overlapping symptoms with ASD, such as ADHD and intellectual disabilities. Expanding the model&#x00027;s applicability across a broader spectrum of neurodevelopmental conditions could facilitate the development of more generalized and efficient diagnostic tools. Furthermore, incorporating longitudinal data and examining the model&#x00027;s performance over time could provide deeper insights into the progression of ASD and its early detection.</p>
<p>In conclusion, this study lays the groundwork for a more effective, DL-based diagnostic tool for ASD, offering a promising direction for early detection and intervention. However, further refinements and validations in diverse clinical settings are necessary to ensure the model&#x00027;s practical applicability in real-world healthcare environments.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: <ext-link ext-link-type="uri" xlink:href="https://www.nature.com/articles/s41598-022-09821-6">https://www.nature.com/articles/s41598-022-09821-6</ext-link>.</p>
</sec>
<sec sec-type="ethics-statement" id="s8">
<title>Ethics statement</title>
<p>Ethical approval and written informed consent from the patients/participants or their legal guardians/next of kin were not required, as the ABIDE I is a publicly available dataset.</p>
</sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>IN: Writing &#x02013; original draft, Resources, Software, Data curation, Investigation, Methodology, Visualization, Conceptualization, Funding acquisition, Supervision. NM: Visualization, Writing &#x02013; original draft, Methodology, Data curation, Validation, Investigation, Software. AE: Writing &#x02013; review &#x00026; editing, Investigation, Writing &#x02013; original draft, Conceptualization, Formal analysis, Visualization, Resources, Validation. MK: Conceptualization, Investigation, Methodology, Software, Visualization, Writing &#x02013; original draft, Formal analysis, Data curation, Resources. AD: Investigation, Methodology, Writing &#x02013; original draft, Resources, Conceptualization, Project administration. SA: Software, Visualization, Writing &#x02013; original draft, Investigation, Project administration, Methodology, Supervision, Validation. IF: Data curation, Conceptualization, Writing &#x02013; original draft, Investigation, Visualization, Formal analysis. MA-B: Resources, Validation, Project administration, Methodology, Software, Investigation, Writing &#x02013; original draft, Supervision. ME: Project administration, Validation, Supervision, Writing &#x02013; review &#x00026; editing, Investigation, Visualization, Software.</p>
</sec>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research and/or publication of this article. The authors extend their appreciation to the King Salman center For Disability Research for funding this work through Research Group no KSRG-2024-297.</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="journal"><person-group person-group-type="author"><name><surname>Abbas</surname> <given-names>S. Q.</given-names></name> <name><surname>Chi</surname> <given-names>L.</given-names></name> <name><surname>Chen</surname> <given-names>Y.-P. P.</given-names></name></person-group> (<year>2023</year>). <article-title>Deepmnf: deep multimodal neuroimaging framework for diagnosing autism spectrum disorder</article-title>. <source>Artif. Intell. Med</source>. <volume>136</volume>:<fpage>102475</fpage>. <pub-id pub-id-type="doi">10.1016/j.artmed.2022.102475</pub-id><pub-id pub-id-type="pmid">36710063</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abd Elaziz</surname> <given-names>M.</given-names></name> <name><surname>Yousri</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>Automatic selection of heavy-tailed distributions-based synergy henry gas solubility and harris hawk optimizer for feature selection: case study drug design and discovery</article-title>. <source>Artif. Intell. Rev</source>. <volume>54</volume>, <fpage>4685</fpage>&#x02013;<lpage>4730</lpage>. <pub-id pub-id-type="doi">10.1007/s10462-021-10009-z</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abraham</surname> <given-names>A.</given-names></name> <name><surname>Milham</surname> <given-names>M. P.</given-names></name> <name><surname>Di Martino</surname> <given-names>A.</given-names></name> <name><surname>Craddock</surname> <given-names>R. C.</given-names></name> <name><surname>Samaras</surname> <given-names>D.</given-names></name> <name><surname>Thirion</surname> <given-names>B.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Deriving reproducible biomarkers from multi-site resting-state data: an autism-based example</article-title>. <source>Neuroimage</source> <volume>147</volume>, <fpage>736</fpage>&#x02013;<lpage>745</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2016.10.045</pub-id><pub-id pub-id-type="pmid">27865923</pub-id></citation></ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abu-Doleh</surname> <given-names>A.</given-names></name> <name><surname>Abu-Qasmieh</surname> <given-names>I. F.</given-names></name> <name><surname>Al-Quran</surname> <given-names>H. H.</given-names></name> <name><surname>Masad</surname> <given-names>I. S.</given-names></name> <name><surname>Banyissa</surname> <given-names>L. R.</given-names></name> <name><surname>Ahmad</surname> <given-names>M. A.</given-names></name></person-group> (<year>2025</year>). <article-title>Recognition of autism in subcortical brain volumetric images using autoencoding-based region selection method and Siamese convolutional neural network</article-title>. <source>Int. J. Med. Inform</source>. <volume>194</volume>:<fpage>105707</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijmedinf.2024.105707</pub-id><pub-id pub-id-type="pmid">39561667</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ahmad</surname> <given-names>M. F.</given-names></name> <name><surname>Isa</surname> <given-names>N. A. M.</given-names></name> <name><surname>Lim</surname> <given-names>W. H.</given-names></name> <name><surname>Ang</surname> <given-names>K. M.</given-names></name></person-group> (<year>2022</year>). <article-title>Differential evolution with modified initialization scheme using chaotic oppositional based learning strategy</article-title>. <source>Alexandria Eng. J</source>. <volume>61</volume>, <fpage>11835</fpage>&#x02013;<lpage>11858</lpage>. <pub-id pub-id-type="doi">10.1016/j.aej.2022.05.028</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Al-Hendawi</surname> <given-names>M.</given-names></name> <name><surname>Hussein</surname> <given-names>E.</given-names></name> <name><surname>Al Ghafri</surname> <given-names>B.</given-names></name> <name><surname>Bulut</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>A scoping review of studies on assistive technology interventions and their impact on individuals with autism spectrum disorder in Arab countries</article-title>. <source>Children</source> <volume>10</volume>:<fpage>1828</fpage>. <pub-id pub-id-type="doi">10.3390/children10111828</pub-id><pub-id pub-id-type="pmid">38002919</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alzubaidi</surname> <given-names>L.</given-names></name> <name><surname>Bai</surname> <given-names>J.</given-names></name> <name><surname>Al-Sabaawi</surname> <given-names>A.</given-names></name> <name><surname>Santamar&#x000ED;a</surname> <given-names>J.</given-names></name> <name><surname>Albahri</surname> <given-names>A. S.</given-names></name> <name><surname>Al-dabbagh</surname> <given-names>B. S. N.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>A survey on deep learning tools dealing with data scarcity: definitions, challenges, solutions, tips, and applications</article-title>. <source>J. Big Data</source> <volume>10</volume>:<fpage>46</fpage>. <pub-id pub-id-type="doi">10.1186/s40537-023-00727-2</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bahathiq</surname> <given-names>R. A.</given-names></name> <name><surname>Banjar</surname> <given-names>H.</given-names></name> <name><surname>Bamaga</surname> <given-names>A. K.</given-names></name> <name><surname>Jarraya</surname> <given-names>S. K.</given-names></name></person-group> (<year>2022</year>). <article-title>Machine learning for autism spectrum disorder diagnosis using structural magnetic resonance imaging: promising but challenging</article-title>. <source>Front. Neuroinform</source>. <volume>16</volume>:<fpage>949926</fpage>. <pub-id pub-id-type="doi">10.3389/fninf.2022.949926</pub-id><pub-id pub-id-type="pmid">36246393</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cao</surname> <given-names>D.</given-names></name> <name><surname>Xu</surname> <given-names>Y.</given-names></name> <name><surname>Yang</surname> <given-names>Z.</given-names></name> <name><surname>Dong</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name></person-group> (<year>2023</year>). <article-title>An enhanced whale optimization algorithm with improved dynamic opposite learning and adaptive inertia weight strategy</article-title>. <source>Complex Intell. Syst</source>. <volume>9</volume>, <fpage>767</fpage>&#x02013;<lpage>795</lpage>. <pub-id pub-id-type="doi">10.1007/s40747-022-00827-1</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>W.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name> <name><surname>Sun</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Tao</surname> <given-names>G.</given-names></name> <name><surname>Ding</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2024</year>). <article-title>Deepasd: a deep adversarial-regularized graph learning method for asd diagnosis with multimodal data</article-title>. <source>Transl. Psychiatry</source> <volume>14</volume>:<fpage>375</fpage>. <pub-id pub-id-type="doi">10.1038/s41398-024-02972-2</pub-id><pub-id pub-id-type="pmid">39277595</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chola Raja</surname> <given-names>K.</given-names></name> <name><surname>Kannimuthu</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Deep learning-based feature selection and prediction system for autism spectrum disorder using a hybrid meta-heuristics approach</article-title>. <source>J. Intell. Fuzzy Syst</source>. <volume>45</volume>, <fpage>797</fpage>&#x02013;<lpage>807</lpage>. <pub-id pub-id-type="doi">10.3233/JIFS-223694</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Christensen</surname> <given-names>D. L.</given-names></name></person-group> (<year>2016</year>). <article-title>Prevalence and characteristics of autism spectrum disorder among children aged 8 years&#x02013;autism and developmental disabilities monitoring network, 11 sites, United States, 2012</article-title>. <source>MMWR Surveill. Summ</source>. <volume>72</volume>, <fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.15585/mmwr.ss6503a1</pub-id><pub-id pub-id-type="pmid">27031587</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cymerys</surname> <given-names>K.</given-names></name> <name><surname>Oszust</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <article-title>Attraction-repulsion optimization algorithm for global optimization problems</article-title>. <source>Swarm Evolut. Comput</source>. <volume>84</volume>:<fpage>101459</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2023.101459</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dahou</surname> <given-names>A.</given-names></name> <name><surname>Aseeri</surname> <given-names>A. O.</given-names></name> <name><surname>Mabrouk</surname> <given-names>A.</given-names></name> <name><surname>Ibrahim</surname> <given-names>R. A.</given-names></name> <name><surname>Al-Betar</surname> <given-names>M. A.</given-names></name> <name><surname>Elaziz</surname> <given-names>M. A.</given-names></name></person-group> (<year>2023</year>). <article-title>Optimal skin cancer detection model using transfer learning and dynamic-opposite hunger games search</article-title>. <source>Diagnostics</source> <volume>13</volume>:<fpage>1579</fpage>. <pub-id pub-id-type="doi">10.3390/diagnostics13091579</pub-id><pub-id pub-id-type="pmid">37174970</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di Martino</surname> <given-names>A.</given-names></name> <name><surname>Yan</surname> <given-names>C.-G.</given-names></name> <name><surname>Li</surname> <given-names>Q.</given-names></name> <name><surname>Denio</surname> <given-names>E.</given-names></name> <name><surname>Castellanos</surname> <given-names>F. X.</given-names></name> <name><surname>Alaerts</surname> <given-names>K.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>The autism brain imaging data exchange: towards a large-scale evaluation of the intrinsic brain architecture in autism</article-title>. <source>Mol. Psychiatry</source> <volume>19</volume>, <fpage>659</fpage>&#x02013;<lpage>667</lpage>. <pub-id pub-id-type="doi">10.1038/mp.2013.78</pub-id><pub-id pub-id-type="pmid">23774715</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ding</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>H.</given-names></name> <name><surname>Qiu</surname> <given-names>T.</given-names></name></person-group> (<year>2024</year>). <article-title>Deep learning approach to predict autism spectrum disorder: a systematic review and meta-analysis</article-title>. <source>BMC Psychiatry</source> <volume>24</volume>, <fpage>739</fpage>. <pub-id pub-id-type="doi">10.1186/s12888-024-06116-0</pub-id><pub-id pub-id-type="pmid">39468522</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>El-Abd</surname> <given-names>M.</given-names></name></person-group> (<year>2011</year>). <article-title>&#x0201C;Opposition-based artificial bee colony algorithm,&#x0201D;</article-title> in <source>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</source>, 109&#x02013;116. <pub-id pub-id-type="doi">10.1145/2001576.2001592</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ergezer</surname> <given-names>M.</given-names></name> <name><surname>Simon</surname> <given-names>D.</given-names></name> <name><surname>Du</surname> <given-names>D.</given-names></name></person-group> (<year>2009</year>). <article-title>&#x0201C;Oppositional biogeography-based optimization,&#x0201D;</article-title> in <source>2009 IEEE International Conference on Systems, Man and Cybernetics</source> (<publisher-loc>IEEE</publisher-loc>), <fpage>1009</fpage>&#x02013;<lpage>1014</lpage>. <pub-id pub-id-type="doi">10.1109/ICSMC.2009.5346043</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Eslami</surname> <given-names>T.</given-names></name> <name><surname>Mirjalili</surname> <given-names>V.</given-names></name> <name><surname>Fong</surname> <given-names>A.</given-names></name> <name><surname>Laird</surname> <given-names>A. R.</given-names></name> <name><surname>Saeed</surname> <given-names>F.</given-names></name></person-group> (<year>2019</year>). <article-title>ASD-diagnet: a hybrid learning approach for detection of autism spectrum disorder using fmri data</article-title>. <source>Front. Neuroinform</source>. <volume>13</volume>:<fpage>70</fpage>. <pub-id pub-id-type="doi">10.3389/fninf.2019.00070</pub-id><pub-id pub-id-type="pmid">31827430</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ewees</surname> <given-names>A. A.</given-names></name> <name><surname>Al-Qaness</surname> <given-names>M. A.</given-names></name> <name><surname>Abualigah</surname> <given-names>L.</given-names></name> <name><surname>Algamal</surname> <given-names>Z. Y.</given-names></name> <name><surname>Oliva</surname> <given-names>D.</given-names></name> <name><surname>Yousri</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Enhanced feature selection technique using slime mould algorithm: a case study on chemical data</article-title>. <source>Neural Comput. Applic</source>. <volume>35</volume>, <fpage>3307</fpage>&#x02013;<lpage>3324</lpage>. <pub-id pub-id-type="doi">10.1007/s00521-022-07852-8</pub-id><pub-id pub-id-type="pmid">36245794</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fares</surname> <given-names>I. A.</given-names></name> <name><surname>Abd Elaziz</surname> <given-names>M.</given-names></name></person-group> (<year>2025</year>). <article-title>Explainable tabnet transformer-based on google vizier optimizer for anomaly intrusion detection system</article-title>. <source>Knowl. Based Syst</source>. <volume>316</volume>:<fpage>113351</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2025.113351</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fares</surname> <given-names>I. A.</given-names></name> <name><surname>Abd Elaziz</surname> <given-names>M.</given-names></name> <name><surname>Aseeri</surname> <given-names>A. O.</given-names></name> <name><surname>Zied</surname> <given-names>H. S.</given-names></name> <name><surname>Abdellatif</surname> <given-names>A. G.</given-names></name></person-group> (<year>2025</year>). <article-title>Tfkan: transformer based on kolmogorov-arnold networks for intrusion detection in IoT environment</article-title>. <source>Egyptian Inform. J</source>. <volume>30</volume>:<fpage>100666</fpage>. <pub-id pub-id-type="doi">10.1016/j.eij.2025.100666</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gautam</surname> <given-names>S.</given-names></name> <name><surname>Sharma</surname> <given-names>P.</given-names></name> <name><surname>Thapa</surname> <given-names>K.</given-names></name> <name><surname>Upadhaya</surname> <given-names>M. D.</given-names></name> <name><surname>Thapa</surname> <given-names>D.</given-names></name> <name><surname>Khanal</surname> <given-names>S. R.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Screening autism spectrum disorder in children using deep learning approach: Evaluating the classification model of yolov8 by comparing with other models</article-title>. <source>arXiv preprint arXiv:2306.14300</source>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Giarelli</surname> <given-names>E.</given-names></name> <name><surname>Wiggins</surname> <given-names>L. D.</given-names></name> <name><surname>Rice</surname> <given-names>C. E.</given-names></name> <name><surname>Levy</surname> <given-names>S. E.</given-names></name> <name><surname>Kirby</surname> <given-names>R. S.</given-names></name> <name><surname>Pinto-Martin</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2010</year>). <article-title>Sex differences in the evaluation and diagnosis of autism spectrum disorders among children</article-title>. <source>Disabil. Health J</source>. <volume>3</volume>, <fpage>107</fpage>&#x02013;<lpage>116</lpage>. <pub-id pub-id-type="doi">10.1016/j.dhjo.2009.07.001</pub-id><pub-id pub-id-type="pmid">21122776</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guan</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>Domain adaptation for medical image analysis: a survey</article-title>. <source>IEEE Trans. Biomed. Eng</source>. <volume>69</volume>, <fpage>1173</fpage>&#x02013;<lpage>1185</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2021.3117407</pub-id><pub-id pub-id-type="pmid">34606445</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guan</surname> <given-names>Z.</given-names></name> <name><surname>Ren</surname> <given-names>C.</given-names></name> <name><surname>Niu</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>P.</given-names></name> <name><surname>Shang</surname> <given-names>Y.</given-names></name></person-group> (<year>2023</year>). <article-title>Great wall construction algorithm: a novel meta-heuristic algorithm for engineer problems</article-title>. <source>Expert Syst. Appl</source>. <volume>233</volume>:<fpage>120905</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.120905</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>He</surname> <given-names>G.</given-names></name> <name><surname>Lu</surname> <given-names>X.-l.</given-names></name></person-group> (<year>2022</year>). <article-title>Good point set and double attractors based-qpso and application in portfolio with transaction fee and financing cost</article-title>. <source>Expert Syst. Appl</source>. <volume>209</volume>:<fpage>118339</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2022.118339</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Heinsfeld</surname> <given-names>A. S.</given-names></name> <name><surname>Franco</surname> <given-names>A. R.</given-names></name> <name><surname>Craddock</surname> <given-names>R. C.</given-names></name> <name><surname>Buchweitz</surname> <given-names>A.</given-names></name> <name><surname>Meneguzzi</surname> <given-names>F.</given-names></name></person-group> (<year>2018</year>). <article-title>Identification of autism spectrum disorder using deep learning and the abide dataset</article-title>. <source>NeuroImage</source> <volume>17</volume>, <fpage>16</fpage>&#x02013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1016/j.nicl.2017.08.017</pub-id><pub-id pub-id-type="pmid">29034163</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Helmi</surname> <given-names>A. M.</given-names></name> <name><surname>Al-Qaness</surname> <given-names>M. A.</given-names></name> <name><surname>Dahou</surname> <given-names>A.</given-names></name> <name><surname>Dama&#x00161;evi&#x0010D;ius</surname> <given-names>R.</given-names></name> <name><surname>Krilavi&#x0010D;ius</surname> <given-names>T.</given-names></name> <name><surname>Elaziz</surname> <given-names>M. A.</given-names></name></person-group> (<year>2021</year>). <article-title>A novel hybrid gradient-based optimizer and grey wolf optimizer feature selection method for human activity recognition using smartphone sensors</article-title>. <source>Entropy</source> <volume>23</volume>:<fpage>1065</fpage>. <pub-id pub-id-type="doi">10.3390/e23081065</pub-id><pub-id pub-id-type="pmid">34441205</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huda</surname> <given-names>S.</given-names></name> <name><surname>Khan</surname> <given-names>D. M.</given-names></name> <name><surname>Masroor</surname> <given-names>K.</given-names></name> <name><surname>Warda Rashid</surname> <given-names>A.</given-names></name> <name><surname>Shabbir</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <article-title>Advancements in automated diagnosis of autism spectrum disorder through deep learning and resting-state functional mri biomarkers: a systematic review</article-title>. <source>Cogn. Neurodyn</source>. <volume>18</volume>, <fpage>3585</fpage>&#x02013;<lpage>3601</lpage>. <pub-id pub-id-type="doi">10.1007/s11571-024-10176-z</pub-id><pub-id pub-id-type="pmid">39712105</pub-id></citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jabbar</surname> <given-names>U.</given-names></name> <name><surname>Iqbal</surname> <given-names>M. W.</given-names></name> <name><surname>Alourani</surname> <given-names>A.</given-names></name> <name><surname>Shinan</surname> <given-names>K.</given-names></name> <name><surname>Alanazi</surname> <given-names>F.</given-names></name> <name><surname>Sarwar</surname> <given-names>N.</given-names></name> <etal/></person-group>. (<year>2025</year>). <article-title>Machine learning-based approach for early screening of autism spectrum disorders</article-title>. <source>Appl. Comput. Intell. Soft Comput</source>. <volume>2025</volume>:<fpage>9975499</fpage>. <pub-id pub-id-type="doi">10.1155/acis/9975499</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Joe</surname> <given-names>C. V.</given-names></name></person-group> (<year>2024</year>). <article-title>Exploring ai robots-based visual strategy in training children with autism disorder</article-title>. <source>J. Innov. Image Proc</source>. <volume>6</volume>, <fpage>40</fpage>&#x02013;<lpage>49</lpage>. <pub-id pub-id-type="doi">10.36548/jiip.2024.1.004</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>John</surname> <given-names>J.</given-names></name> <name><surname>Sala</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>043 Is the prevalence of autism spectrum disorder decreased in black and ethnic children and adolescents?</article-title>. <source>Arch. Disease Childhood</source> <volume>103</volume>, <fpage>A17A</fpage>18. <pub-id pub-id-type="doi">10.1136/goshabs.43</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kaveh</surname> <given-names>A.</given-names></name> <name><surname>Yousefpoor</surname> <given-names>H.</given-names></name></person-group> (<year>2024</year>). <source>Chaotic Meta-Heuristic Algorithms for Optimal Design of Structures</source>. Cham: Springer. <pub-id pub-id-type="doi">10.1007/978-3-031-48918-1</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khan</surname> <given-names>K.</given-names></name> <name><surname>Katarya</surname> <given-names>R.</given-names></name></person-group> (<year>2025</year>). <article-title>Ws-bitm: Integrating white shark optimization with BI-LSTM for enhanced autism spectrum disorder diagnosis</article-title>. <source>J. Neurosci. Methods</source> <volume>413</volume>:<fpage>110319</fpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2024.110319</pub-id><pub-id pub-id-type="pmid">39521353</pub-id></citation></ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lamani</surname> <given-names>M. R.</given-names></name> <name><surname>Benadit</surname> <given-names>P. J.</given-names></name></person-group> (<year>2023</year>). <article-title>Automatic diagnosis of autism spectrum disorder detection using a hybrid feature selection model with graph convolution network</article-title>. <source>SN Comput. Sci</source>. <volume>5</volume>:<fpage>126</fpage>. <pub-id pub-id-type="doi">10.1007/s42979-023-02439-z</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lavelle</surname> <given-names>T. A.</given-names></name> <name><surname>Weinstein</surname> <given-names>M. C.</given-names></name> <name><surname>Newhouse</surname> <given-names>J. P.</given-names></name> <name><surname>Munir</surname> <given-names>K.</given-names></name> <name><surname>Kuhlthau</surname> <given-names>K. A.</given-names></name> <name><surname>Prosser</surname> <given-names>L. A.</given-names></name></person-group> (<year>2014</year>). <article-title>Economic burden of childhood autism spectrum disorders</article-title>. <source>Pediatrics</source> <volume>133</volume>, <fpage>e520</fpage>&#x02013;<lpage>e529</lpage>. <pub-id pub-id-type="doi">10.1542/peds.2013-0763</pub-id><pub-id pub-id-type="pmid">24515505</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Zhou</surname> <given-names>Y.</given-names></name> <name><surname>Dvornek</surname> <given-names>N. C.</given-names></name> <name><surname>Zhang</surname> <given-names>M.</given-names></name> <name><surname>Zhuang</surname> <given-names>J.</given-names></name> <name><surname>Ventola</surname> <given-names>P.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>&#x0201C;Pooling regularized graph neural network for fMRI biomarker analysis,&#x0201D;</article-title> in <source>Medical Image Computing and Computer Assisted Intervention-MICCAI 2020: 23rd International Conference, Lima, Peru, October 4&#x02013;8, 2020, Proceedings, Part VII 23</source> (<publisher-loc>Springer</publisher-loc>), <fpage>625</fpage>&#x02013;<lpage>635</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-59728-3_61</pub-id><pub-id pub-id-type="pmid">33043324</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Hasan</surname> <given-names>M. R.</given-names></name> <name><surname>Gedeon</surname> <given-names>T.</given-names></name> <name><surname>Hossain</surname> <given-names>M. Z.</given-names></name></person-group> (<year>2024</year>). <article-title>Made-for-ASD: a multi-atlas deep ensemble network for diagnosing autism spectrum disorder</article-title>. <source>Comput. Biol. Med</source>. <volume>182</volume>:<fpage>109083</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2024.109083</pub-id><pub-id pub-id-type="pmid">39232404</pub-id></citation></ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lord</surname> <given-names>C.</given-names></name> <name><surname>Elsabbagh</surname> <given-names>M.</given-names></name> <name><surname>Baird</surname> <given-names>G.</given-names></name> <name><surname>Veenstra-Vanderweele</surname> <given-names>J.</given-names></name></person-group> (<year>2018</year>). <article-title>Autism spectrum disorder</article-title>. <source>Lancet</source> <volume>392</volume>, <fpage>508</fpage>&#x02013;<lpage>520</lpage>. <pub-id pub-id-type="doi">10.1016/S0140-6736(18)31129-2</pub-id><pub-id pub-id-type="pmid">30078460</pub-id></citation></ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mellema</surname> <given-names>C. J.</given-names></name> <name><surname>Nguyen</surname> <given-names>K. P.</given-names></name> <name><surname>Treacher</surname> <given-names>A.</given-names></name> <name><surname>Montillo</surname> <given-names>A.</given-names></name></person-group> (<year>2022</year>). <article-title>Reproducible neuroimaging features for diagnosis of autism spectrum disorder with machine learning</article-title>. <source>Sci. Rep</source>. <volume>12</volume>:<fpage>3057</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-022-06459-2</pub-id><pub-id pub-id-type="pmid">35197468</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nielsen</surname> <given-names>J. A.</given-names></name> <name><surname>Zielinski</surname> <given-names>B. A.</given-names></name> <name><surname>Fletcher</surname> <given-names>P. T.</given-names></name> <name><surname>Alexander</surname> <given-names>A. L.</given-names></name> <name><surname>Lange</surname> <given-names>N.</given-names></name> <name><surname>Bigler</surname> <given-names>E. D.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Multisite functional connectivity MRI classification of autism: abide results</article-title>. <source>Front. Hum. Neurosci</source>. <volume>7</volume>:<fpage>599</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2013.00599</pub-id><pub-id pub-id-type="pmid">24093016</pub-id></citation></ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Niu</surname> <given-names>X.</given-names></name> <name><surname>Gou</surname> <given-names>J.</given-names></name> <name><surname>Chang</surname> <given-names>H.</given-names></name> <name><surname>Lowe</surname> <given-names>M.</given-names></name> <name><surname>Zhang</surname> <given-names>F.</given-names></name></person-group> (<year>2022</year>). <article-title>Classification model with weighted regularization to improve the reproducibility of neuroimaging signature selection</article-title>. <source>Stat. Med</source>. <volume>41</volume>, <fpage>5046</fpage>&#x02013;<lpage>5060</lpage>. <pub-id pub-id-type="doi">10.1002/sim.9553</pub-id><pub-id pub-id-type="pmid">36263920</pub-id></citation></ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Niu</surname> <given-names>Y.</given-names></name> <name><surname>Yan</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Niu</surname> <given-names>Y.</given-names></name></person-group> (<year>2022</year>). <article-title>Dynamic opposite learning enhanced artificial ecosystem optimizer for IIR system identification</article-title>. <source>J. Supercomput</source>. <volume>78</volume>, <fpage>13040</fpage>&#x02013;<lpage>13085</lpage>. <pub-id pub-id-type="doi">10.1007/s11227-022-04367-w</pub-id></citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><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>Mirjalili</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>The hiking optimization algorithm: a novel human-based metaheuristic approach</article-title>. <source>Knowl.-Based Syst</source>. <volume>296</volume>:<fpage>111880</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2024.111880</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Parisot</surname> <given-names>S.</given-names></name> <name><surname>Ktena</surname> <given-names>S. I.</given-names></name> <name><surname>Ferrante</surname> <given-names>E.</given-names></name> <name><surname>Lee</surname> <given-names>M.</given-names></name> <name><surname>Guerrero</surname> <given-names>R.</given-names></name> <name><surname>Glocker</surname> <given-names>B.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Disease prediction using graph convolutional networks: application to autism spectrum disorder and Alzheimer&#x00027;s disease</article-title>. <source>Med. Image Anal</source>. <volume>48</volume>, <fpage>117</fpage>&#x02013;<lpage>130</lpage>. <pub-id pub-id-type="doi">10.1016/j.media.2018.06.001</pub-id><pub-id pub-id-type="pmid">29890408</pub-id></citation></ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Patil</surname> <given-names>M.</given-names></name> <name><surname>Iftikhar</surname> <given-names>N.</given-names></name> <name><surname>Ganti</surname> <given-names>L.</given-names></name></person-group> (<year>2024</year>). <article-title>Neuroimaging insights into autism spectrum disorder: structural and functional brain</article-title>. <source>Health Psychol. Res</source>. <volume>12</volume>:<fpage>123439</fpage>. <pub-id pub-id-type="doi">10.52965/001c.123439</pub-id><pub-id pub-id-type="pmid">39944713</pub-id></citation></ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qin</surname> <given-names>L.</given-names></name> <name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Ning</surname> <given-names>W.</given-names></name> <name><surname>Cui</surname> <given-names>M.</given-names></name> <name><surname>Wang</surname> <given-names>Q.</given-names></name></person-group> (<year>2024</year>). <article-title>New advances in the diagnosis and treatment of autism spectrum disorders</article-title>. <source>Eur. J. Med. Res</source>. <volume>29</volume>:<fpage>322</fpage>. <pub-id pub-id-type="doi">10.1186/s40001-024-01916-2</pub-id><pub-id pub-id-type="pmid">38858682</pub-id></citation></ref>
<ref id="B49">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Rahnamayan</surname> <given-names>S.</given-names></name> <name><surname>Tizhoosh</surname> <given-names>H. R.</given-names></name> <name><surname>Salama</surname> <given-names>M. M.</given-names></name></person-group> (<year>2007</year>). <article-title>&#x0201C;Quasi-oppositional differential evolution,&#x0201D;</article-title> in <source>2007 IEEE Congress on Evolutionary Computation</source> (<publisher-loc>IEEE</publisher-loc>), <fpage>2229</fpage>&#x02013;<lpage>2236</lpage>. <pub-id pub-id-type="doi">10.1109/CEC.2007.4424748</pub-id><pub-id pub-id-type="pmid">37514556</pub-id></citation></ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sayers</surname> <given-names>E. W.</given-names></name> <name><surname>Beck</surname> <given-names>J.</given-names></name> <name><surname>Bolton</surname> <given-names>E. E.</given-names></name> <name><surname>Brister</surname> <given-names>J. R.</given-names></name> <name><surname>Chan</surname> <given-names>J.</given-names></name> <name><surname>Comeau</surname> <given-names>D. C.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Database resources of the national center for biotechnology information</article-title>. <source>Nucleic Acids Res</source>. <volume>52</volume>:<fpage>D33</fpage>. <pub-id pub-id-type="doi">10.1093/nar/gkad1044</pub-id><pub-id pub-id-type="pmid">37994677</pub-id></citation></ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schielen</surname> <given-names>S. J.</given-names></name> <name><surname>Pilmeyer</surname> <given-names>J.</given-names></name> <name><surname>Aldenkamp</surname> <given-names>A. P.</given-names></name> <name><surname>Zinger</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>The diagnosis of ASD with MRI: a systematic review and meta-analysis</article-title>. <source>Transl. Psychiatry</source> <volume>14</volume>:<fpage>318</fpage>. <pub-id pub-id-type="doi">10.1038/s41398-024-03024-5</pub-id><pub-id pub-id-type="pmid">39095368</pub-id></citation></ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Simonoff</surname> <given-names>E.</given-names></name> <name><surname>Pickles</surname> <given-names>A.</given-names></name> <name><surname>Charman</surname> <given-names>T.</given-names></name> <name><surname>Chandler</surname> <given-names>S.</given-names></name> <name><surname>Loucas</surname> <given-names>T.</given-names></name> <name><surname>Baird</surname> <given-names>G.</given-names></name></person-group> (<year>2008</year>). <article-title>Psychiatric disorders in children with autism spectrum disorders: prevalence, comorbidity, and associated factors in a population-derived sample</article-title>. <source>J. Am. Acad. Child Adolesc. Psychiatry</source> <volume>47</volume>, <fpage>921</fpage>&#x02013;<lpage>929</lpage>. <pub-id pub-id-type="doi">10.1097/CHI.0b013e318179964f</pub-id><pub-id pub-id-type="pmid">18645422</pub-id></citation></ref>
<ref id="B53">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Supekar</surname> <given-names>K.</given-names></name> <name><surname>Uddin</surname> <given-names>L. Q.</given-names></name> <name><surname>Khouzam</surname> <given-names>A.</given-names></name> <name><surname>Phillips</surname> <given-names>J.</given-names></name> <name><surname>Gaillard</surname> <given-names>W. D.</given-names></name> <name><surname>Kenworthy</surname> <given-names>L. E.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Brain hyperconnectivity in children with autism and its links to social deficits</article-title>. <source>Cell Rep</source>. <volume>5</volume>, <fpage>738</fpage>&#x02013;<lpage>747</lpage>. <pub-id pub-id-type="doi">10.1016/j.celrep.2013.10.001</pub-id><pub-id pub-id-type="pmid">24210821</pub-id></citation></ref>
<ref id="B54">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Tizhoosh</surname> <given-names>H. R.</given-names></name></person-group> (<year>2005</year>). <article-title>&#x0201C;Opposition-based learning: a new scheme for machine intelligence,&#x0201D;</article-title> in <source>International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC&#x00027;06)</source> (<publisher-loc>IEEE</publisher-loc>), <fpage>695</fpage>&#x02013;<lpage>701</lpage>. <pub-id pub-id-type="doi">10.1109/CIMCA.2005.1631345</pub-id></citation>
</ref>
<ref id="B55">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Wu</surname> <given-names>Z.</given-names></name> <name><surname>Rahnamayan</surname> <given-names>S.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Ventresca</surname> <given-names>M.</given-names></name></person-group> (<year>2011</year>). <article-title>Enhancing particle swarm optimization using generalized opposition-based learning</article-title>. <source>Inf. Sci</source>. <volume>181</volume>, <fpage>4699</fpage>&#x02013;<lpage>4714</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2011.03.016</pub-id></citation>
</ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Wu</surname> <given-names>F.-X.</given-names></name> <name><surname>Hayrat</surname> <given-names>R.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Aimafe: autism spectrum disorder identification with multi-atlas deep feature representation and ensemble learning</article-title>. <source>J. Neurosci. Methods</source> <volume>343</volume>:<fpage>108840</fpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2020.108840</pub-id><pub-id pub-id-type="pmid">32653384</pub-id></citation></ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>Y.</given-names></name> <name><surname>Yang</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Kang</surname> <given-names>H.</given-names></name> <name><surname>Yang</surname> <given-names>X.</given-names></name></person-group> (<year>2020</year>). <article-title>Dynamic opposite learning enhanced teaching-learning-based optimization</article-title>. <source>Knowl. Based Syst</source>. <volume>188</volume>:<fpage>104966</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2019.104966</pub-id></citation>
</ref>
<ref id="B58">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>D.</given-names></name> <name><surname>Wu</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>D.</given-names></name> <name><surname>Xu</surname> <given-names>Y.</given-names></name> <name><surname>Zhou</surname> <given-names>X.</given-names></name> <name><surname>Yang</surname> <given-names>Z.</given-names></name></person-group> (<year>2022</year>). <article-title>Dynamic opposite learning enhanced dragonfly algorithm for solving large-scale flexible job shop scheduling problem</article-title>. <source>Knowl. Based Syst</source>. <volume>238</volume>:<fpage>107815</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2021.107815</pub-id></citation>
</ref>
<ref id="B59">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yao</surname> <given-names>M.</given-names></name> <name><surname>Chen</surname> <given-names>Z.</given-names></name> <name><surname>Deng</surname> <given-names>H.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name> <name><surname>Liu</surname> <given-names>T.</given-names></name> <name><surname>Cao</surname> <given-names>C.</given-names></name></person-group> (<year>2025</year>). <article-title>A color image compression and encryption algorithm combining compressed sensing, sudoku matrix, and hyperchaotic map</article-title>. <source>Nonlinear Dyn</source>. <volume>113</volume>, <fpage>2831</fpage>&#x02013;<lpage>2865</lpage>. <pub-id pub-id-type="doi">10.1007/s11071-024-10334-2</pub-id></citation>
</ref>
<ref id="B60">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zeidan</surname> <given-names>J.</given-names></name> <name><surname>Fombonne</surname> <given-names>E.</given-names></name> <name><surname>Scorah</surname> <given-names>J.</given-names></name> <name><surname>Ibrahim</surname> <given-names>A.</given-names></name> <name><surname>Durkin</surname> <given-names>M. S.</given-names></name> <name><surname>Saxena</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Global prevalence of autism: a systematic review update</article-title>. <source>Autism Res</source>. <volume>15</volume>, <fpage>778</fpage>&#x02013;<lpage>790</lpage>. <pub-id pub-id-type="doi">10.1002/aur.2696</pub-id><pub-id pub-id-type="pmid">35238171</pub-id></citation></ref>
<ref id="B61">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhu</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>M.</given-names></name> <name><surname>Huang</surname> <given-names>Q.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name> <name><surname>Wan</surname> <given-names>L.</given-names></name> <name><surname>Huang</surname> <given-names>J.</given-names></name></person-group> (<year>2025</year>). <article-title>Secretary bird optimization algorithm based on quantum computing and multiple strategies improvement for kelm diabetes classification</article-title>. <source>Sci. Rep</source>. <volume>15</volume>:<fpage>3774</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-025-87285-0</pub-id><pub-id pub-id-type="pmid">39885224</pub-id></citation></ref>
</ref-list>
</back>
</article>