<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurosci.</journal-id>
<journal-title>Frontiers in Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-453X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnins.2023.1194190</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Spatial-temporal data-augmentation-based functional brain network analysis for brain disorders identification</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" equal-contrib="yes">
<name><surname>Liu</surname> <given-names>Qinghua</given-names></name>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2125437/overview"/>
</contrib>
<contrib contrib-type="author" equal-contrib="yes">
<name><surname>Zhang</surname> <given-names>Yangyang</given-names></name>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Guo</surname> <given-names>Lingyun</given-names></name>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Wang</surname> <given-names>ZhengXia</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2045025/overview"/>
</contrib>
</contrib-group>
<aff><institution>School of Computer Science and Technology, Hainan University</institution>, <addr-line>Haikou</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Yang Li, Beihang University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Xiaoke Hao, Hebei University of Technology, China; Xiaoqi Sheng, South China University of Technology, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: ZhengXia Wang <email>zxiawang&#x00040;hainanu.edu.cn</email></corresp>
<fn fn-type="equal" id="fn001"><p>&#x02020;These authors have contributed equally to this work</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>17</day>
<month>05</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>17</volume>
<elocation-id>1194190</elocation-id>
<history>
<date date-type="received">
<day>26</day>
<month>03</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>04</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 Liu, Zhang, Guo and Wang.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Liu, Zhang, Guo and Wang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Due to the lack of devices and the difficulty of gathering patients, the small sample size is one of the most challenging problems in functional brain network (FBN) analysis. Previous studies have attempted to solve this problem of sample limitation through data augmentation methods, such as sample transformation and noise addition. However, these methods ignore the unique spatial-temporal information of functional magnetic resonance imaging (fMRI) data, which is essential for FBN analysis.</p>
</sec>
<sec>
<title>Methods</title>
<p>To address this issue, we propose a spatial-temporal data-augmentation-based classification (STDAC) scheme that can fuse the spatial-temporal information, increase the samples, while improving the classification performance. Firstly, we propose a spatial augmentation module utilizing the spatial prior knowledge, which was ignored by previous augmentation methods. Secondly, we design a temporal augmentation module by random discontinuous sampling period, which can generate more samples than former approaches. Finally, a tensor fusion method is used to combine the features from the above two modules, which can make efficient use of spatial-temporal information of fMRI simultaneously. Besides, we apply our scheme to different types of classifiers to verify the generalization performance. To evaluate the effectiveness of our proposed scheme, we conduct extensive experiments on the Alzheimer&#x00027;s Disease Neuroimaging Initiative (ADNI) dataset and REST-meta-MDD Project (MDD) dataset.</p>
</sec>
<sec>
<title>Results</title>
<p>Experimental results show that the proposed scheme achieves superior classification accuracy (ADNI: 82.942%, MDD: 63.406%) and feature interpretation on the benchmark datasets.</p>
</sec>
<sec>
<title>Discussion</title>
<p>The proposed STDAC scheme, utilizing both spatial and temporal information, can generate more diverse samples than former augmentation methods for brain disorder classification and analysis.</p>
</sec>
</abstract>
<kwd-group>
<kwd>rs-fMRI</kwd>
<kwd>spatial-temporal information</kwd>
<kwd>functional brain network</kwd>
<kwd>data augmentation</kwd>
<kwd>brain disorders</kwd>
</kwd-group>
<contract-num rid="cn001">82160345</contract-num>
<contract-num rid="cn002">W81XWH-12-2-0012</contract-num>
<contract-sponsor id="cn001">National Natural Science Foundation of China<named-content content-type="fundref-id">10.13039/501100001809</named-content></contract-sponsor>
<contract-sponsor id="cn002">DoD Alzheimer&#x00027;s Disease Neuroimaging Initiative<named-content content-type="fundref-id">10.13039/100014041</named-content></contract-sponsor>
<counts>
<fig-count count="7"/>
<table-count count="3"/>
<equation-count count="4"/>
<ref-count count="36"/>
<page-count count="11"/>
<word-count count="6183"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Brain Imaging Methods</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Functional brain network (FBN) analysis, based on resting-state functional magnetic resonance imaging (rs-fMRI), has made positive contributions to the diagnosis of brain diseases and the revelation of the principle of brain diseases (Smith, <xref ref-type="bibr" rid="B23">2012</xref>). As an effective technique to analyze FBNs, machine learning has become a current focus of research by automatically analyzing rs-fMRI data to obtain rules and applying these rules to predict new data (Taschereau-Dumouchel et al., <xref ref-type="bibr" rid="B25">2022</xref>). However, due to the difficulty of acquisition and collection, the sample size of rs-fMRI is scarce compared to classical dataset used in machine learning (Tanveer et al., <xref ref-type="bibr" rid="B24">2020</xref>; Zhang et al., <xref ref-type="bibr" rid="B33">2023</xref>), which may result in under- or over-fitting of the model for FBN analysis (Marek et al., <xref ref-type="bibr" rid="B14">2022</xref>).</p>
<p>To solve the problem of small training sizes, data augmentation has shown great potential in FBN analysis. Numerous studies have directly transferred image data augmentation methods to rs-fMRI data. For example, noise addition (Yang et al., <xref ref-type="bibr" rid="B29">2020</xref>), which is a classical and simple augmentation method for image data, was applied to add different kinds of noise to rs-fMRI data for increasing sample size. However, this method is more geared toward improving the ability of machine learning to resist noise interference, rather than obtaining more diverse samples (Fang et al., <xref ref-type="bibr" rid="B7">2022</xref>). Therefore, it is an important purpose to generate more diversified samples in data augmentation.</p>
<p>Many studies have focused on using efficient algorithms to obtain more diverse samples. For example, Eslami and Saeed (<xref ref-type="bibr" rid="B6">2019</xref>) used the extended SMOTE algorithm to generate new samples by linear interpolating different samples in the same category. Yao and Lu (<xref ref-type="bibr" rid="B30">2019</xref>) proposed an improved generative adversarial network to augment rs-fMRI functional connectivity data for classification task. Although sample generation based on the above algorithms has achieved good performance in the field of rs-fMRI data augmentation, the speciality (e.g., spatial-temporal information; Yan et al., <xref ref-type="bibr" rid="B28">2022</xref>) of rs-fMRI data that provides valuable information for understanding the pathological mechanism of brain disorders is ignored in these methods.</p>
<p>Considering the importance of temporal information in FBN analysis, more and more studies focus on data augmentation based on time series of rs-fMRI. For example, Dvornek et al. (<xref ref-type="bibr" rid="B5">2017</xref>) proposed a data augmentation method by randomly cropping sequences from a time series, which increased the size of the dataset by a factor of 10. Zhu et al. (<xref ref-type="bibr" rid="B35">2021</xref>) used random window resampling for data augmentation, which generated more samples by obtaining random consecutive time series from the original brain signal. In addition, Mao et al. (<xref ref-type="bibr" rid="B13">2019</xref>) introduced a data augmentation method by sampling fMRI scans into short pieces and taking the sampled pieces as inputs for classification. Qiang et al. (<xref ref-type="bibr" rid="B17">2021</xref>) constructed a deep recurrent variational auto-encoder that combined variational auto-encoder and recurrent neural network to aim the small sample size problem of fMRI data. These methods took full account of the temporal information of rs-fMRI data. However, these data augmentation methods ignored the spatial information that is an important structural characteristics of FBN.</p>
<p>To solve the problems of the above mentioned, we propose a novel classification scheme based on spatial-temporal data augmentation that consists of three modules, including spatial augmentation module, temporal augmentation module, and spatial-temporal fusion module. Inspired by jackknife cross-validation, which is effective in reducing linear model bias, we improve the previous sampling method that only used sliding window through discontinuous sampling. On the other hand, as there is often a correlation between adjacent brain regions, using spatial prior information obtained from brain anatomy will help the classifier&#x00027;s analytical ability. Compared with previous approaches, our scheme can produce more diverse training samples and make full use of spatial-temporal information of fMRI. Specifically,</p>
<list list-type="simple">
<list-item><p>(1) We proposed a spatial data augment method, in which spatial prior knowledge of brain regions is used by a <italic>k</italic>NN-like approach.</p></list-item>
<list-item><p>(2) Different from previous methods, we randomly extract discontinuous time series form original time period and recombine them. It can generate more diverse training samples than previous methods which only use continuous series.</p></list-item>
<list-item><p>(3) To prevent the mutual interference of different augmentation rule, we use a tensor fusion method to fuse results of classification after different kinds of augmentation. In this way, we can take spatial-temporal information into account at the same time, which is ignored by previous data-augmentation-based methods.</p></list-item>
</list>
<p>We validate our proposed scheme mainly on the public ADNI dataset, and the experimental results demonstrate its superiority over other methods. Besides, we train our scheme based on different classifiers (e.g., neural network, random forest, and support vector machine) and compare their effects. Experiments show that our scheme can fit well with different classifiers.</p>
<p>The rest of the paper is organized as follows. During Section 2, we present our scheme and introduce the dataset used in our scheme. The experiments that we take will be introduced during Section 3. Then the comparison between different data augmentation methods and the disease-related features (functional connections) will be discussed in Section 4. Finally, we will summarize the conclusions of this paper in Section 5.</p>
</sec>
<sec sec-type="materials and methods" id="s2">
<title>2. Materials and methods</title>
<p>In this section, we first introduce the datasets involved in our experiments, including data acquisition and pre-processing. Then we describe the overall pipeline of our proposed scheme in detail.</p>
<sec>
<title>2.1. Experimental datasets</title>
<p>To validate the effectiveness of the proposed method, we perform two datasets for disease classification, including the publicly available ADNI dataset and the MDD dataset.</p>
<sec>
<title>2.1.1. ADNI dataset</title>
<p>Our main experimental data is from the Alzheimer&#x00027;s disease neuroimaging initiative (ADNI) dataset (Jack et al., <xref ref-type="bibr" rid="B10">2008</xref>). This dataset includes 563 subjects, 154 of whom are normal cognition (NC), 165 of whom are early mild cognitive impairment (eMCI), 145 of whom are late mild cognitive impairment (lMCI), and 99 of whom are Alzheimer&#x00027;s disease (AD). The acquisition parameters are as follows: in-plane image resolution = 2.29&#x02013;3.31 mm, slice thickness = 3.31 mm, echo time (TE) = 30 ms, repetition time (TR) = 2.2&#x02013;3.1 s, and the scanning time for each subject is 7 min (resulting in 140 volumes).</p>
</sec>
<sec>
<title>2.1.2. MDD dataset</title>
<p>To demonstrate the effectiveness of our scheme on different rs-fMRI datasets, a major depressive disorder (MDD) dataset provided and pre-processed by the REST-meta-MDD project (Yan et al., <xref ref-type="bibr" rid="B26">2019</xref>; Chen et al., <xref ref-type="bibr" rid="B4">2022</xref>) is experimented in Section 3. The REST-meta-MDD dataset consists of 1,276 major depressive disorder samples from 24 different sites. Specifically, patients with major depressive disorder (MDD) contain 463 men and 813 women, normal controls (NC) contain 462 men and 641 women. The acquisition parameters are as follows: repetition time (TR) = 2,000&#x02013;3,000 ms; echo time (TE) = 25&#x02013;40 ms; flip angle = 30 or 90&#x000B0;; slice number = 22&#x02013;39.</p>
</sec>
</sec>
<sec>
<title>2.2. Data preprocessing</title>
<p>The pipeline of pre-processing for MDD dataset is provided by the REST-meta-MDD project, which consists of head motion correction, spatial normalization, non-linear registration, and spatial smoothing, and so on (Yan et al., <xref ref-type="bibr" rid="B26">2019</xref>).</p>
<p>However, since we only have access to the preprocessed MMD dataset, it is difficult to control the preprocessing pipeline. Therefore, for the sake of fairness, we employ a similar pipeline as in the MDD dataset to pre-process the ADNI dataset in our experiments. We use the Data Processing Assistant for Resting-State fMRI (DPABI) toolbox (Yan et al., <xref ref-type="bibr" rid="B27">2016</xref>) to preprocess the fMRI data.</p>
<p>Specifically, we discard the initial 10 volumes to avoid outliers and performed slice-timing correction. After that, the time series of images for each subject are realigned using a six-parameter (rigid body) linear transformation. Then, we co-register individual T1-weighted images to the mean functional image using a 6 degrees-of-freedom linear transformation without re-sampling. The Friston 24-parameter model is utilized to regress out head motion effects. Finally, we map the fMRI data to the 116 brain regions of the AAL template, convert them into time-series signals, and normalize these signals (Friston et al., <xref ref-type="bibr" rid="B9">2000</xref>). For each subject, we can get 137 time points for each region of interest (ROI) of AAL template after above steps.</p>
</sec>
<sec>
<title>2.3. Methods</title>
<p>The framework of our STDAC scheme is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>, which consists of three modules, including spatial augmentation module, temporal augmentation module, and spatial-temporal fusion module. We denote <inline-formula><mml:math id="M1"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> as the matrix of rs-fMRI data, where <italic>m</italic> is the total number of nodes, <italic>t</italic> is the number of time points, <inline-formula><mml:math id="M2"><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the time series of the <italic>ith</italic> (<italic>i</italic> &#x0003D; 1, &#x022EF;&#x02009;, <italic>m</italic>) node.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Illustration of the proposed scheme based on spatial-temporal data augmentation (STDAC).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0001.tif"/>
</fig>
<sec>
<title>2.3.1. Spatial augmentation module</title>
<p>Previous studies have found that brain regions with similar spatial information have similar representations, and various methods for FBN analysis have been proposed based on the spatial information of fMRI (Zou et al., <xref ref-type="bibr" rid="B36">2022</xref>). For example, many FBN division methods (Power et al., <xref ref-type="bibr" rid="B16">2011</xref>; Ji et al., <xref ref-type="bibr" rid="B11">2019</xref>) based on spatial feature have been proposed to search the discriminative subnetworks that are significant for brain disease (Sheline and Raichle, <xref ref-type="bibr" rid="B22">2013</xref>). In our proposed STDAC scheme, we use a <italic>k</italic>NN-like approach to augment samples with spatial prior knowledge of brain regions.</p>
<p>As shown in the module (1) of <xref ref-type="fig" rid="F1">Figure 1</xref>, we first measure the Euclidean space distance between node <italic>i</italic> and other nodes based on the AAL template. The measurement method is provided by the nilearn library (Abraham et al., <xref ref-type="bibr" rid="B1">2014</xref>). Then we update the time series <italic>x</italic><sub><italic>i</italic></sub> of node <italic>i</italic> based on the <italic>k</italic> nearest neighbors (nodes) to obtain the new time series <italic>y</italic><sub><italic>i</italic></sub>. Specifically, we put the <italic>k</italic> nearest neighbors of node <italic>i</italic> in a set <italic>C</italic><sub><italic>i</italic></sub> which has the following restrictions:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>&#x02264;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x02209;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>r</mml:mi><mml:mo>*</mml:mo><mml:mi>D</mml:mi></mml:mtd><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo>&#x0003C;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>d</italic>(&#x000B7;) is the Euclidean space distance, <italic>r</italic> is a constant number, and <italic>D</italic> is the biggest distance in AAL template. Finally, the node <italic>i</italic> can be updated by the following equation:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>After all nodes of the brain are updated, we can get a new sample (brain). Note, we can obtain different samples by adjusting the size of <italic>k</italic>. Once we obtain the new sample, we utilize Pearson&#x00027;s correlation (PC) to estimate the FBN, which can capture the full correlation between nodes and has gradually become one of the benchmark methods in this field. With the increase of training data, the ability of the model to use high-dimensional features is also improved. So we did not perform feature selection commonly used in conventional FBN analysis methods.</p>
</sec>
<sec>
<title>2.3.2. Temporal augmentation module</title>
<p>Temporal information in rs-fMRI is essential for FBN analysis and is commonly employed in data augmentation studies. Previous methods usually use time windows to generate more samples by obtaining random consecutive time series from raw brain signals. Unlike employing consecutive time series, the time period obtained can be random in our scheme, meaning that it can generate more training samples from a single original sample.</p>
<p>Specifically, we obtain new time series <italic>z</italic><sub><italic>i</italic></sub> by randomly selecting <italic>x</italic><sub><italic>i</italic></sub> and reorganizing the selected vectors as the following equation:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x022EF;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x02003;&#x000A0;</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02208;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>l</italic> denotes the number of selected time points, which should be smaller than <italic>t</italic>. We limit the minimum number of sampling points to prevent too few samples, which may cause the sampling position to be too sparse. Jackknife cross-validation is a method that excels at reducing errors in linear regression models and is widely used in statistical analysis. According to jackknife cross-validation, this method of randomly selecting time periods without caring about continuity would be helpful to obtain an average value when computing the Pearson correlation (Barber et al., <xref ref-type="bibr" rid="B3">2021</xref>), which calculates the linear correlation between two sets of data. We try to use this method to reduce estimation bias of brain interval connections. Similar to the spatial augmentation module, we then construct FBN based on these augmented samples.</p>
</sec>
<sec>
<title>2.3.3. Spatial-temporal fusion module</title>
<p>In this spatial-temporal fusion module, we fuse the results extracted from temporal and spatial data augmentation module to prevent the mutual interference of samples generated by different augmentation rules. Different from feature fusion, we perform the tensor fusion method to fuse the results of classification after temporal data augmentation and spatial data augmentation.</p>
<p>As shown in the module (4) in <xref ref-type="fig" rid="F1">Figure 1</xref>, we train two classifiers with the augmented samples based on different modules, and obtain the classification results by the original sample as a test. Specifically, we use multiplication operations on the high-dimensional maps of the two outcome tensors. Specifically, we transpose the vector of label score obtained from spatial augmentation and multiply it with the temporal score vector. Compared to directly concatenating two vectors, multiplying them can better preserve the potential information in the vectors and assist the classifier in assigning weights to the fused vectors. As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, directly concatenating method will lose some potential score information for further classification. The fused score feature &#x003C9; is calculated by the following equation:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>&#x003C9;</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>S</italic> denotes the label score extracted by two augmentation modules, <italic>f</italic>(&#x000B7;) is a de-averaging and normalizing function commonly used in machine learning. Finally, the label score &#x003C9; obtained after fusion will be delivered to the classifier of the spatial-temporal fusion module.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Comparison between directly concatenating method and matrix multiplication method for feature fusion. (1) Directly concatenating method. (2) Matrix multiplication method.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0002.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3. Experiments and results</title>
<p>In this section, we first introduce the four comparison methods in the following experiments. we then present the implementation details, parameter settings of our proposed STDAC scheme, and the valuation metrics for the classification task. And then we report the experimental results of the comparison methods in ADNI dataset. Finally, the effectiveness of our proposed scheme on different datasets is demonstrated convincingly.</p>
<sec>
<title>3.1. Comparison methods</title>
<p>As shown in the <xref ref-type="fig" rid="F3">Figure 3</xref>, we compare our proposed STDAC with three methods, including (1) <bold>Original</bold>, a scheme that does not use data augmentation, (2) <bold>SDA</bold>, a scheme only with spatial data augmentation module, (3) <bold>TDA</bold>, a scheme only with temporal data augmentation module, and (4) <bold>STDAC</bold>, our scheme. Besides, three popular classifiers are employed to test the effectiveness of our scheme, including support vector machine (SVM), random forest (RF), and artificial neural networks (ANN).</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Different schemes for comparison. (1) <bold>Original</bold>, a scheme that does not use data augmentation, (2) <bold>SDA</bold>, a scheme only with spatial data augmentation module, (3) <bold>TDA</bold>, a scheme only with temporal data augmentation module, and (4) <bold>STDAC</bold>, our proposed scheme.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0003.tif"/>
</fig>
</sec>
<sec>
<title>3.2. Implementation details and evaluation metrics</title>
<p>Our STDAC scheme is an offline mode, where the training phase is separated from the testing phase. The training phase shown in <xref ref-type="fig" rid="F1">Figure 1</xref> has been described in detail in Section 2.3. In our experiments, for the spatial augmentation module, we generate four times more training samples based on the spatial prior knowledge. And for the temporal augmentation module, we generate 100 times more training samples based on the time series. After the training phase, the parameters of the classifier in the test phase are inherited from the classifier in the training phase. We then use the learned classifier to classify the test data.</p>
<p>To obtain an unbiased evaluation, all experiments employ a 10-fold cross-validation method. Specifically, the dataset is randomly divided into ten equal-sized subsets, nine of which are selected for training and the remaining 1 is used for testing. We repeat the whole process 10 times and finally average these 10 results. To prevent learning samples generated from test data during model training, which may result in erroneous experimental results, we divide the data into test dataset and training dataset before the data augmentation stage and only did data augment for the training dataset, not for the test dataset. Besides, we use three indicators (i.e., <italic>Accuracy</italic>, <italic>Precision</italic>, and <italic>Recall</italic>) as performance evaluation metrics, which are commonly used in machine learning classifiers.</p>
</sec>
<sec>
<title>3.3. Classification results</title>
<p><xref ref-type="table" rid="T1">Table 1</xref> summarizes the results of three methods with different classifiers in the four-class classification task, and <xref ref-type="fig" rid="F4">Figure 4</xref> plots the corresponding ROC curves. From <xref ref-type="table" rid="T1">Table 1</xref> and <xref ref-type="fig" rid="F4">Figure 4</xref>, we have the following interesting observations.</p>
<list list-type="simple">
<list-item><p>(1) As shown in <xref ref-type="table" rid="T1">Table 1</xref>, our spatial-temporal augmentation scheme can achieve better results in most cases. It shows that our STDAC scheme based on data augmentation is effective in reducing over fitting or under fitting of classification model. Moreover, the improvement in classifier performance with spatial-temporal augmentation (STDAC) is often better than that with data augmentation using only one augmentation module (SDA and TDA), which verifies the necessity and effectiveness of our proposed spatial-temporal fusion module.</p></list-item>
<list-item><p>(2) Among all competing classification algorithms, the performance of temporal augmentation module is better than that of spatial augmentation module, which may be resulted by the number of generated samples. In our scheme, the spatial augmentation module generates 4-fold samples, while the temporal augmentation module can generate 100-fold samples. Besides, we discuss the effect of different augmentation degrees in Section 4.3.</p></list-item>
<list-item><p>(3) We draw ROC curves using our scheme and original method with different classifiers in <xref ref-type="fig" rid="F4">Figure 4</xref>. It can be observed that our scheme fits well with ANN in particular, which may be related to the fact that neural networks are better suited for processing large amounts of data.</p></list-item>
</list>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Classification results of three methods with different classifiers in the four-class classification task.</p></caption> 
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left" rowspan="2"><bold>Classifier</bold></th>
<th valign="top" align="left" rowspan="2"><bold>Augment method</bold></th>
<th valign="top" align="center" rowspan="2"><bold>Accuracy</bold></th>
<th valign="top" align="center" colspan="4"><bold>Precision</bold></th>
<th valign="top" align="center" colspan="4"><bold>Recall</bold></th>
</tr>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="center"><bold>NC</bold></th>
<th valign="top" align="center"><bold>EMCL</bold></th>
<th valign="top" align="center"><bold>LMCL</bold></th>
<th valign="top" align="center"><bold>AD</bold></th>
<th valign="top" align="center"><bold>NC</bold></th>
<th valign="top" align="center"><bold>EMCL</bold></th>
<th valign="top" align="center"><bold>LMCL</bold></th>
<th valign="top" align="center"><bold>AD</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="4">SVM</td>
<td valign="top" align="left">Original</td>
<td valign="top" align="center">63.772</td>
<td valign="top" align="center">61.042</td>
<td valign="top" align="center">75.147</td>
<td valign="top" align="center">59.333</td>
<td valign="top" align="center">55.667</td>
<td valign="top" align="center">70.363</td>
<td valign="top" align="center">57.987</td>
<td valign="top" align="center">60.432</td>
<td valign="top" align="center">81.651</td>
</tr>
<tr>
<td valign="top" align="left">SDA</td>
<td valign="top" align="center">73.387</td>
<td valign="top" align="center">70.083</td>
<td valign="top" align="center">81.213</td>
<td valign="top" align="center">69.381</td>
<td valign="top" align="center">70.778</td>
<td valign="top" align="center">70.790</td>
<td valign="top" align="center">69.984</td>
<td valign="top" align="center">74.587</td>
<td valign="top" align="center">85.532</td>
</tr>
<tr>
<td valign="top" align="left">TDA</td>
<td valign="top" align="center">78.706</td>
<td valign="top" align="center">74.625</td>
<td valign="top" align="center">84.265</td>
<td valign="top" align="center"><bold>76.429</bold></td>
<td valign="top" align="center"><bold>78.889</bold></td>
<td valign="top" align="center"><bold>78.217</bold></td>
<td valign="top" align="center"><bold>74.641</bold></td>
<td valign="top" align="center">79.518</td>
<td valign="top" align="center">90.944</td>
</tr>
<tr>
<td valign="top" align="left">STDA</td>
<td valign="top" align="center"><bold>79.054</bold></td>
<td valign="top" align="center"><bold>79.125</bold></td>
<td valign="top" align="center"><bold>84.853</bold></td>
<td valign="top" align="center">73.619</td>
<td valign="top" align="center">76.889</td>
<td valign="top" align="center">73.980</td>
<td valign="top" align="center">74.012</td>
<td valign="top" align="center"><bold>84.226</bold></td>
<td valign="top" align="center"><bold>94.167</bold></td>
</tr> <tr>
<td valign="top" align="left" rowspan="4">RF</td>
<td valign="top" align="left">Original</td>
<td valign="top" align="center">51.513</td>
<td valign="top" align="center">57.792</td>
<td valign="top" align="center">65.515</td>
<td valign="top" align="center">45.571</td>
<td valign="top" align="center">27.222</td>
<td valign="top" align="center">51.362</td>
<td valign="top" align="center">48.143</td>
<td valign="top" align="center">53.403</td>
<td valign="top" align="center">79.833</td>
</tr>
<tr>
<td valign="top" align="left">SDA</td>
<td valign="top" align="center">53.828</td>
<td valign="top" align="center">56.458</td>
<td valign="top" align="center">69.191</td>
<td valign="top" align="center">46.095</td>
<td valign="top" align="center">35.333</td>
<td valign="top" align="center">50.480</td>
<td valign="top" align="center">48.879</td>
<td valign="top" align="center"><bold>61.134</bold></td>
<td valign="top" align="center">81.000</td>
</tr>
<tr>
<td valign="top" align="left">TDA</td>
<td valign="top" align="center">60.576</td>
<td valign="top" align="center"><bold>65.042</bold></td>
<td valign="top" align="center"><bold>74.007</bold></td>
<td valign="top" align="center">52.952</td>
<td valign="top" align="center">42.556</td>
<td valign="top" align="center">60.195</td>
<td valign="top" align="center">57.968</td>
<td valign="top" align="center">59.396</td>
<td valign="top" align="center"><bold>84.369</bold></td>
</tr>
<tr>
<td valign="top" align="left">STDA</td>
<td valign="top" align="center"><bold>61.830</bold></td>
<td valign="top" align="center">59.833</td>
<td valign="top" align="center">69.118</td>
<td valign="top" align="center"><bold>58.476</bold></td>
<td valign="top" align="center"><bold>57.667</bold></td>
<td valign="top" align="center"><bold>66.814</bold></td>
<td valign="top" align="center"><bold>62.485</bold></td>
<td valign="top" align="center">57.421</td>
<td valign="top" align="center">63.566</td>
</tr> <tr>
<td valign="top" align="left" rowspan="4">NNs</td>
<td valign="top" align="left">Original</td>
<td valign="top" align="center">65.909</td>
<td valign="top" align="center">64.917</td>
<td valign="top" align="center">62.426</td>
<td valign="top" align="center">59.238</td>
<td valign="top" align="center">83.000</td>
<td valign="top" align="center">71.501</td>
<td valign="top" align="center">66.164</td>
<td valign="top" align="center">66.017</td>
<td valign="top" align="center">62.749</td>
</tr>
<tr>
<td valign="top" align="left">SDA</td>
<td valign="top" align="center">70.338</td>
<td valign="top" align="center">68.792</td>
<td valign="top" align="center">64.669</td>
<td valign="top" align="center">75.095</td>
<td valign="top" align="center">74.556</td>
<td valign="top" align="center">75.040</td>
<td valign="top" align="center">73.741</td>
<td valign="top" align="center">65.351</td>
<td valign="top" align="center">75.399</td>
</tr>
<tr>
<td valign="top" align="left">TDA</td>
<td valign="top" align="center">82.218</td>
<td valign="top" align="center">80.458</td>
<td valign="top" align="center"><bold>84.596</bold></td>
<td valign="top" align="center">78.762</td>
<td valign="top" align="center"><bold>86.000</bold></td>
<td valign="top" align="center"><bold>82.849</bold></td>
<td valign="top" align="center">81.066</td>
<td valign="top" align="center"><bold>84.097</bold></td>
<td valign="top" align="center">87.965</td>
</tr>
<tr>
<td valign="top" align="left">STDA</td>
<td valign="top" align="center"><bold>84.170</bold></td>
<td valign="top" align="center"><bold>85.450</bold></td>
<td valign="top" align="center">83.770</td>
<td valign="top" align="center"><bold>86.367</bold></td>
<td valign="top" align="center">83.934</td>
<td valign="top" align="center">81.083</td>
<td valign="top" align="center"><bold>86.544</bold></td>
<td valign="top" align="center">80.714</td>
<td valign="top" align="center"><bold>90.000</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The bold values highlight the best performances in experiments.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>The ROC curves achieved by original method and STDAC scheme in the task of NC vs. eMCI classification.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0004.tif"/>
</fig>
</sec>
<sec>
<title>3.4. Experiments in other datasets</title>
<p>To further verify the performance of our SDTA scheme, we employ a MDD dataset for the eMCI vs. NC classification task. The experimental results are reported in <xref ref-type="table" rid="T2">Table 2</xref>. It can be observed that our scheme achieves the best performance in the ablation experiments, which indicates the good robustness of our proposed model. It has been confirmed that data augmentation using spatial-temporal information can help boost classification performance for brain diseases. Besides, the effect of our model is weaker in the MDD dataset than that in the ADNI dataset. The one possible reason is the structural changes in the brain are stronger in neurological diseases (e.g., AD) than in psychiatric diseases (e.g., MDD) (Yan et al., <xref ref-type="bibr" rid="B26">2019</xref>). Another reason is that the REST-meta-MDD dataset comes from 24 different sites, where different scanning devices and environments at different sites can lead to accuracy degradation of the classification model.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Classification performance in the task of MDD vs. NC classification.</p></caption> 
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th/>
<th valign="top" align="left" rowspan="2"><bold>Accuracy</bold></th>
<th valign="top" align="left" rowspan="2"><bold><italic>F</italic><sub>1</sub>-score</bold></th>
<th valign="top" align="left" colspan="2"><bold>Precision</bold></th>
<th valign="top" align="left" colspan="2"><bold>Recall</bold></th>
</tr>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th/>
<th valign="top" align="left"><bold>NC</bold></th>
<th valign="top" align="left"><bold>MDD</bold></th>
<th valign="top" align="left"><bold>NC</bold></th>
<th valign="top" align="left"><bold>MDD</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Original</td>
<td valign="top" align="left">60.060</td>
<td valign="top" align="left">57.913</td>
<td valign="top" align="left">60.829</td>
<td valign="top" align="left">59.191</td>
<td valign="top" align="left">62.908</td>
<td valign="top" align="left">57.087</td>
</tr> <tr>
<td valign="top" align="left">SDA</td>
<td valign="top" align="left">62.219</td>
<td valign="top" align="left">59.145</td>
<td valign="top" align="left">63.219</td>
<td valign="top" align="left">61.091</td>
<td valign="top" align="left">64.839</td>
<td valign="top" align="left">59.541</td>
</tr> <tr>
<td valign="top" align="left">TDA</td>
<td valign="top" align="left">62.305</td>
<td valign="top" align="left">60.437</td>
<td valign="top" align="left">63.455</td>
<td valign="top" align="left">60.996</td>
<td valign="top" align="left">64.971</td>
<td valign="top" align="left">59.451</td>
</tr> <tr>
<td valign="top" align="left">STDAC</td>
<td valign="top" align="left"><bold>63.406</bold></td>
<td valign="top" align="left"><bold>61.325</bold></td>
<td valign="top" align="left"><bold>64.168</bold></td>
<td valign="top" align="left"><bold>62.527</bold></td>
<td valign="top" align="left"><bold>66.134</bold></td>
<td valign="top" align="left"><bold>60.569</bold></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The bold values highlight the best performances in experiments.</p>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
<sec sec-type="discussion" id="s4">
<title>4. Discussion</title>
<p>In this section, we discuss the performance comparison between our scheme and previous related methods, the weights of the ROI obtained by our modality, the comparison of our scheme in different augmentation degrees, as well as the drawbacks and future of our work.</p>
<sec>
<title>4.1. Experiments of comparison with related methods</title>
<p>We compare our model with the latest data augmentation methods in the field of FBN analysis, including the random window-based data augmentation (Zhu et al., <xref ref-type="bibr" rid="B35">2021</xref>), improved SMOTE (Eslami and Saeed, <xref ref-type="bibr" rid="B6">2019</xref>), auto-encoder-based generative model (Ohno, <xref ref-type="bibr" rid="B15">2020</xref>), conditional generative adversarial network (Raja and Kannimuthu, <xref ref-type="bibr" rid="B18">2023</xref>), and GANSO (Salazar et al., <xref ref-type="bibr" rid="B20">2021</xref>), with experimental results reported in <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Classification performance of the related methods for comparison.</p></caption> 
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left" rowspan="2"><bold></bold></th>
<th valign="top" align="left" rowspan="2"><bold>Accuracy</bold></th>
<th valign="top" align="center" colspan="4"><bold>Precision</bold></th>
<th valign="top" align="center" colspan="4"><bold>Recall</bold></th>
</tr>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="center"><bold>NC</bold></th>
<th valign="top" align="center"><bold>eMCI</bold></th>
<th valign="top" align="center"><bold>lMCI</bold></th>
<th valign="top" align="center"><bold>AD</bold></th>
<th valign="top" align="center"><bold>NC</bold></th>
<th valign="top" align="center"><bold>eMCI</bold></th>
<th valign="top" align="center"><bold>lMCI</bold></th>
<th valign="top" align="center"><bold>AD</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">The random window-based data augmentation</td>
<td valign="top" align="left">76.046</td>
<td valign="top" align="center">70.708</td>
<td valign="top" align="center">81.801</td>
<td valign="top" align="center">74.952</td>
<td valign="top" align="center">75.667</td>
<td valign="top" align="center">72.661</td>
<td valign="top" align="center">72.894</td>
<td valign="top" align="center">77.829</td>
<td valign="top" align="center">87.433</td>
</tr> <tr>
<td valign="top" align="left">Improved SMOTE</td>
<td valign="top" align="left">73.189</td>
<td valign="top" align="center">74.625</td>
<td valign="top" align="center"><bold>84.890</bold></td>
<td valign="top" align="center">69.619</td>
<td valign="top" align="center">56.556</td>
<td valign="top" align="center">69.305</td>
<td valign="top" align="center">68.965</td>
<td valign="top" align="center">76.500</td>
<td valign="top" align="center"><bold>95.655</bold></td>
</tr> <tr>
<td valign="top" align="left">Auto-encoder-based generative model</td>
<td valign="top" align="left">65.360</td>
<td valign="top" align="center">61.625</td>
<td valign="top" align="center">78.199</td>
<td valign="top" align="center">60.714</td>
<td valign="top" align="center">56.444</td>
<td valign="top" align="center">69.437</td>
<td valign="top" align="center">60.680</td>
<td valign="top" align="center">62.377</td>
<td valign="top" align="center">81.357</td>
</tr> <tr>
<td valign="top" align="left">Conditional generative adversarial network</td>
<td valign="top" align="left">73.061</td>
<td valign="top" align="center">77.780</td>
<td valign="top" align="center">74.281</td>
<td valign="top" align="center">71.281</td>
<td valign="top" align="center">73.701</td>
<td valign="top" align="center">69.750</td>
<td valign="top" align="center">65.772</td>
<td valign="top" align="center"><bold>81.238</bold></td>
<td valign="top" align="center">77.667</td>
</tr> <tr>
<td valign="top" align="left">GANSO</td>
<td valign="top" align="left">79.189</td>
<td valign="top" align="center">74.107</td>
<td valign="top" align="center">72.398</td>
<td valign="top" align="center"><bold>87.547</bold></td>
<td valign="top" align="center"><bold>95.714</bold></td>
<td valign="top" align="center">79.042</td>
<td valign="top" align="center">85.993</td>
<td valign="top" align="center">73.857</td>
<td valign="top" align="center">75.778</td>
</tr> <tr>
<td valign="top" align="left">STDAC (our method)</td>
<td valign="top" align="left"><bold>84.170</bold></td>
<td valign="top" align="center"><bold>85.450</bold></td>
<td valign="top" align="center">83.770</td>
<td valign="top" align="center">86.367</td>
<td valign="top" align="center">83.934</td>
<td valign="top" align="center"><bold>81.083</bold></td>
<td valign="top" align="center"><bold>86.544</bold></td>
<td valign="top" align="center">80.714</td>
<td valign="top" align="center">90.000</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>The bold values highlight the best performances in experiments.</p>
</table-wrap-foot>
</table-wrap>
<p>Compared with previous data augmentation methods, our STDAC scheme achieves the best performance on the classification task in the ADNI dataset. Different from the random window-based data augmentation, which uses time windows to generate more samples by obtaining random consecutive time series, our scheme of randomly selecting time periods without caring about continuity would be helpful to obtain an average value when computing the Pearson matrix (Barber et al., <xref ref-type="bibr" rid="B3">2021</xref>). Besides, improved SMOTE, auto-encoder-based generative models, conditional generative adversarial network, and GANSO ignore spatial information and temporal information, which limits their classification performance. In addition, our scheme can fit neural networks better and can generate more data samples than previous methods. Therefore, it can reduce over- or under-fitting caused by insufficient data samples in the neural network.</p>
</sec>
<sec>
<title>4.2. Discriminative brain regions and connections</title>
<p>It is an essential step to select the discriminative biomarkers in FBN analysis. As shown in <xref ref-type="fig" rid="F5">Figures 5</xref>, <xref ref-type="fig" rid="F6">6</xref>, we show the most discriminative connections and ROIs based on the weights in two classifiers (i.e., spatial classifier and temporal classifier). Since the weights within each subject can be different, we integrate them and select the most discriminative features based on the weights. We demonstrate the top 20 discriminant connections in <xref ref-type="fig" rid="F5">Figure 5</xref>, where the color of each arc is randomly assigned for better visualization.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Most discriminative ROIs identified by two classifiers in the task of NC vs. eMCI. (1) Discriminative ROIs based on spatial classifier. (2) Discriminative ROIs based on temporal classifier. The symbol volume of the nodes represents the discriminative power of each brain region.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0005.tif"/>
</fig>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Top 20 discriminant functional connections identified by two classifiers in the task of NC vs. eMCI. (1) Discriminative connections based on spatial classifier. (2) Discriminative connections based on temporal classifier.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0006.tif"/>
</fig>
<p><xref ref-type="fig" rid="F6">Figure 6</xref> is a visualization based on the AAL template, where the symbol volume of the nodes represents the discriminative power of each brain region. We normalize the weights of functional connections obtained using the model, then add the weights of functional connections to the brain regions to obtain the weights discriminating brain regions (Zhang et al., <xref ref-type="bibr" rid="B32">2021</xref>). We can observe that the discriminative ROIs of the brain regions after spatial information augmentation are more concentrated in the right temporal lobe, which corresponds to the fact that the right brain regions of the mentioned Alzheimer&#x00027;s patients are more likely to accelerate aging (Roe et al., <xref ref-type="bibr" rid="B19">2021</xref>). The weights of each brain region after temporal information augmentation are relatively more concentrated in the frontal lobes, similar to previous findings (Agosta et al., <xref ref-type="bibr" rid="B2">2012</xref>).</p>
</sec>
<sec>
<title>4.3. Effect of different data augmentation degrees</title>
<p>In the proposed STDAC scheme, two data augmentation modules are employed to generate the samples for classification. However, different degrees of data augmentation will lead to different numbers of samples, which may affect the final performance. Therefore, we validate the accuracy of the two data augmentation modules for the classification task of eMCI vs. NC with different degrees.</p>
<p>The experimental results are reported in <xref ref-type="fig" rid="F7">Figure 7</xref>, in which the darkest red on the figures marks the degrees under the best accuracy conditions. It can be observed that the best accuracy is achieved when the spatial degree is 4 and the temporal degree is 100. In addition, whether the degree of data augmentation is too high or too low affects the final result. For example, when the data augmentation degree is higher than 100, the data augmentation effect will also be weakened. The probable reason is that the excessive degree of data augmentation may lead to many duplicate samples. Therefore, we need to select the optimal parameters according to different classification tasks.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Classification accuracy achieved by the STDAC method using different degrees of spatial and temporal augmentation in the task of NC vs. eMCI.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-17-1194190-g0007.tif"/>
</fig>
</sec>
<sec>
<title>4.4. Limitations and future work</title>
<p>The proposed STDAC scheme takes both temporal and spatial information of rs-fMRI data into account, and mitigates the occurrence of over- or under-fitting by data augmentation. However, there are several limitations in our present study. <italic>First</italic>, individual differences between different subjects are not fully considered in our scheme, which is an important issue for FBN analysis (Folville et al., <xref ref-type="bibr" rid="B8">2020</xref>; Schabdach et al., <xref ref-type="bibr" rid="B21">2022</xref>) and an important direction for our future improvements. <italic>Besides</italic>, since multi-modal data is taking an increasingly important place in brain analysis (Jia and Lao, <xref ref-type="bibr" rid="B12">2022</xref>; Zhao et al., <xref ref-type="bibr" rid="B34">2022</xref>), the performance of employing one-modal data is limited. Compared with the widely used multi-modal data model (Yu et al., <xref ref-type="bibr" rid="B31">2021</xref>), how to adapt the scheme to the multi-modal data type is a key point in our future work.</p>
</sec>
</sec>
<sec sec-type="conclusions" id="s5">
<title>5. Conclusion</title>
<p>In this study, we perform a spatial-temporal data-augmentation-based classification (STDAC) scheme based on data augmentation through spatial-temporal information for brain disease diagnosis. Specifically, there are three modules in our proposed scheme, including (1) spatial augmentation module based on spatial prior knowledge of brain regions, (2) temporal augmentation module based on random re-sampling of a time series, and (3) spatial-temporal fusion module based on a tensor fusion method to fuse the different information extracted by the previous two modules. Such a technique enables us to alleviate the problem of small sample size while fusing the spatial-temporal information. We evaluate our scheme with the public ADNI and MDD datasets and experimentally demonstrate that the proposed scheme performs well for classification. In addition, we employ different classifiers to verify the robustness of our method. Experiments show that this scheme can be applied to any classifier in different tasks.</p>
</sec>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found at: <ext-link ext-link-type="uri" xlink:href="https://adni.loni.usc.edu/study-design">https://adni.loni.usc.edu/study-design</ext-link>; <ext-link ext-link-type="uri" xlink:href="https://rfmri.org/REST-meta-MDD">https://rfmri.org/REST-meta-MDD</ext-link>.</p>
</sec>
<sec sec-type="ethics-statement" id="s7">
<title>Ethics statement</title>
<p>Ethical review and approval was not required for the study on human participants in accordance with the local legislation and institutional requirements. The patients/participants provided their written informed consent to participate in this study.</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>QL, YZ, and ZW designed the study. QL and YZ downloaded the data, performed the experiments, and drafted the manuscript. LG preprocessed the data and performed some experiments. All authors read and approved the final manuscript.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>This work was partly supported by Key Research and Development Program of Hainan province (No. ZDYF2021GXJS017), National Natural Science Foundation of China (No. 82160345), Key science and technology plan project of Haikou (2021-016), the Major science and technology plan of Hainan (ZDKJ2021016). Data collection and sharing for this project was funded by the Alzheimer&#x00027;s Disease Neuroimaging Initiative (ADNI) (National Institutes of Health Grant U01 AG024904) and DOD ADNI (Department of Defense award number W81XWH-12-2-0012).</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abraham</surname> <given-names>A.</given-names></name> <name><surname>Pedregosa</surname> <given-names>F.</given-names></name> <name><surname>Eickenberg</surname> <given-names>M.</given-names></name> <name><surname>Gervais</surname> <given-names>P.</given-names></name> <name><surname>Mueller</surname> <given-names>A.</given-names></name> <name><surname>Kossaifi</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>Machine learning for neuroimaging with scikit-learn</article-title>. <source>Front. Neuroinform</source>. <volume>8</volume>:<fpage>14</fpage>. <pub-id pub-id-type="doi">10.3389/fninf.2014.00014</pub-id><pub-id pub-id-type="pmid">24600388</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Agosta</surname> <given-names>F.</given-names></name> <name><surname>Pievani</surname> <given-names>M.</given-names></name> <name><surname>Geroldi</surname> <given-names>C.</given-names></name> <name><surname>Copetti</surname> <given-names>M.</given-names></name> <name><surname>Frisoni</surname> <given-names>G. B.</given-names></name> <name><surname>Filippi</surname> <given-names>M.</given-names></name></person-group> (<year>2012</year>). <article-title>Resting state fMRI in Alzheimer&#x00027;s disease: beyond the default mode network</article-title>. <source>Neurobiol. Aging</source> <volume>33</volume>, <fpage>1564</fpage>&#x02013;<lpage>1578</lpage>. <pub-id pub-id-type="doi">10.1016/j.neurobiolaging.2011.06.007</pub-id><pub-id pub-id-type="pmid">21813210</pub-id></citation></ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Barber</surname> <given-names>R. F.</given-names></name> <name><surname>Candes</surname> <given-names>E. J.</given-names></name> <name><surname>Ramdas</surname> <given-names>A.</given-names></name> <name><surname>Tibshirani</surname> <given-names>R. J.</given-names></name></person-group> (<year>2021</year>). <article-title>Predictive inference with the jackknife&#x0002B;</article-title>. <source>Ann. Stat</source>. <volume>49</volume>, <fpage>486</fpage>&#x02013;<lpage>507</lpage>. <pub-id pub-id-type="doi">10.1214/20-AOS1965</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>X.</given-names></name> <name><surname>Lu</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Castellanos</surname> <given-names>F. X.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>The direct consortium and the rest-meta-mdd project: towards neuroimaging biomarkers of major depressive disorder</article-title>. <source>Psychoradiology</source> <volume>2</volume>, <fpage>32</fpage>&#x02013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1093/psyrad/kkac005</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Dvornek</surname> <given-names>N. C.</given-names></name> <name><surname>Ventola</surname> <given-names>P.</given-names></name> <name><surname>Pelphrey</surname> <given-names>K. A.</given-names></name> <name><surname>Duncan</surname> <given-names>J. S.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Identifying autism from resting-state fMRI using long short-term memory networks,&#x0201D;</article-title> in <source>International Workshop on Machine Learning in Medical Imaging</source> (<publisher-loc>Quebec City, QC</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>362</fpage>&#x02013;<lpage>370</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-67389-9_42</pub-id><pub-id pub-id-type="pmid">29104967</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Eslami</surname> <given-names>T.</given-names></name> <name><surname>Saeed</surname> <given-names>F.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Auto-ASD-network: a technique based on deep learning and support vector machines for diagnosing autism spectrum disorder using fMRI data,&#x0201D;</article-title> in <source>Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics</source> (<publisher-loc>Niagara Falls, NY</publisher-loc>), <fpage>646</fpage>&#x02013;<lpage>651</lpage>. <pub-id pub-id-type="doi">10.1145/3307339.3343482</pub-id><pub-id pub-id-type="pmid">32508974</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fang</surname> <given-names>T.</given-names></name> <name><surname>Song</surname> <given-names>Z.</given-names></name> <name><surname>Zhan</surname> <given-names>G.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Mu</surname> <given-names>W.</given-names></name> <name><surname>Wang</surname> <given-names>P.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Decoding motor imagery tasks using ESI and hybrid feature CNN</article-title>. <source>J. Neural Eng</source>. <volume>19</volume>:<fpage>016022</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/ac4ed0</pub-id><pub-id pub-id-type="pmid">35078158</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Folville</surname> <given-names>A.</given-names></name> <name><surname>Bahri</surname> <given-names>M. A.</given-names></name> <name><surname>Delhaye</surname> <given-names>E.</given-names></name> <name><surname>Salmon</surname> <given-names>E.</given-names></name> <name><surname>D&#x00027;Argembeau</surname> <given-names>A.</given-names></name> <name><surname>Bastin</surname> <given-names>C.</given-names></name></person-group> (<year>2020</year>). <article-title>Age-related differences in the neural correlates of vivid remembering</article-title>. <source>NeuroImage</source> <volume>206</volume>:<fpage>116336</fpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2019.116336</pub-id><pub-id pub-id-type="pmid">31704294</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friston</surname> <given-names>K.</given-names></name> <name><surname>Josephs</surname> <given-names>O.</given-names></name> <name><surname>Zarahn</surname> <given-names>E.</given-names></name> <name><surname>Holmes</surname> <given-names>A.</given-names></name> <name><surname>Rouquette</surname> <given-names>S.</given-names></name> <name><surname>Poline</surname> <given-names>J.-B.</given-names></name></person-group> (<year>2000</year>). <article-title>To smooth or not to smooth?: bias and efficiency in fMRI time-series analysis</article-title>. <source>NeuroImage</source> <volume>12</volume>, <fpage>196</fpage>&#x02013;<lpage>208</lpage>. <pub-id pub-id-type="doi">10.1006/nimg.2000.0609</pub-id><pub-id pub-id-type="pmid">10913325</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jack</surname> <given-names>C. R. Jr, Bernstein, M. A.</given-names></name> <name><surname>Fox</surname> <given-names>N. C.</given-names></name> <name><surname>Thompson</surname> <given-names>P.</given-names></name> <name><surname>Alexander</surname> <given-names>G.</given-names></name> <name><surname>Harvey</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2008</year>). <article-title>The Alzheimer&#x00027;s disease neuroimaging initiative (ADNI): MRI methods</article-title>. <source>J. Magn. Reson. Imaging</source> <volume>27</volume>, <fpage>685</fpage>&#x02013;<lpage>691</lpage>. <pub-id pub-id-type="doi">10.1002/jmri.21049</pub-id><pub-id pub-id-type="pmid">18302232</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ji</surname> <given-names>J. L.</given-names></name> <name><surname>Spronk</surname> <given-names>M.</given-names></name> <name><surname>Kulkarni</surname> <given-names>K.</given-names></name> <name><surname>Repov&#x00161;</surname> <given-names>G.</given-names></name> <name><surname>Anticevic</surname> <given-names>A.</given-names></name> <name><surname>Cole</surname> <given-names>M. W.</given-names></name></person-group> (<year>2019</year>). <article-title>Mapping the human brain&#x00027;s cortical-subcortical functional network organization</article-title>. <source>NeuroImage</source> <volume>185</volume>, <fpage>35</fpage>&#x02013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2018.10.006</pub-id><pub-id pub-id-type="pmid">30291974</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jia</surname> <given-names>H.</given-names></name> <name><surname>Lao</surname> <given-names>H.</given-names></name></person-group> (<year>2022</year>). <article-title>Deep learning and multimodal feature fusion for the aided diagnosis of Alzheimer&#x00027;s disease</article-title>. <source>Neuro Comput. Appl</source>. <volume>34</volume>, <fpage>19585</fpage>&#x02013;<lpage>19598</lpage>. <pub-id pub-id-type="doi">10.1007/s00521-022-07501-0</pub-id><pub-id pub-id-type="pmid">25423647</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mao</surname> <given-names>Z.</given-names></name> <name><surname>Su</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>G.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Huang</surname> <given-names>Y.</given-names></name> <name><surname>Yue</surname> <given-names>W.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Spatio-Temporal deep learning method for ADHD fMRI classification</article-title>. <source>Inform. Sci</source>. <volume>499</volume>, <fpage>1</fpage>&#x02013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2019.05.043</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marek</surname> <given-names>S.</given-names></name> <name><surname>Tervo-Clemmens</surname> <given-names>B.</given-names></name> <name><surname>Calabro</surname> <given-names>F. J.</given-names></name> <name><surname>Montez</surname> <given-names>D. F.</given-names></name> <name><surname>Kay</surname> <given-names>B. P.</given-names></name> <name><surname>Hatoum</surname> <given-names>A. S.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Reproducible brain-wide association studies require thousands of individuals</article-title>. <source>Nature</source> <volume>603</volume>, <fpage>654</fpage>&#x02013;<lpage>660</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-022-04492-9</pub-id><pub-id pub-id-type="pmid">35534626</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ohno</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>Auto-encoder-based generative models for data augmentation on regression problems</article-title>. <source>Soft Comput</source>. <volume>24</volume>, <fpage>7999</fpage>&#x02013;<lpage>8009</lpage>. <pub-id pub-id-type="doi">10.1007/s00500-019-04094-0</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Power</surname> <given-names>J. D.</given-names></name> <name><surname>Cohen</surname> <given-names>A. L.</given-names></name> <name><surname>Nelson</surname> <given-names>S. M.</given-names></name> <name><surname>Wig</surname> <given-names>G. S.</given-names></name> <name><surname>Barnes</surname> <given-names>K. A.</given-names></name> <name><surname>Church</surname> <given-names>J. A.</given-names></name> <etal/></person-group>. (<year>2011</year>). <article-title>Functional network organization of the human brain</article-title>. <source>Neuron</source> <volume>72</volume>, <fpage>665</fpage>&#x02013;<lpage>678</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2011.09.006</pub-id><pub-id pub-id-type="pmid">22099467</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qiang</surname> <given-names>N.</given-names></name> <name><surname>Dong</surname> <given-names>Q.</given-names></name> <name><surname>Liang</surname> <given-names>H.</given-names></name> <name><surname>Ge</surname> <given-names>B.</given-names></name> <name><surname>Zhang</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Modeling and augmenting of fMRI data using deep recurrent variational auto-encoder</article-title>. <source>J. Neural Eng</source>. <volume>18</volume>:<fpage>0460b</fpage>6. <pub-id pub-id-type="doi">10.1088/1741-2552/ac1179</pub-id><pub-id pub-id-type="pmid">34229310</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Raja</surname> <given-names>K. C.</given-names></name> <name><surname>Kannimuthu</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Conditional generative adversarial network approach for autism prediction</article-title>. <source>Comput. Syst. Sci. Eng</source>. <volume>44</volume>, <fpage>741</fpage>&#x02013;<lpage>755</lpage>. <pub-id pub-id-type="doi">10.32604/csse.2023.025331</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Roe</surname> <given-names>J. M.</given-names></name> <name><surname>Vidal-Pi&#x000F1;eiro</surname> <given-names>D.</given-names></name> <name><surname>S&#x000F8;rensen</surname> <given-names>O.</given-names></name> <name><surname>Brandmaier</surname> <given-names>A. M.</given-names></name> <name><surname>D&#x000FC;zel</surname> <given-names>S.</given-names></name> <name><surname>Gonzalez</surname> <given-names>H. A.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Asymmetric thinning of the cerebral cortex across the adult lifespan is accelerated in Alzheimer&#x00027;s disease</article-title>. <source>Nat. Commun</source>. <volume>12</volume>, <fpage>1</fpage>&#x02013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1038/s41467-021-21057-y</pub-id><pub-id pub-id-type="pmid">35132105</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Salazar</surname> <given-names>A.</given-names></name> <name><surname>Vergara</surname> <given-names>L.</given-names></name> <name><surname>Safont</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>Generative adversarial networks and Markov random fields for oversampling very small training sets</article-title>. <source>Expert Syst. Appl</source>. <volume>163</volume>:<fpage>113819</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2020.113819</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schabdach</surname> <given-names>J.</given-names></name> <name><surname>Ceschin</surname> <given-names>R.</given-names></name> <name><surname>Schmithorst</surname> <given-names>V.</given-names></name> <name><surname>Tisdall</surname> <given-names>M. D.</given-names></name> <name><surname>Alexander-Bloch</surname> <given-names>A.</given-names></name> <name><surname>Panigrahy</surname> <given-names>A.</given-names></name></person-group> (<year>2022</year>). <article-title>A descriptive review of the impact of patient motion in early childhood resting-state functional magnetic resonance imaging</article-title>. <source>Diagnostics</source> <volume>12</volume>:<fpage>1032</fpage>. <pub-id pub-id-type="doi">10.3390/diagnostics12051032</pub-id><pub-id pub-id-type="pmid">35626188</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sheline</surname> <given-names>Y. I.</given-names></name> <name><surname>Raichle</surname> <given-names>M. E.</given-names></name></person-group> (<year>2013</year>). <article-title>Resting state functional connectivity in preclinical Alzheimer&#x00027;s disease</article-title>. <source>Biol. Psychiatry</source> <volume>74</volume>, <fpage>340</fpage>&#x02013;<lpage>347</lpage>. <pub-id pub-id-type="doi">10.1016/j.biopsych.2012.11.028</pub-id><pub-id pub-id-type="pmid">32942175</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Smith</surname> <given-names>K.</given-names></name></person-group> (<year>2012</year>). <article-title>fMRI 2.0: functional magnetic resonance imaging is growing from showy adolescence into a workhorse of brain imaging</article-title>. <source>Nature</source> <volume>484</volume>, <fpage>24</fpage>&#x02013;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.1038/484024a</pub-id><pub-id pub-id-type="pmid">22481337</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tanveer</surname> <given-names>M.</given-names></name> <name><surname>Richhariya</surname> <given-names>B.</given-names></name> <name><surname>Khan</surname> <given-names>R. U.</given-names></name> <name><surname>Rashid</surname> <given-names>A. H.</given-names></name> <name><surname>Khanna</surname> <given-names>P.</given-names></name> <name><surname>Prasad</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Machine learning techniques for the diagnosis of Alzheimer&#x00027;s disease: a review</article-title>. <source>ACM Trans. Multimedia Comput. Commun. Appl</source>. <volume>16</volume>, <fpage>1</fpage>&#x02013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.1145/3344998</pub-id><pub-id pub-id-type="pmid">30762522</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taschereau-Dumouchel</surname> <given-names>V.</given-names></name> <name><surname>Cushing</surname> <given-names>C.</given-names></name> <name><surname>Lau</surname> <given-names>H.</given-names></name></person-group> (<year>2022</year>). <article-title>Real-time fMRI in the treatment of mental health disorders</article-title>. <source>Annu. Rev. Clin. Psychol</source>. <volume>18</volume>, <fpage>125</fpage>&#x02013;<lpage>154</lpage>. <pub-id pub-id-type="doi">10.1146/annurev-clinpsy-072220-014550</pub-id><pub-id pub-id-type="pmid">35061522</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>C.</given-names></name> <name><surname>Chen</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>L.</given-names></name> <name><surname>Castellanos</surname> <given-names>F. X.</given-names></name> <name><surname>Bai</surname> <given-names>T.</given-names></name> <name><surname>Bo</surname> <given-names>Q.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Reduced default mode network functional connectivity in patients with recurrent major depressive disorder</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A</source>. <volume>116</volume>, <fpage>9078</fpage>&#x02013;<lpage>9083</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1900390116</pub-id><pub-id pub-id-type="pmid">35668086</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>C.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Zuo</surname> <given-names>X.</given-names></name> <name><surname>Zang</surname> <given-names>Y.</given-names></name></person-group> (<year>2016</year>). <article-title>DPABI: data processing &#x00026; analysis for (resting-state) brain imaging</article-title>. <source>Neuroinformatics</source> <volume>14</volume>, <fpage>339</fpage>&#x02013;<lpage>351</lpage>. <pub-id pub-id-type="doi">10.1007/s12021-016-9299-4</pub-id><pub-id pub-id-type="pmid">27075850</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>J.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Xiao</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>S.</given-names></name> <name><surname>Jiang</surname> <given-names>M.</given-names></name> <name><surname>Wang</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2022</year>). <article-title>Modeling spatio-temporal patterns of holistic functional brain networks via multi-head guided attention graph neural networks (multi-head GAGNNs)</article-title>. <source>Med. Image Anal</source>. <volume>80</volume>:<fpage>102518</fpage>. <pub-id pub-id-type="doi">10.1016/j.media.2022.102518</pub-id><pub-id pub-id-type="pmid">35749981</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>Z.</given-names></name> <name><surname>Zhuang</surname> <given-names>X.</given-names></name> <name><surname>Sreenivasan</surname> <given-names>K.</given-names></name> <name><surname>Mishra</surname> <given-names>V.</given-names></name> <name><surname>Cordes</surname> <given-names>D.</given-names></name> <name><surname>Initiative</surname> <given-names>A. D. N.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Disentangling time series between brain tissues improves fMRI data quality using a time-dependent deep neural network</article-title>. <source>NeuroImage</source> <volume>223</volume>:<fpage>117340</fpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2020.117340</pub-id><pub-id pub-id-type="pmid">32898682</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Yao</surname> <given-names>Q.</given-names></name> <name><surname>Lu</surname> <given-names>H.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Brain functional connectivity augmentation method for mental disease classification with generative adversarial network,&#x0201D;</article-title> in <source>Chinese Conference on Pattern Recognition and Computer Vision (PRCV)</source> (<publisher-loc>Xi&#x00027;an</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>444</fpage>&#x02013;<lpage>455</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-31654-9_38</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>H.</given-names></name> <name><surname>Yang</surname> <given-names>L. T.</given-names></name> <name><surname>Fan</surname> <given-names>X.</given-names></name> <name><surname>Zhang</surname> <given-names>Q.</given-names></name></person-group> (<year>2021</year>). <article-title>A deep residual computation model for heterogeneous data learning in smart internet of things</article-title>. <source>Appl. Soft Comput</source>. <volume>107</volume>:<fpage>107361</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2021.107361</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>J.</given-names></name> <name><surname>Kucyi</surname> <given-names>A.</given-names></name> <name><surname>Raya</surname> <given-names>J.</given-names></name> <name><surname>Nielsen</surname> <given-names>A. N.</given-names></name> <name><surname>Nomi</surname> <given-names>J. S.</given-names></name> <name><surname>Damoiseaux</surname> <given-names>J. S.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>What have we really learned from functional connectivity in clinical populations?</article-title> <source>NeuroImage</source> <volume>242</volume>:<fpage>118466</fpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2021.118466</pub-id><pub-id pub-id-type="pmid">34389443</pub-id></citation></ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Yang</surname> <given-names>F.</given-names></name> <name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Yu</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>Q.</given-names></name></person-group> (<year>2023</year>). <article-title>Adaptive differential privacy mechanism based on entropy theory for preserving deep neural networks</article-title>. <source>Mathematics</source> <volume>11</volume>:<fpage>330</fpage>. <pub-id pub-id-type="doi">10.3390/math11020330</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>L.</given-names></name> <name><surname>Ma</surname> <given-names>J.</given-names></name> <name><surname>Shao</surname> <given-names>Y.</given-names></name> <name><surname>Jia</surname> <given-names>C.</given-names></name> <name><surname>Zhao</surname> <given-names>J.</given-names></name> <name><surname>Yuan</surname> <given-names>H.</given-names></name></person-group> (<year>2022</year>). <article-title>MM-UNet: a multimodality brain tumor segmentation network in MRI images</article-title>. <source>Front. Oncol</source>. <volume>12</volume>:<fpage>950706</fpage>. <pub-id pub-id-type="doi">10.3389/fonc.2022.950706</pub-id><pub-id pub-id-type="pmid">36059677</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhu</surname> <given-names>Y.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Qiao</surname> <given-names>Y.</given-names></name> <name><surname>Shang</surname> <given-names>R.</given-names></name> <name><surname>Shi</surname> <given-names>G.</given-names></name> <name><surname>Shang</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Widespread plasticity of cognition-related brain networks in single-sided deafness revealed by randomized window-based dynamic functional connectivity</article-title>. <source>Med. Image Anal</source>. <volume>73</volume>:<fpage>102163</fpage>. <pub-id pub-id-type="doi">10.1016/j.media.2021.102163</pub-id><pub-id pub-id-type="pmid">34303170</pub-id></citation></ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zou</surname> <given-names>A.</given-names></name> <name><surname>Ji</surname> <given-names>J.</given-names></name> <name><surname>Lei</surname> <given-names>M.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Song</surname> <given-names>Y.</given-names></name></person-group> (<year>2022</year>). <article-title>Exploring brain effective connectivity networks through spatiotemporal graph convolutional models</article-title>. <source>IEEE Trans. Neural Netw. Learn. Syst</source>. <fpage>1</fpage>&#x02013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2022.3221617</pub-id><pub-id pub-id-type="pmid">36399590</pub-id></citation></ref>
</ref-list> 
</back>
</article>
