<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">28732</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2023.028732</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Brain Functional Network Generation Using Distribution-Regularized Adversarial Graph Autoencoder with Transformer for Dementia Diagnosis</article-title>
<alt-title alt-title-type="left-running-head">Brain Functional Network Generation Using Distribution-Regularized Adversarial Graph Autoencoder with Transformer for Dementia Diagnosis</alt-title>
<alt-title alt-title-type="right-running-head">Brain Functional Network Generation Using Distribution-Regularized Adversarial Graph Autoencoder with Transformer for Dementia Diagnosis</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zuo</surname><given-names>Qiankun</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Hu</surname><given-names>Junhua</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Zhang</surname><given-names>Yudong</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><email>yz461@le.ac.uk</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Pan</surname><given-names>Junren</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Jing</surname><given-names>Changhong</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Chen</surname><given-names>Xuhang</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Meng</surname><given-names>Xiaobo</given-names></name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-8" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hong</surname><given-names>Jin</given-names></name><xref ref-type="aff" rid="aff-7">7</xref><xref ref-type="aff" rid="aff-8">8</xref><email>hongj5@mail2.sysu.edu.cn</email></contrib>
<aff id="aff-1"><label>1</label><institution>School of Information Engineering, Hubei University of Economics</institution>, <addr-line>Wuhan, 430205</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>State Key Laboratory of Simulation and Regulation of Water Cycle in River Basin, China Institute of Water Resources and Hydropower Research</institution>, <addr-line>Beijing, 100038</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>School of Computing and Mathematic Sciences, University of Leicester</institution>, <addr-line>Leicester</addr-line>, LE1 7RH, <country>UK</country></aff>
<aff id="aff-4"><label>4</label><institution>Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences</institution>, <addr-line>Shenzhen, 518055</addr-line>, <country>China</country></aff>
<aff id="aff-5"><label>5</label><institution>Faculty of Science and Technology, University of Macau</institution>, <addr-line>Macau, 999078</addr-line>, <country>China</country></aff>
<aff id="aff-6"><label>6</label><institution>School of Geophysics, Chengdu University of Technology</institution>, <addr-line>Chengdu, 610059</addr-line>, <country>China</country></aff>
<aff id="aff-7"><label>7</label><institution>Laboratory of Artificial Intelligence and 3D Technologies for Cardiovascular Diseases, Guangdong Provincial Key Laboratory of South China Structural Heart Disease, Guangdong Provincial People&#x2019;s Hospital (Guangdong Academy of Medical Sciences), Southern Medical University</institution>, <addr-line>Guangzhou, 519041</addr-line>, <country>China</country></aff>
<aff id="aff-8"><label>8</label><institution>Medical Research Institute, Guangdong Provincial People&#x2019;s Hospital (Guangdong Academy of Medical Sciences), Southern Medical University</institution>, <addr-line>Guangzhou, 519041</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Yudong Zhang. Email: <email>yz461@le.ac.uk</email>; Jin Hong. Email: <email>hongj5@mail2.sysu.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>03</day><month>8</month><year>2023</year></pub-date>
<volume>137</volume>
<issue>3</issue>
<fpage>2129</fpage>
<lpage>2147</lpage>
<history>
<date date-type="received"><day>04</day><month>1</month><year>2023</year>
</date>
<date date-type="accepted"><day>20</day><month>3</month><year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Zuo et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Zuo et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_28732.pdf"></self-uri>
<abstract>
<p>The topological connectivity information derived from the brain functional network can bring new insights for diagnosing and analyzing dementia disorders. The brain functional network is suitable to bridge the correlation between abnormal connectivities and dementia disorders. However, it is challenging to access considerable amounts of brain functional network data, which hinders the widespread application of data-driven models in dementia diagnosis. In this study, a novel distribution-regularized adversarial graph auto-Encoder (DAGAE) with transformer is proposed to generate new fake brain functional networks to augment the brain functional network dataset, improving the dementia diagnosis accuracy of data-driven models. Specifically, the label distribution is estimated to regularize the latent space learned by the graph encoder, which can make the learning process stable and the learned representation robust. Also, the transformer generator is devised to map the node representations into node-to-node connections by exploring the long-term dependence of highly-correlated distant brain regions. The typical topological properties and discriminative features can be preserved entirely. Furthermore, the generated brain functional networks improve the prediction performance using different classifiers, which can be applied to analyze other cognitive diseases. Attempts on the Alzheimer&#x2019;s Disease Neuroimaging Initiative (ADNI) dataset demonstrate that the proposed model can generate good brain functional networks. The classification results show adding generated data can achieve the best accuracy value of 85.33%, sensitivity value of 84.00%, specificity value of 86.67%. The proposed model also achieves superior performance compared with other related augmented models. Overall, the proposed model effectively improves cognitive disease diagnosis by generating diverse brain functional networks.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Adversarial graph encoder</kwd>
<kwd>label distribution</kwd>
<kwd>generative transformer</kwd>
<kwd>functional brain connectivity</kwd>
<kwd>graph convolutional network</kwd>
<kwd>dementia</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>British Heart Foundation Accelerator Award, UK</funding-source>
<award-id>AA&#x2216;18&#x2216;3&#x2216;34220</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Royal Society International Exchanges Cost Share Award, UK</funding-source>
<award-id>RP202G0230</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Hope Foundation for Cancer Research, UK</funding-source>
<award-id>RM60G0680</award-id>
</award-group>
<award-group id="awg4">
<funding-source>Medical Research Council Confidence in Concept Award, UK</funding-source>
<award-id>MC_PC_17171</award-id>
</award-group>
<award-group id="awg5">
<funding-source>Sino-UK Industrial Fund, UK</funding-source>
<award-id>RP202G0289</award-id>
</award-group>
<award-group id="awg6">
<funding-source>Global Challenges Research Fund (GCRF), UK</funding-source>
<award-id>P202PF11</award-id>
</award-group>
<award-group id="awg7">
<funding-source>LIAS Pioneering Partnerships Award, UK</funding-source>
<award-id>P202ED10</award-id>
</award-group>
<award-group id="awg8">
<funding-source>Data Science Enhancement Fund, UK</funding-source>
<award-id>P202RE237</award-id>
</award-group>
<award-group id="awg9">
<funding-source>Fight for Sight, UK</funding-source>
<award-id>24NN201</award-id>
</award-group>
<award-group id="awg10">
<funding-source>Sino-UK Education Fund, UK</funding-source>
<award-id>OP202006</award-id>
</award-group>
<award-group id="awg11">
<funding-source>Biotechnology and Biological Sciences Research Council, UK</funding-source>
<award-id>RM32G0178B8</award-id>
</award-group>
<award-group id="awg12">
<funding-source>LIAS Seed Corn, UK</funding-source>
<award-id>P202RE969</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The brain is an information-processing system with many complicated and precise computations when dealing with various daily activities [<xref ref-type="bibr" rid="ref-1">1</xref>]. Daily physiological activities are always associated with the interaction between multiple neurons, neuronal clusters, or multiple brain regions. This interaction is called brain functional network (BFN), which describes the relationship between temporal blood-oxygen-level-dependent (BOLD) signals from distant brain areas [<xref ref-type="bibr" rid="ref-2">2</xref>]. Dementia (i.e., Alzheimer&#x2019;s Disease, AD) is a typical kind of neuropathic disorder where patients usually show abnormal functional connections between brain regions [<xref ref-type="bibr" rid="ref-3">3</xref>]. It can result in a series of cognitive symptoms: memory impairment, poor language expression, and changes in vision [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. Functional magnetic resonance imaging (fMRI) can easily capture these abnormal features using the non-intrusive scanning technology [<xref ref-type="bibr" rid="ref-6">6</xref>]. The BFN can bring a new way for the diagnosis and analysis of neurodegenerative disorders [<xref ref-type="bibr" rid="ref-7">7</xref>]. Therefore, analysis of BFNs is important to mine complex brain connectivity features and help detect dementia-related biomarkers. It is further important to understand the pathogenic mechanism and the drug discovery for neurodegenerative disorders [<xref ref-type="bibr" rid="ref-8">8</xref>].</p>
<p>The BFN is usually constructed through a software toolbox by splitting the human brain into predefined Region-of-Interests (ROIs) [<xref ref-type="bibr" rid="ref-9">9</xref>]. The element in the BFN matrix indicates the functional correlation between two ROIs. Many approaches based on machine learning were utilized to diagnose neurological disease in an end-to-end scheme [<xref ref-type="bibr" rid="ref-10">10</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>]. For example, Meier et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] applied the support vector machine (SVM) classifier to distinguish older adults from younger adults using functional connectivity data. To boost the Mild Cognitive Impairment (MCI) prediction performance, Yu et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] designed a sparse graph representation learning method with a weighting scheme to generate sparse BFNs. Bi et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] combined convolutional learning and recurrent learning to extract regional connectivity and adjacent positional features, which proves its learning ability in AD diagnosis. More advanced techniques are proposed to explore the complex connectivity-based features [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-22">22</xref>]. Ji et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] devised novel convolutional kernels to capture hierarchical topological characteristics by element-wise weighting brain networks and achieved more accurate classification performance. The work in [<xref ref-type="bibr" rid="ref-24">24</xref>] applied the graph convolutional network (GCN) method to improve the classification accuracy by jointly using the functional time series and connectivity-based matrices. Nevertheless, the limited medical data makes data-driven models challenging to achieve good prediction results.</p>
<p>The straightforward way to improve classification performance is to synthesize more similar medical data and feed it to data-driven models [<xref ref-type="bibr" rid="ref-25">25</xref>,<xref ref-type="bibr" rid="ref-26">26</xref>]. Numerous data-augmented methods have been developed to solve the small data problem in the field of brain imaging analysis. For example, Hong et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] augmented the routine brain magnetic resonance (MR) imaging with scaling, rotation, translation, and gamma correction and achieved accurate results predicting children&#x2019;s brain age through a deep learning model. Hu et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] synthesized the positron emission tomography (PET) from MR using generative models, which can handle the problem of incomplete modalities and is promising for multimodal fusion. However, the above methods cannot be applied to BFN augmentation, because it only considers the local features between adjacent pixels and ignores the topological information between distant pixels. Many efforts have been tried to generate new graph data in the graph domain. Meszl&#x00E9;nyi et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] created some simulated connectivity-based datasets by applying noise weights (NW) to improve the classification performance. The study of [<xref ref-type="bibr" rid="ref-30">30</xref>] solved the problem of small-size data by employing the synthetic minority over-sampling technique (SMOTE) algorithm and achieved a good classification accuracy of non-tumorous facial pigmentation disorders. However, these methods do not directly generate new graph data but interpolate existing brain networks to augment the data, which brings some noise and may have some side effects on the model&#x2019;s classification performance.</p>
<p>The generative adversarial networks (GANs) [<xref ref-type="bibr" rid="ref-31">31</xref>] is a two-player game that can produce quite good results by mutual game learning [<xref ref-type="bibr" rid="ref-32">32</xref>]. It has gained broad applications in analyzing medical imaging because of its strong ability in distribution fitting [<xref ref-type="bibr" rid="ref-33">33</xref>]. These applications cover the image-related fields, including cross-modal synthesis [<xref ref-type="bibr" rid="ref-34">34</xref>], point cloud generation [<xref ref-type="bibr" rid="ref-35">35</xref>], image super-resolution [<xref ref-type="bibr" rid="ref-36">36</xref>], disease classification [<xref ref-type="bibr" rid="ref-37">37</xref>&#x2013;<xref ref-type="bibr" rid="ref-39">39</xref>], regression task [<xref ref-type="bibr" rid="ref-40">40</xref>,<xref ref-type="bibr" rid="ref-41">41</xref>], and organ segmentation [<xref ref-type="bibr" rid="ref-42">42</xref>]. Besides, the prior distribution can guide the model&#x2019;s optimization and thus stabilize the representation learning in the GAN&#x2019;s training [<xref ref-type="bibr" rid="ref-43">43</xref>]. Reference [<xref ref-type="bibr" rid="ref-44">44</xref>] introduced a Gaussian distribution to constrain the graph embedding in adversarial learning and achieved good performance in graph analytics. The GAN-based model has been applied in the BFN augmentation. For example, Tan et al. [<xref ref-type="bibr" rid="ref-45">45</xref>] utilized the Gaussian noise to synthesize BFNs by applying a semi-positive definite manifold constraint. Also, the transformer network [<xref ref-type="bibr" rid="ref-46">46</xref>] can greatly improve image classification performance by combining adversarial strategy, which can model a strong relationship between distant ROIs.</p>
<p>Motivated by these observations, in this study, a novel distribution-regularized adversarial graph autoencoder (DAGAE) model is proposed to generate BFNs for dementia diagnosis. The main works of this paper are as follows: (1) The label distribution is estimated to regularize the latent space learned by the graph encoder, which can make the learning process stable and deduce a robust representation. (2) The transformer-based network in the generator is introduced to map the node representations into node-to-node connections by exploring the global connectivity information between distant ROIs. It preserves the main topological properties and more discriminative features. (3) The generated BFNs enhance disease prediction using different classifiers, which can be applied to analyze other related brain diseases.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Materials and Methods</title>
<sec id="s2_1">
<label>2.1</label>
<title>Data Preparation</title>
<p>The purpose of the Alzheimer&#x2019;s Disease Neuroimaging Initiative (ADNI) project<xref ref-type="fn" rid="fn1"><sup>1</sup></xref><fn id="fn1"><p><ext-link ext-link-type="uri" xlink:href="https://adni.loni.usc.edu/">http://adni.loni.usc.edu/</ext-link></p></fn> is to detect the early stage of Alzheimer&#x2019;s disease from clinical, imaging, gene, biomarker, and other aspects. In this study, we mainly focus on the Late Mild Cognitive Impairment (LMCI) stage scanned with functional Magnetic Resonance Imaging (fMRI). To eliminate the influence of category imbalance on model classification performance, we selected the same number of NC subjects as LMCI for the experiment. About 150 subjects with fMRI were selected to test our model&#x2019;s effectiveness, including 75 Normal Controls (NC) and 75 LMCI. The fMRI data were scanned with the filed strength of <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mn>3.0</mml:mn></mml:math></inline-formula> Tesla. The turning angle is <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mn>80</mml:mn></mml:math></inline-formula> degrees, and the time of repetition (TR) is in the range of <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mn>0.607</mml:mn><mml:mrow><mml:mo>&#x223C;</mml:mo></mml:mrow><mml:mn>3.0</mml:mn><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:math></inline-formula>. The scanning time for each subject is about 10 min.</p>
<p>The commonly used GRETNA [<xref ref-type="bibr" rid="ref-47">47</xref>] software is adopted to preprocess the fMRI to construct graph data. The detailed procedures include format conversion, first ten volumes removal, slice timing, head motion realign, normalizing, spatially smooth, detrend, and temporally filtering (usually <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mn>0.01</mml:mn><mml:mrow><mml:mo>&#x223C;</mml:mo></mml:mrow><mml:mn>0.08</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">z</mml:mi></mml:mrow></mml:math></inline-formula>). At last, the automated anatomical labeling (AAL) atlas [<xref ref-type="bibr" rid="ref-48">48</xref>] with ninety non-overlapping ROIs is warped to the fMRI volumes for obtaining functional features <italic>F</italic>. The <italic>F</italic> with the size <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mn>90</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>187</mml:mn></mml:math></inline-formula> is transformed into a BFN <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with the dimension size <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mn>90</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>90</mml:mn></mml:math></inline-formula> by the Pearson coefficient algorithm.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Distribution-Regularized Adversarial Graph Autoencoder</title>
<p>The BFN is generated by the designed DAGAE model, which is depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. It accepts the graph data (including brain functional feature <italic>F</italic> and BFN <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) and corresponding label (i.e., <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>), outputs the reconstructed brain network <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and the generated brain network <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The proposed DAGAE contains three parts: the label distribution estimation (LDE), the adversarial graph encoder (AGE), and the transformer generator (TG). The LDE module is devised to compute the probability distribution of latent node features, which can robustly constrain the graph encoder for node representation learning. The TG maps latent node space to graph space, which decodes the node representations to BFNs. Four objective functions are utilized to optimize the model, including adversarial loss, reconstruction loss, node-representation consistent loss, and cross-entropy loss.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The architecture of the proposed DAGAE model. It accepts brain functional feature <italic>F</italic> and BFN <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with a specific label and outputs reconstructed or generated BFN (i.e., <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). The model has four parts: Graph encoder, classifier, discriminator, and transformer generator</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-1.tif"/>
</fig>
<sec id="s2_2_1">
<label>2.2.1</label>
<title>Label Distribution Estimation</title>
<p>To improve the performance of node representation in latent space, the label probability distribution estimated by Kernel Density Estimation (KDE) is introduced in the node representation learning. Instead of the traditional normal distribution, it can reflect the accurate distribution of node features and ensure robust representations in the model training. In the feature space, the node feature <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>F</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mn>187</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> is first passed through a dimension reduction operation to get <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, and then sent to the KDE for distribution estimation. <italic>N</italic> means the number of brain regions, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>p</mml:mi></mml:math></inline-formula> is the dimension of <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>. The estimated label distribution <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>F</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is defined as:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mtable columnalign="right left" rowspacing="3pt" columnspacing="0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>F</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mi>Y</mml:mi></mml:msub><mml:mi>b</mml:mi></mml:mrow></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><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:msub><mml:mi>n</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mi>b</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>where, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>n</mml:mi><mml:mi>Y</mml:mi></mml:msub></mml:math></inline-formula> is the subject number with specfic disease (i.e., <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> means the NC, <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> means the LMCI) subjects. <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>K</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a predefined kernel function (i.e., Gaussian), and <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>b</mml:mi></mml:math></inline-formula> means the kernel&#x2019;s bandwidth.</p>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title>Adversarial Graph Encoder</title>
<p>The graph encoder accepts both <italic>F</italic> and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and outputs the latent node representation <italic>H</italic>. To make the node representation learning stable, a prior distribution is introduced to guide the learning process. The graph encoder <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow></mml:math></inline-formula> consists of two GCN layers, where each layer is followed by an activation function. The output dimension of GCN layers is 64 and 32, respectively. The first and second activations are the <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> functions, respectively. The graph encoder can be expressed as:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>G</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The node representation <italic>H</italic> is treated as a fake sample to send to the discriminator <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:mtext mathvariant="bold">D</mml:mtext></mml:mrow></mml:math></inline-formula>. The loss function of the graph encoder in adversarial training is:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">D</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula></p>
<p>The graph encoder aims to enforce the latent node representation <italic>H</italic> to be consistent with the estimated label distribution <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula>. The estimated label distribution <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula> is utilized to guide the graph encoder to learn a robust representation. The discriminator plays as a referee to supervise the graph encoder to learn a distribution-consistent representation. Specifically, we sample a matrix <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> from the distribution <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula>. The sampled matrix <italic>X</italic> is the real sample for adversarial learning, while the fake sample is the output <italic>H</italic> of the graph encoder. As shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the discriminator comprises <italic>N</italic> sub-networks, where each discriminates the true or false of only one ROI representation. Each subnetwork is built on a three-layer perceptron with hidden neurons 32, 64, and 1. Each subnetwork consists of a <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:math></inline-formula> activation function to keep the output in the range of <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mn>0</mml:mn><mml:mrow><mml:mo>&#x223C;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:math></inline-formula>. The output of the discriminator is the mean value of all the subnetwork outputs. The discriminator loss is:</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Illustration of the discriminator and classifier structure. The input of the discriminator is a matrix computed from either latent node representation <italic>H</italic> or label distribution <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula>, and the output is true (1) or false (0)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-2.tif"/>
</fig>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">D</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">D</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula></p>
<p>In addition, to make the node representation discriminative, the cross-entropy loss is introduced to further regularize the learned node representation. The binary classifier <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:mtext mathvariant="bold">C</mml:mtext></mml:mrow></mml:math></inline-formula> is shown in the lower part of <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The node representation <italic>H</italic> passes five Multi-Layer Perceptron (MLP) and outputs a vector with two elements, followed by a softmax to predict the most likely disease category. The classifier loss can be computed as follows:</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">C</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula></p>
<p>here, the <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>y</mml:mi></mml:math></inline-formula> is a one-hot vector (i.e., [0,1] represents the LMCI, and [1,0] represents NC).</p>
</sec>
<sec id="s2_2_3">
<label>2.2.3</label>
<title>Trasnformer Generator</title>
<p>The transformer generator <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow></mml:math></inline-formula> process maps each node in latent space <italic>H</italic> to a reconstructed graph <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Also, the <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow></mml:math></inline-formula> can generate similar brain networks <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> by inputting matrix <italic>X</italic> sampled from the label distribution <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula>. The generator module comprises three connectivity transformer (CT) layers, two dimensions upscaling (DU) layers, and connectivity prediction operation. The connectivity transformer layer contains norm, linear mapping (LM), head split, attention, dot-product, and concatenate. 4, 8, and 11 heads are designed in the three successive CT layers. Note that each CT&#x2019;s input and output dimension is the same. The output dimension of the two DU layers is 64 and 187, respectively. Each DU has only one layer. After latent representation <italic>H</italic> passes through the CT and DU layers, the inner product and <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> activation function are utilized to predict connectivity with the range <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>&#x223C;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:math></inline-formula>. The reconstructed BFN <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and generated BFN <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are given by:</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:msub><mml:mi>U</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:msub><mml:mi>U</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:msub><mml:mi>U</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The reconstruction loss is adopted to preserve the original graph structure while making the autoencoder training stable. We choose the L1 norm to measure the distance between the original <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and reconstructed <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. It is defined as:</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>M</mml:mi><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>Moreover, to make the generator learning more stable, we put the reconstructed brain network <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to the graph encoder and obtain consistent node representation <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>. The node-representation consistent loss is calculated by minimizing the distance generated between <italic>H</italic> and <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>:</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mo>&#x223C;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>H</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mover><mml:mi>H</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">E</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Classification Training and Evaluation Metrics</title>
<p>In summary, the optimization strategy of the proposed DAGAE updates the weights of the graph encoder, discriminator, classifier, and transformer generator. The hybrid loss is defined by:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>r</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>As illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, we send the training set to the DAGAE model for training and augment the BFN with the transformer generator. The detailed training of the DAGAE model is shown in Algorithm 1. Inspired by the method [<xref ref-type="bibr" rid="ref-49">49</xref>,<xref ref-type="bibr" rid="ref-50">50</xref>], the latent feature learning can be stable when the optimization converges. For each label (i.e., NC and LMCI), we sample matrics from the distribution <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula> and generate <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>k</mml:mi></mml:math></inline-formula> times the number of original BFNs. It should be noted that the generated BFNs are not seen in the test set.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The entire workflow of this work. In the training stage, the transformer generator is first extracted from the trained DAGAE and then maps the distribution-sampled representation into generated BFNs (<inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). At last, the combination of the generated and original BFNs is utilized for training the classifier. In the testing stage, only the original BFNs in the testing set are used to predict the disease label</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-3.tif"/>
</fig>
<p>In the classification stage, we build a sample graph classifier modified from [<xref ref-type="bibr" rid="ref-24">24</xref>], including two GCN layers with 32 and 16 hidden neurons, one graph pooling, and one MLP layer with two neurons. The original training set is first used to train the graph classifier. Then the generated BFNs are mixed in the training set to finetune the classifier for enhancing classification performance. At last, the trained classifier predicts disease labels of the testing set for performance evaluation. There are four commonly used metrics for the prediction assessment: Accuracy (ACC), Specificity (SPE), Sensitivity (SEN), and the Area Under the receiver operating characteristic Curve (AUC). They are defined as:</p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>where, <italic>TN</italic> means that NC is correctly predicted, <italic>TL</italic> means that LMCI is correctly predicted. <italic>FN</italic> means that NC is incorrectly predicted, <italic>FL</italic> means that LMCI is incorrectly predicted.</p>
<fig id="fig-13">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-13.tif"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experiment and Results</title>
<sec id="s3_1">
<label>3.1</label>
<title>Experimental Setup</title>
<p>We adopt the 5-fold cross-validation strategy in the experiment to conduct the training and testing. The preprocessed data is evenly separated into five folds, meaning each fold contains 15 NCs and 15 LMCIs. We first selected one-fold data and sent the rest of the four folds data (60 NCs and 60 LMCIs) into the DAGAE model for training. Next, the trained generator is used to generate <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>k</mml:mi></mml:math></inline-formula> (default value 1.0) times the training data. Then the generated and original training data are jointly to train the classifier. Finally, the classifier predicts the disease label of the selected one-fold data for performance evaluation. In this experiment, three other augmented methods (i.e., EW [<xref ref-type="bibr" rid="ref-29">29</xref>], SMOTE [<xref ref-type="bibr" rid="ref-30">30</xref>] and ARAE [<xref ref-type="bibr" rid="ref-44">44</xref>]) and three classical classifiers (i.e., SVM [<xref ref-type="bibr" rid="ref-51">51</xref>], DNN [<xref ref-type="bibr" rid="ref-52">52</xref>], and GCN [<xref ref-type="bibr" rid="ref-53">53</xref>]) are introduced to test the effectiveness of the proposed model.</p>
<p>The DAGAE is trained on Ubuntu18.04 using the TensorFlow framework for BFN synthesis. The graphical device is one GPU with NVIDIA Quadro P4000 8.0 GB. We set the model&#x2019;s parameters with the values as follows: <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn>90</mml:mn><mml:mo>,</mml:mo><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>32</mml:mn></mml:math></inline-formula>. In the DAGAE training, we first update the weighting parameters of the graph encoder, classifier, and discriminator and then optimize the generator parameters. The learning rate for the encoder and the discriminator is set at <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mn>0.001</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mn>0.0001</mml:mn></mml:math></inline-formula>, respectively. The learning rate of the classifier and the generator are the same as the discriminator. The Adam algorithm is selected for training with batch size 16. The learning process terminates when the discriminator cannot identify the input from the node representation or the prior label distribution and the change of total loss is stable. After the DAGAE has been trained, the generator is used to augment BFNs for training the classifier. The learning rate of the classifier is set as <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mn>0.0001</mml:mn></mml:math></inline-formula>. We took about <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mn>1000</mml:mn></mml:math></inline-formula> epochs for training to ensure the classifier&#x2019;s convergence. The ACC value is defined as the classification performance evaluation, which is used to optimize the classifiers.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Prediction Performance</title>
<p>In the experiment, it is essential to constrain the latent node representation to follow the label distribution. This constraint can diminish the model overfitting and stabilize the representation learning. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the adversarial loss over epochs in the training process. In the beginning, the encoder loss falls, and the discriminator rises. After 250 epochs, both keep around 0.5 steadily, which means the adversarial training converges. After the training, the transformer generator generates new BFNs by accepting node representation matrices sampled from the label distribution <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:msub><mml:mi>P</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:math></inline-formula>. As shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, examples of the original and generated BFNs are compared qualitatively. It can be seen that the generated BFN can preserve the main patterns of the original BFN.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The loss curve of the adversarial training. It is utilized to constrain the latent node representations in the label distribution</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Visualization of the original and generated BFNs. The left column shows the original BFNs at NC and LMCI stages, and the right column shows the generated BFNs at NC and LMCI stages</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-5.tif"/>
</fig>
<p>We analyze the classification performance with different classifiers to investigate the proposed model&#x2019;s effectiveness. As shown in <xref ref-type="table" rid="table-1">Table 1</xref>, the generated BFNs can gain better classification performance over original BFNs. Among the three augmented methods, our model achieved superior results in three classifiers with more than 10 percent of ACC value compared to results using original BFNs. Also, our model increases the ACC value by 1.3%, 2.0%, and 3.3% compared with the competing ARAE method for GCN, DNN, and SVM classifiers, respectively. This evidence proves that the proposed model can generate more effective BFNs for classification improvement. To detail the effectiveness of the GCN-based classifier, <xref ref-type="fig" rid="fig-6">Figs. 6a</xref> and <xref ref-type="fig" rid="fig-6">6b</xref> show that the prediction results using a GCN-based classifier achieves the best performance than other traditional classifiers. Note that both original and generated BFNs using different methods are sent to the same classifier for classification performance evaluation. <xref ref-type="fig" rid="fig-7">Fig. 7</xref> also shows better performance of the GCN-based classifier. Our model shows superior prediction performance in terms of ACC, SEN, SPE, and AUC by achieving 85.33%, 84.0%, 86.67%, and 86.42%. It probably indicates that the GCN-based classifier can benefit the topological properties buried in the BFNs and enhance the classification of BFNs.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of classification performance using different generated BFNs</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>BFNs generated from</th>
<th>Classifier</th>
<th>ACC</th>
<th>SEN</th>
<th>SPE</th>
<th>AUC</th>
</tr>
</thead>
<tbody>
<tr>
<td>Original</td>
<td>SVM</td>
<td>64.00%</td>
<td>58.66%</td>
<td>69.33%</td>
<td>69.85%</td>
</tr>
<tr>
<td>EW [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>SVM</td>
<td>68.00%</td>
<td>70.67%</td>
<td>65.33%</td>
<td>74.63%</td>
</tr>
<tr>
<td>SMOTE [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>SVM</td>
<td>75.33%</td>
<td>78.67%</td>
<td>72.00%</td>
<td>79.70%</td>
</tr>
<tr>
<td>ARAE [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>SVM</td>
<td>77.33%</td>
<td>70.67%</td>
<td>74.00%</td>
<td>79.11%</td>
</tr>
<tr>
<td><bold>Our model</bold></td>
<td>SVM</td>
<td><bold>80.67</bold>%</td>
<td><bold>80.00</bold>%</td>
<td><bold>81.33</bold>%</td>
<td><bold>84.62</bold>%</td>
</tr>
<tr>
<td>Original</td>
<td>DNN</td>
<td>70.67%</td>
<td>69.33%</td>
<td>72.00%</td>
<td>73.71%</td>
</tr>
<tr>
<td>EW [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>DNN</td>
<td>75.33%</td>
<td>70.67%</td>
<td>79.99%</td>
<td>77.10%</td>
</tr>
<tr>
<td>SMOTE [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>DNN</td>
<td>80.67%</td>
<td>78.67%</td>
<td>82.67%</td>
<td>82.66%</td>
</tr>
<tr>
<td>ARAE [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>DNN</td>
<td>81.33%</td>
<td>77.33%</td>
<td>85.33%</td>
<td>84.44%</td>
</tr>
<tr>
<td><bold>Our model</bold></td>
<td>DNN</td>
<td><bold>83.33</bold>%</td>
<td><bold>80.00</bold>%</td>
<td><bold>86.67</bold>%</td>
<td><bold>85.32</bold>%</td>
</tr>
<tr>
<td>Original</td>
<td>GCN</td>
<td>73.33%</td>
<td>72.00%</td>
<td>74.67%</td>
<td>76.28%</td>
</tr>
<tr>
<td>EW [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>GCN</td>
<td>80.67%</td>
<td>81.33%</td>
<td>79.99%</td>
<td>82.95%</td>
</tr>
<tr>
<td>SMOTE [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>GCN</td>
<td>82.67%</td>
<td>81.33%</td>
<td>84.00%</td>
<td>83.56%</td>
</tr>
<tr>
<td>ARAE [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>GCN</td>
<td>84.00%</td>
<td>82.67%</td>
<td>85.33%</td>
<td>86.91%</td>
</tr>
<tr>
<td><bold>Our model</bold></td>
<td>GCN</td>
<td><bold>85.33</bold>%</td>
<td><bold>84.00</bold>%</td>
<td><bold>86.67</bold>%</td>
<td>86.42%</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The prediction performance comparison using three classifiers by inputting BFNs from (a) our model, (b) original</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-6.tif"/>
</fig><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>The comparison of ROC curves using three classifiers. The gray dotted line represents the random classifier</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-7.tif"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Evaluation of the Generated BFNs</title>
<p>In this section, we evaluate the coherence between original and generated BFNs. We generated the same size as the original data in each one-fold training. We employed the t-distributed Stochastic Neighbour Embedding (t-SNE) tool [<xref ref-type="bibr" rid="ref-54">54</xref>] to analyze the graphical characteristics. <xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows the projection of the embedding representation of original and generated BFNs from high-dimensional space to two-dimensional space. The generated data is consistent with the original data distribution, which ensures the similarity between the generated and original FBNs. In addition, six common metrics are utilized to quantitatively measure the effectiveness of the generated data. These six metrics can provide a relatively reliable measure of generated BFN&#x2019;s quality, including clustering coefficient, node strength, betweenness centrality, modularity, local efficiency, and global efficiency. As shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the boxplot distribution of each metric is compared between the generated and original BFNs. The generated data can mostly cover the range of graph metrics from the original data. Therefore, the generated BFNs by our model contains non-Euclidean characteristics and preserve the overall nature of brain connectivity, which is suitable to augment the BFNs for dementia diagnosis.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The comparison of embedded t-SNE representation between the original and generated BFNs</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-8.tif"/>
</fig><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Statistical analysis of the original and generated BFN. (A) Cluster coefficient, (B) Node strength, (C) Betweenness centrality, (D) Modularity, (E) Global efficiency, and (F) Local efficiency</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-9.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Discussion</title>
<p>The proposed DAGAE model can generate new BFNs for improving classification performance. Each module in the model contributes to the generation quality of BFNs. To analyze the influence of different modules, we remove the encoder, discriminator, and classifier from the DAGAE model and evaluate the final classification performance. <xref ref-type="fig" rid="fig-10">Fig. 10</xref> demonstrates that the encoder significantly impacts the whole model. It drops by 16% in terms of ACC by removing the encoder module. The discriminator ensures the latent node representation in a prior distribution, which also influences the quality of the generated BFNs. This suggests the usefulness of prior label distribution can regularize the latent representation with a stable learning strategy and enhance the BFN classification. Furthermore, we study the dimension <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>p</mml:mi></mml:math></inline-formula> of the latent node representation <italic>H</italic> in the prediction performance. As shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>, the value of ACC and AUC shows relatively stable fluctuation when <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>p</mml:mi></mml:math></inline-formula> exceeds <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mn>32</mml:mn></mml:math></inline-formula>. Considering the computation efficiency, we select <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>32</mml:mn></mml:math></inline-formula> in the experiment. The transformer generator is essential for the generated BFN quality. We study two variations of the designed transformer generator to test its effectiveness. (1) Remove the DU layer in the generator (No-DU), which means the input and output dimension is the same as the dimension of latent representation <italic>H</italic>; (2) remove the connectivity transformer (No-CT), which simplifies the generator into two layer perceptrons. The results are illustrated in <xref ref-type="table" rid="table-2">Table 2</xref>; it can be seen that the combination of DU and CT achieves the best prediction performance. The classification results demonstrate the effectiveness of the transformer generator in the model. This can be explained by that the transformer-based network in the generator preserves the main topological properties and captures more discriminative features.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption><title>Influence of different modules on the classification performance. (a) The proposed DAGAE, (b) DAGAE without encoder, (c) DAGAE without discriminator, and (d) DAGAE without the classifier</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Impact of the dimension <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>p</mml:mi></mml:math></inline-formula> of the learned node representation <italic>H</italic> on the ACC and AUC</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-11.tif"/>
</fig><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Effect of different structures in the transformer generator</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>ACC</th>
<th>SEN</th>
<th>SPE</th>
<th>AUC</th>
</tr>
</thead>
<tbody>
<tr>
<td>Our model</td>
<td><bold>85.33</bold>%</td>
<td>84.00%</td>
<td><bold>86.67</bold>%</td>
<td><bold>86.42</bold>%</td>
</tr>
<tr>
<td>No-DU</td>
<td>81.33%</td>
<td>84.00%</td>
<td>78.67%</td>
<td>82.84%</td>
</tr>
<tr>
<td>No-CT</td>
<td>78.67%</td>
<td>82.67%</td>
<td>74.67%</td>
<td>82.63%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Data-driven models achieve better performance by using large amounts of data. To investigate how much generated data influences the prediction performance, we generate <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo fence="false" stretchy="false">{</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:mn>8</mml:mn><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> times the original training set, combine the original BFNs and generated BFNs to train the SVM-based and GCN-based classifier. The mean ACC is estimated by predicting five-fold original test sets separately. The metric <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula> is defined as <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula>. Here, <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> refers to the predicted results of the classifier trained using the original train set, and the <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> refers to the predicted results of the classifier trained using the original and generated data. <xref ref-type="fig" rid="fig-12">Fig. 12</xref> gives the different quantities of generated BFNs that maximizes classification performance in both classifiers. The best quantity of generated data is about five times the original data, with the largest <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula> value of 19.3% and 13.3% for the SVM and GCN classifier, respectively. The reason why more data degrades classification performance may be that the generated BFNs bring a lot of noise. Besides, compared with the SVM classifier, the GCN-based classifier increases by 5.3% on the best ACC value. This marginal increase may be explained by considering the topological information among the brain regions, which can characterize the disease-related features of the BFNs. Thus, in the BFN augmentation experiment, it is better to choose the GCN-based classifier to evaluate the prediction performance, and different quantities of generated BFNs should be explored to maximize the effect of data augmentation.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Classification accuracy analysis using different amounts of generated data by our model using (a) SVM and (b) GCN classifier, respectively</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_28732-fig-12.tif"/>
</fig>
<p>Although the proposed DAGAE is promising in augmenting the BFN data for disease prediction, there are still two limitations that have not been considered. (1) The label distribution is estimated using the limited training data, which can not add other prior knowledge. We will introduce disease-related anatomical brain knowledge into the model for performance evaluation. (2) The data in this work are deliberately picked out to maintain category balance. The real condition in the category distribution is always imbalanced. In the following study, we will try to apply the proposed DAGAE in category-imbalanced datasets for other brain disorder diagnosis.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions</title>
<p>This study proposes a novel DAGAE model to augment new BFNs for dementia diagnosis. The BFN augmentation is different from traditional image synthesis, where the latter only extracts local patterns and ignores the topological information buried in the brain network. Our model is novel in two aspects. One is that the estimated label distribution can regularize the latent space and make the learning process stable. Another one is that the transformer generator is devised to map the node representations into node-to-node connections by exploring the long-term dependence of highly-correlated distant brain regions, which preserves the main topological properties and more discriminative features. Testing on the Alzheimer&#x2019;s Disease Neuroimaging Initiative (ADNI) public dataset, the proposed DAGAE can generate similar and high-quality BFNs. The classification results show that adding generated data can achieve higher accuracy values of 85.33%, 83.33%, and 80.67% than the original method using GCN, DNN, and SVM classifiers, respectively. The proposed model also performs better than related augmented models, providing new insight for improving cognitive disease diagnosis accuracy.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>This paper is partially supported by the British Heart Foundation Accelerator Award, UK (AA&#x2216;18&#x2216;3&#x2216;34220); Royal Society International Exchanges Cost Share Award, UK (RP202G0230); Hope Foundation for Cancer Research, UK (RM60G0680); Medical Research Council Confidence in Concept Award, UK (MC_PC_17171); Sino-UK Industrial Fund, UK (RP202G0289); Global Challenges Research Fund (GCRF), UK (P202PF11); LIAS Pioneering Partnerships Award, UK (P202ED10); Data Science Enhancement Fund, UK (P202RE237); Fight for Sight, UK (24NN201); Sino-UK Education Fund, UK (OP202006); Biotechnology and Biological Sciences Research Council, UK (RM32G0178B8); LIAS Seed Corn, UK (P202RE969).</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Samarasinghe</surname>, <given-names>R. A.</given-names></string-name>, <string-name><surname>Miranda</surname>, <given-names>O. A.</given-names></string-name>, <string-name><surname>Buth</surname>, <given-names>J. E.</given-names></string-name>, <string-name><surname>Mitchell</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Ferando</surname>, <given-names>I.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Identification of neural oscillations and epileptiform changes in human brain organoids</article-title>. <source>Nature Neuroscience</source><italic>,</italic> <volume>24</volume><italic>(</italic><issue>10</issue><italic>),</italic> <fpage>1488</fpage>&#x2013;<lpage>1500</lpage>; <pub-id pub-id-type="pmid">34426698</pub-id></mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Su&#x00E1;rez</surname>, <given-names>L. E.</given-names></string-name>, <string-name><surname>Markello</surname>, <given-names>R. D.</given-names></string-name>, <string-name><surname>Betzel</surname>, <given-names>R. F.</given-names></string-name>, <string-name><surname>Misic</surname>, <given-names>B.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Linking structure and function in macroscale brain networks</article-title>. <source>Trends in Cognitive Sciences</source><italic>,</italic> <volume>24</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>302</fpage>&#x2013;<lpage>315</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schumacher</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Peraza</surname>, <given-names>L. R.</given-names></string-name>, <string-name><surname>Firbank</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Thomas</surname>, <given-names>A. J.</given-names></string-name>, <string-name><surname>Kaiser</surname>, <given-names>M.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Dynamic functional connectivity changes in dementia with lewy bodies and alzheimer&#x2019;s disease</article-title>. <source>NeuroImage: Clinical</source><italic>,</italic> <volume>22</volume><italic>(</italic><issue>37</issue><italic>),</italic> <fpage>101812</fpage>; <pub-id pub-id-type="pmid">30991620</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Borelli</surname>, <given-names>C. M.</given-names></string-name>, <string-name><surname>Grennan</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Muth</surname>, <given-names>C. C.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Causes of memory loss in elderly persons</article-title>. <source>JAMA</source><italic>,</italic> <volume>323</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>486</fpage>&#x2013;<lpage>486</lpage>; <pub-id pub-id-type="pmid">32016311</pub-id></mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Berron</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Vogel</surname>, <given-names>J. W.</given-names></string-name>, <string-name><surname>Insel</surname>, <given-names>P. S.</given-names></string-name>, <string-name><surname>Pereira</surname>, <given-names>J. B.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Early stages of tau pathology and its associations with functional connectivity, atrophy and memory</article-title>. <source>Brain</source><italic>,</italic> <volume>144</volume><italic>(</italic><issue>9</issue><italic>),</italic> <fpage>2771</fpage>&#x2013;<lpage>2783</lpage>; <pub-id pub-id-type="pmid">33725124</pub-id></mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Caprihan</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Adair</surname>, <given-names>J. C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Altered static and dynamic functional network connectivity in alzheimer&#x2019;s disease and subcortical ischemic vascular disease: Shared and specific brain connectivity abnormalities</article-title>. <source>Human Brain Mapping</source><italic>,</italic> <volume>40</volume><italic>(</italic><issue>11</issue><italic>),</italic> <fpage>3203</fpage>&#x2013;<lpage>3221</lpage>; <pub-id pub-id-type="pmid">30950567</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Dillman</surname>, <given-names>J. R.</given-names></string-name>, <string-name><surname>Parikh</surname>, <given-names>N. A.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>A multichannel deep neural network model analyzing multiscale functional brain connectome data for attention deficit hyperactivity disorder detection</article-title>. <source>Radiology: Artificial Intelligence</source><italic>,</italic> <volume>2</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>e190012</fpage>; <pub-id pub-id-type="pmid">32076663</pub-id></mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ma</surname>, <given-names>W. Y.</given-names></string-name>, <string-name><surname>Yao</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>G. J.</given-names></string-name>, <string-name><surname>Ge</surname>, <given-names>H. L.</given-names></string-name>, <string-name><surname>Xue</surname>, <given-names>C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Reorganization of rich clubs in functional brain networks of dementia with lewy bodies and alzheimer&#x2019;s disease</article-title>. <source>NeuroImage: Clinical</source><italic>,</italic> <volume>33</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>102930</fpage>; <pub-id pub-id-type="pmid">34959050</pub-id></mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zuo</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Multimodal representations learning and adversarial hypergraph fusion for early alzheimer&#x2019;s disease prediction</article-title>. <conf-name>Chinese Conference on Pattern Recognition and Computer Vision (PRCV)</conf-name>, <publisher-loc>Beijing, China</publisher-loc>, <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Teipel</surname>, <given-names>S. J.</given-names></string-name>, <string-name><surname>Wohlert</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Metzger</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Grimmer</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Sorg</surname>, <given-names>C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2017</year>). <article-title>Multicenter stability of resting state fMRI in the detection of alzheimer&#x2019;s disease and amnestic MCI</article-title>. <source>NeuroImage: Clinical</source><italic>,</italic> <volume>14</volume><italic>(</italic><issue>Suppl. 3</issue><italic>),</italic> <fpage>183</fpage>&#x2013;<lpage>194</lpage>; <pub-id pub-id-type="pmid">28180077</pub-id></mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ahmed</surname>, <given-names>M. R.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Lo</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Inan</surname>, <given-names>O. T.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2018</year>). <article-title>Neuroimaging and machine learning for dementia diagnosis: Recent advancements and future prospects</article-title>. <source>IEEE Reviews in Biomedical Engineering</source><italic>,</italic> <volume>12</volume><italic>,</italic> <fpage>19</fpage>&#x2013;<lpage>33</lpage>; <pub-id pub-id-type="pmid">30561351</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Automatic recognition of mild cognitive impairment and alzheimers disease using ensemble based 3D densely connected convolutional networks</article-title>. <conf-name>2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA)</conf-name>, <publisher-loc>Orlando, FL, USA</publisher-loc>, <publisher-name>IEEE</publisher-name>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hong</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S. H.</given-names></string-name>, <string-name><surname>Cheng</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>J.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Classification of cerebral microbleeds based on fully-optimized convolutional neural network</article-title>. <source>Multimedia Tools and Applications</source><italic>,</italic> <volume>79</volume><italic>(</italic><issue>21</issue><italic>),</italic> <fpage>15151</fpage>&#x2013;<lpage>15169</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Morphological feature visualization of alzheimer&#x2019;s disease via multidirectional perception GAN</article-title>. <source>IEEE Transactions on Neural Networks and Learning Systems</source><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>15</lpage>. <publisher-loc>USA</publisher-loc>, <publisher-name>IEEE</publisher-name>. <pub-id pub-id-type="doi">10.1109/TNNLS.2021.3118369</pub-id>; <pub-id pub-id-type="pmid">35320106</pub-id></mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zong</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Jing</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Zuo</surname>, <given-names>Q.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Multiscale autoencoder with structural-functional attention network for alzheimer&#x2019;s disease prediction</article-title>. <conf-name>Chinese Conference on Pattern Recognition and Computer Vision (PRCV)</conf-name>, <publisher-loc>Shenzhen, China</publisher-loc>, <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sheykhivand</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Rezaii</surname>, <given-names>T. Y.</given-names></string-name>, <string-name><surname>Mousavi</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Delpak</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Farzamnia</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Automatic identification of epileptic seizures from EEG signals using sparse representation-based classification</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>8</volume><italic>,</italic> <fpage>138834</fpage>&#x2013;<lpage>138845</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Meier</surname>, <given-names>T. B.</given-names></string-name>, <string-name><surname>Desphande</surname>, <given-names>A. S.</given-names></string-name>, <string-name><surname>Vergun</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Nair</surname>, <given-names>V. A.</given-names></string-name>, <string-name><surname>Song</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2012</year>). <article-title>Support vector machine classification and characterization of age-related reorganization of functional brain networks</article-title>. <source>NeuroImage</source><italic>,</italic> <volume>60</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>601</fpage>&#x2013;<lpage>613</lpage>; <pub-id pub-id-type="pmid">22227886</pub-id></mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Qiao</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>S. W.</given-names></string-name>, <string-name><surname>Fei</surname>, <given-names>X.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Weighted graph regularized sparse brain network construction for MCI identification</article-title>. <source>Pattern Recognition</source><italic>,</italic> <volume>90</volume><italic>,</italic> <fpage>220</fpage>&#x2013;<lpage>231</lpage>; <pub-id pub-id-type="pmid">31579345</pub-id></mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bi</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Functional brain network classification for alzheimer&#x2019;s disease detection with deep features and extreme learning machine</article-title>. <source>Cognitive Computation</source><italic>,</italic> <volume>12</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>513</fpage>&#x2013;<lpage>527</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kawahara</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Brown</surname>, <given-names>C. J.</given-names></string-name>, <string-name><surname>Miller</surname>, <given-names>S. P.</given-names></string-name>, <string-name><surname>Booth</surname>, <given-names>B. G.</given-names></string-name>, <string-name><surname>Chau</surname>, <given-names>V.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2017</year>). <article-title>BrainNetCNN: Convolutional neural networks for brain networks; towards predicting neurodevelopment</article-title>. <source>NeuroImage</source><italic>,</italic> <volume>146</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>1038</fpage>&#x2013;<lpage>1049</lpage>; <pub-id pub-id-type="pmid">27693612</pub-id></mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Xiao</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Cao</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yue</surname>, <given-names>G.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Multi-scale enhanced graph convolutional network for early mild cognitive impairment detection</article-title>. <conf-name>International Conference on Medical Image Computing and Computer-Assisted Intervention</conf-name>, <publisher-loc>Lima, Peru</publisher-loc>, <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xiao</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Kassani</surname>, <given-names>P. H.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Bai</surname>, <given-names>Y.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Multi-hypergraph learning-based brain functional connectivity analysis in fMRI data</article-title>. <source>IEEE Transactions on Medical Imaging</source><italic>,</italic> <volume>39</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>1746</fpage>&#x2013;<lpage>1758</lpage>; <pub-id pub-id-type="pmid">31796393</pub-id></mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ji</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Xing</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Yao</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Convolutional kernels with an element-wise weighting mechanism for identifying abnormal brain connectivity patterns</article-title>. <source>Pattern Recognition</source><italic>,</italic> <volume>109</volume><italic>(</italic><issue>16</issue><italic>),</italic> <fpage>107570</fpage>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zuo</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Lu</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Zuo</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Ouyang</surname>, <given-names>T.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Constructing brain functional network by adversarial temporal-spatial aligned transformer for early AD analysis</article-title>. <source>Frontiers in Neuroscience</source><italic>,</italic> <volume>16</volume><italic>,</italic> <fpage>108815</fpage>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ren</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Lcdae: Data augmented ensemble framework for lung cancer classification</article-title>. <source>Technology in Cancer Research &#x0026; Treatment</source><italic>,</italic> <volume>21</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>15330338221124372</fpage>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ramaraj</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Govindaraj</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y. D.</given-names></string-name>, <string-name><surname>Murugan</surname>, <given-names>P. R.</given-names></string-name>, <string-name><surname>Thiyagarajan</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Brain anomaly prediction with the intervention of fuzzy based clustering and optimization techniques for augmenting clinical diagnosis</article-title>. <conf-name>2021 3rd International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)</conf-name>, <publisher-loc>Greater Noida, India</publisher-loc>, <publisher-name>IEEE</publisher-name>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hong</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S. H.</given-names></string-name>, <string-name><surname>Peet</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y. D.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Brain age prediction of children using routine brain MR images via deep learning</article-title>. <source>Frontiers in Neurology</source><italic>,</italic> <volume>11</volume><italic>,</italic> <fpage>584682</fpage>; <pub-id pub-id-type="pmid">33193046</pub-id></mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Bidirectional mapping generative adversarial networks for brain MR to pet synthesis</article-title>. <source>IEEE Transactions on Medical Imaging</source><italic>,</italic> <volume>41</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>145</fpage>&#x2013;<lpage>157</lpage>; <pub-id pub-id-type="pmid">34428138</pub-id></mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Meszl&#x00E9;nyi</surname>, <given-names>R. J.</given-names></string-name>, <string-name><surname>Buza</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Vidny&#x00E1;nszky</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Resting state fMRI functional connectivity-based classification using a convolutional neural network architecture</article-title>. <source>Frontiers in Neuroinformatics</source><italic>,</italic> <volume>11</volume><italic>,</italic> <fpage>61</fpage>.</mixed-citation></ref>
<ref id="ref-30"><label>30.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gao</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Peng</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Nguyen</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Liang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Thng</surname>, <given-names>S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Classification of non-tumorous facial pigmentation disorders using deep learning and smote.</article-title> <conf-name>2019 IEEE International Symposium on Circuits and Systems (ISCAS)</conf-name>, <publisher-loc>Sapporo, Japan</publisher-loc>, <publisher-name>IEEE</publisher-name>.</mixed-citation></ref>
<ref id="ref-31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Goodfellow</surname>, <given-names>I.</given-names></string-name>, <string-name><surname>Pouget-Abadie</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Mirza</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Warde-Farley</surname>, <given-names>D.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Generative adversarial networks</article-title>. <source>Communications of the ACM</source><italic>,</italic> <volume>63</volume><italic>(</italic><issue>11</issue><italic>),</italic> <fpage>139</fpage>&#x2013;<lpage>144</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hong</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>S. C. H.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Unsupervised domain adaptation for cross-modality liver segmentation via joint adversarial learning and self-learning</article-title>. <source>Applied Soft Computing</source><italic>,</italic> <volume>121</volume><italic>,</italic> <fpage>108729</fpage>.</mixed-citation></ref>
<ref id="ref-33"><label>33.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Brain MR to pet synthesis via bidirectional generative adversarial network. <italic>International Conference on Medical Image Computing and Computer-Assisted Intervention</italic></article-title>, <publisher-loc>Cham</publisher-loc>, <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-34"><label>34.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Yuan</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Cross-modality synthesis from MRI to pet using adversarial U-Net with different normalization</article-title>. <conf-name>2019 International Conference on Medical Imaging Physics and Engineering (ICMIPE)</conf-name>, <publisher-loc>Shenzhen, China</publisher-loc>, <publisher-name>IEEE</publisher-name>.</mixed-citation></ref>
<ref id="ref-35"><label>35.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A point cloud generative model via tree-structured graph convolutions for 3D brain shape reconstruction</article-title>. <conf-name>Chinese Conference on Pattern Recognition and Computer Vision (PRCV)</conf-name>, <publisher-loc>Beijing, China</publisher-loc>, <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-36"><label>36.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>You</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Chui</surname>, <given-names>C. K.</given-names></string-name>, <string-name><surname>Cheung</surname>, <given-names>A. C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <chapter-title>Fine perceptive gans for brain MR image super-resolution in wavelet domain</chapter-title>. <source>IEEE Transactions on Neural Networks and Learning Systems</source>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>. <publisher-loc>USA</publisher-loc>, <publisher-name>IEEE</publisher-name>. <pub-id pub-id-type="doi">10.1109/TNNLS.2022.3153088</pub-id></mixed-citation></ref>
<ref id="ref-37"><label>37.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Z.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Diabetic retinopathy diagnosis using multichannel generative adversarial network with semisupervision</article-title>. <source>IEEE Transactions on Automation Science and Engineering</source><italic>,</italic> <volume>18</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>574</fpage>&#x2013;<lpage>585</lpage>.</mixed-citation></ref>
<ref id="ref-38"><label>38.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Ng</surname>, <given-names>M. K.</given-names></string-name>, <string-name><surname>Cheung</surname>, <given-names>A. C.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Tensorizing gan with high-order pooling for alzheimer&#x2019;s disease assessment</article-title>. <source>IEEE Transactions on Neural Networks and Learning Systems</source><italic>,</italic> <volume>33</volume><italic>(</italic><issue>9</issue><italic>),</italic>
<fpage>4945</fpage>&#x2013;<lpage>4959</lpage>.</mixed-citation></ref>
<ref id="ref-39"><label>39.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sheykhivand</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Mousavi</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Mojtahedi</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Rezaii</surname>, <given-names>T. Y.</given-names></string-name>, <string-name><surname>Farzamnia</surname>, <given-names>A.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Developing an efficient deep neural network for automatic detection of COVID-19 using chest x-ray images</article-title>. <source>Alexandria Engineering Journal</source><italic>,</italic> <volume>60</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>2885</fpage>&#x2013;<lpage>2903</lpage>.</mixed-citation></ref>
<ref id="ref-40"><label>40.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Liang</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>F.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Predicting clinical scores for alzheimer&#x2019;s disease based on joint and deep learning</article-title>. <source>Expert Systems with Applications</source><italic>,</italic> <volume>187</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>115966</fpage>.</mixed-citation></ref>
<ref id="ref-41"><label>41.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Disentangled-multimodal adversarial autoencoder: Application to infant age prediction with incomplete multimodal neuroimages</article-title>. <source>IEEE Transactions on Medical Imaging</source><italic>,</italic> <volume>39</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>4137</fpage>&#x2013;<lpage>4149</lpage>; <pub-id pub-id-type="pmid">32746154</pub-id></mixed-citation></ref>
<ref id="ref-42"><label>42.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hong</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y. D.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Source-free unsupervised domain adaptation for cross-modality abdominal multi-organ segmentation</article-title>. <source>Knowledge-Based Systems</source><italic>,</italic> <volume>250</volume><italic>,</italic> <fpage>109155</fpage>.</mixed-citation></ref>
<ref id="ref-43"><label>43.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Zuo</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>B.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>A prior guided adversarial representation learning and hypergraph perceptual network for predicting abnormal connections of alzheimer&#x2019;s disease</article-title>. <comment>arXiv preprint arXiv:2110.09302</comment>.</mixed-citation></ref>
<ref id="ref-44"><label>44.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Pan</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Long</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yao</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2018</year>). <article-title>Adversarially regularized graph autoencoder for graph embedding</article-title>. <comment>arXiv preprint arXiv:1802.04407</comment>.</mixed-citation></ref>
<ref id="ref-45"><label>45.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>Y. F.</given-names></string-name>, <string-name><surname>Ting</surname>, <given-names>C. M.</given-names></string-name>, <string-name><surname>Noman</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Phan</surname>, <given-names>R. C. W.</given-names></string-name>, <string-name><surname>Ombao</surname>, <given-names>H.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Graph-regularized manifold-aware conditional wasserstein gan for brain functional connectivity generation</article-title>. <comment>arXiv preprint arXiv:2212.05316</comment>.</mixed-citation></ref>
<ref id="ref-46"><label>46.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jiang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Chang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Transgan: Two pure transformers can make one strong gan, and that can scale up</article-title>. <source>Advances in Neural Information Processing Systems</source><italic>,</italic> <volume>34</volume><italic>,</italic> <fpage>14745</fpage>&#x2013;<lpage>14758</lpage>.</mixed-citation></ref>
<ref id="ref-47"><label>47.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Xia</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Liao</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Evans</surname>, <given-names>A.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2015</year>). <article-title>GRETNA: A graph theoretical network analysis toolbox for imaging connectomics</article-title>. <source>Frontiers in Human Neuroscience</source><italic>,</italic> <volume>9</volume><italic>,</italic> <fpage>386</fpage>; <pub-id pub-id-type="pmid">26175682</pub-id></mixed-citation></ref>
<ref id="ref-48"><label>48.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tzourio-Mazoyer</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Landeau</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Papathanassiou</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Crivello</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Etard</surname>, <given-names>O.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2002</year>). <article-title>Automated anatomical labeling of activations in SPM using a macroscopic anatomical parcellation of the MNI MRI single-subject brain</article-title>. <source>NeuroImage</source><italic>,</italic> <volume>15</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>273</fpage>&#x2013;<lpage>289</lpage>; <pub-id pub-id-type="pmid">11771995</pub-id></mixed-citation></ref>
<ref id="ref-49"><label>49.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mahajan</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Pandit</surname>, <given-names>A. K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Hybrid method to supervise feature selection using signal processing and complex algebra techniques</article-title>. <source>Multimedia Tools and Applications</source><italic>,</italic> <volume>82</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>1</fpage>&#x2013;<lpage>22</lpage>.</mixed-citation></ref>
<ref id="ref-50"><label>50.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mahajan</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Abualigah</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Pandit</surname>, <given-names>A. K.</given-names></string-name>, <string-name><surname>Altalhi</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Hybrid aquila optimizer with arithmetic optimization algorithm for global optimization tasks</article-title>. <source>Soft Computing</source><italic>,</italic> <volume>26</volume><italic>(</italic><issue>10</issue><italic>),</italic> <fpage>4863</fpage>&#x2013;<lpage>4881</lpage>.</mixed-citation></ref>
<ref id="ref-51"><label>51.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hearst</surname>, <given-names>M. A.</given-names></string-name>, <string-name><surname>Dumais</surname>, <given-names>S. T.</given-names></string-name>, <string-name><surname>Osuna</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Platt</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Scholkopf</surname>, <given-names>B.</given-names></string-name></person-group> (<year>1998</year>). <article-title>Support vector machines</article-title>. <source>IEEE Intelligent Systems and their Applications</source><italic>,</italic> <volume>13</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>18</fpage>&#x2013;<lpage>28</lpage>.</mixed-citation></ref>
<ref id="ref-52"><label>52.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kong</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Gao</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Pan</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Classification of autism spectrum disorder by combining brain connectivity and deep neural network classifier</article-title>. <source>Neurocomputing</source><italic>,</italic> <volume>324</volume><italic>,</italic> <fpage>63</fpage>&#x2013;<lpage>68</lpage>.</mixed-citation></ref>
<ref id="ref-53"><label>53.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Kipf</surname>, <given-names>T. N.</given-names></string-name>, <string-name><surname>Welling</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Semi-supervised classification with graph convolutional networks</article-title>. <comment>arXiv preprint arXiv:1609.02907</comment>.</mixed-citation></ref>
<ref id="ref-54"><label>54.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>van der Maaten</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Hinton</surname>, <given-names>G.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Visualizing data using t-SNE</article-title>. <source>Journal of Machine Learning Research</source><italic>,</italic> <volume>9</volume><italic>(</italic><issue>11</issue><italic>),</italic> <fpage>2579</fpage>&#x2013;<lpage>2605</lpage>.</mixed-citation></ref>
</ref-list>
</back></article>