betaFeedback

WorksComputer Science

Stage-aware Multimodal Brain Graph Contrastive Learning for Neurodegenerative Disorder Diagnosis

Abstract

Neurodegenerative disorders are characterized by their progressive nature, with distinct stages that require precise identification and tracking of progression trajectories for accurate diagnosis. However, existing diagnostic methods often fail to fully capture the unique brain patterns associated with different stages, limiting their ability to effectively target specific stages of the disorders. To address this issue, we propose a Stage-aware Multimodal Brain Graph Contrastive Learning (smBGC) method. Specifically, smBGC introduces a stage-aware feature enhancement strategy to capture stage-specific features across all progression stages, enabling the generation of stage-aware multimodal brain graph representations. In addition, smBGC incorporates a stage-adaptive brain graph augmentation approach within a graph contrastive learning framework, facilitating multimodal fusion and improving the model's capability to distinguish between different disorder stages. Experiments on two real-world datasets demonstrate the superior performance of smBGC in various neurodegenerative disorder diagnosis tasks compared with state-of-the-art methods.

Introduction

Neurodegenerative disorders, such as Alzheimer’s disease (AD) and Parkinson’s disease (PD), are typical functional impairments of the brain, leading to the decline of various brain functions (e.g., cognitive, emotional, and motor functions) [1]. Notably, neurodegenerative disorders are characterized by the progressive change of neurons and their connections [2]. The hallmark of these disorders is their staged progression, where early stages often present subtle symptoms that gradually worsen over time, ultimately leading to severe functional impairments in later stages [3]. For example, AD patients often experience several transitional stages, including mild cognitive impairment (MCI) and its early and late phases. Therefore, precise stage targeting is an essential aspect of neurodegenerative disorder diagnosis, facilitating early detection, intervention, and tailored treatment.

Machine learning-based methods, relying on various data collected by neuroimaging techniques, such as functional magnetic resonance imaging (fMRI), electroencephalography (EEG), and diffusion tensor imaging (DTI), have shown great promise for neurodegenerative disorder diagnosis [4, 5, 6]. Generally, different neuroimaging data provide distinct pathological information in terms of either brain structure or function [7]. For example, fMRI data records changes in blood oxygenation levels, reflecting brain functional information, while DTI data records the diffusion of water molecules along white matter tracts, reflecting brain structural information [8]. In this context, multimodal learning-based neurodegenerative disorder diagnosis methods have been developed to simultaneously integrate multimodal neuroimaging data (e.g., fMRI and DTI), offering comprehensive structural and functional information to enhance diagnostic accuracy [9]. More recently, due to the capability of effectively modeling complex brain connectivity, multimodal graph learning has emerged as a promising approach for neurodegenerative disorder diagnosis [10, 11, 12]. Many studies utilize multimodal brain graphs, including structural brain graphs (SBGs) and functional brain graphs (FBGs) constructed from structural imaging data (e.g., DTI) and functional imaging data (e.g., fMRI), respectively, to model complex interactions within the brain and improve model performance [13, 14, 15].

Although current multimodal brain graph learning methods demonstrate promising potential in the diagnosis of neurodegenerative disorders, several critical challenges remain unresolved [16]. One major limitation lies in their inadequate ability to distinguish among different stages of disease progression [17]. Most existing approaches primarily focus on binary classification (e.g., AD vs. normal controls), neglecting the nuanced and stage-specific alterations that occur across the full continuum of neurodegeneration [18, 19, 20]. This lack of fine-grained stage differentiation not only restricts our understanding of disease mechanisms but also severely limits the effectiveness of early screening and intervention. Early-stage diagnosis is particularly crucial, as therapeutic strategies are often more effective before irreversible neurological damage occurs. Without accurate identification of early or intermediate stages, opportunities for timely medical intervention may be missed. Moreover, the complex, high-dimensional nature of features in multimodal brain graphs—often containing substantial noise unrelated to disease—further challenges model robustness and increases the risk of overfitting [21], ultimately compromising diagnostic accuracy.

To address these issues, this paper proposes a novel Stage-aware Multimodal Brain Graph Contrastive Learning method, namely smBGC. smBGC effectively distinguishes different stages of neurodegenerative disorders by exploring distinct brain patterns within each stage. We first construct multimodal brain graphs, containing SBGs and FBGs derived from DTI and fMRI data, respectively. Then, smBGC introduces a stage-aware feature enhancement strategy to amplify stage-specific features and obtain stage-aware multimodal brain graphs, as well as reduce noise. Specifically, this strategy consists of two key steps: communal feature dropping (CFD) and stage feature extraction (SFE). In CFD, common features across all stages are treated as noise and dropped to avoid interference. In SFE, stage-specific features are extracted for each stage to obtain stage-aware SBGs and stage-aware FBGs, which are treated as two views of brain graphs. Following this, we propose a stage-adaptive brain graph augmentation approach, which strengthens stage-specific attributes by applying a node masking technique based on stage features. Afterwards, we employ contrastive learning to facilitate multimodal fusion, jointly embedding structural and functional features.

This work provides insights into the progression-related characteristics of neurodegenerative disorders and investigates specific brain patterns associated with different disorder stages. Notably, our method demonstrates strong capabilities in identifying early-stage abnormalities, which is critical for enabling timely intervention before significant neural deterioration occurs. The main contributions of this paper are as follows:

  • We propose a Stage-aware Multimodal Brain Graph Contrastive Learning (smBGC) method to uncover brain patterns across different stages of neurodegenerative disorders. smBGC captures stage-specific patterns and provides discriminative representations for different stages of neurodegenerative disorders.

  • We design a stage-aware feature enhancement strategy, which comprises a communal feature dropping module and a stage feature extraction module. This strategy amplifies brain graph features on each stage, enabling the construction of stage-aware multimodal brain graphs.

  • Extensive experiments on two real-world datasets demonstrate the proposed model outperforms state-of-the-art methods, highlighting its superiority in various neurodegenerative disorder diagnosis tasks.

The rest of the paper is organized as follows. Section II reviews related works. Section III gives the preliminaries. Section IV details the proposed smBGC. Section V presents the experimental setting and results. Finally, we conclude our work in Section VI.

Related Work

Neurodegenerative Disorder Diagnosis

Most current machine learning-based neurodegenerative disorder diagnosis methods primarily focus on binary classification tasks to distinguish between two different stages. For instance, for Alzheimer’s disease, a common task is classifying between two stages, such as normal control (NC) vs. MCI, NC vs. AD, and MCI vs. AD [14, 22]. Song et al. [19] integrated fMRI and DTI data to construct brain graphs while also integrating non-imaging information for early AD diagnosis, showing good performance in six binary classification tasks.

Ma et al. [23] focused on distinguishing between stages of MCI (e.g., early MCI vs. MCI and MCI vs. late MCI), proposing a novel multi-graph cross-attention region-aware feature fusion network with various brain region templates. Yang et al. [14] used cross-modal mutual learning to complete binary classification tasks like NC vs. MCI, MCI vs. AD, and NC vs. AD in AD detection, and NC vs. PD in PD detection. Cai et al. [24] proposed a network manifold harmonic discriminant analysis (MHDA) method for accurately detecting AD binary stages.

Stage targeting of neurodegenerative disorders, such as AD and PD, is crucial for early diagnosis and treatment planning. Traditional binary classification between only two stages is insufficient. Additionally, differences in brain state across different stages of patients are often neglected, which may lead to performance drops in methods. Recently, a few studies have focused on the diagnosis of more stages [25]. Cho et al. [17] introduced a node-variant convolution mechanism that adaptively captures both localized homophily and heterophily to learn the progressive degenerative changes in brain graphs, enabling the distinction of five AD stages and three PD stages. Hu et al. [26] developed a contrastive learning framework based on functional connectivity (FC) and high-order functional connectivity (HOFC) to address class imbalance in diagnosing five AD stages. However, these approaches primarily rely on single-modality data, indicating a need for further research on precise diagnosis and the learning of features across different modalities.

Brain Graph Analysis

Graph learning-based brain graph analysis methods focus on two main types of graphs: population graphs and brain graphs [20, 27, 28]. Population graphs are constructed based on population, where each node represents an individual’s brain. These graphs learn relationships between subjects effectively, modeling non-imaging information like gender and age as weighted edges. Population-GCN [29] represents a set of participants as a sparse graph, with nodes associated with image-based feature vectors, and edges representing phenotype information and feature similarity among participants. To address the limitation of ignoring biological biomarkers, Hao et al. [20] proposed a local-to-global graph neural network (LG-GNN), which learns feature embeddings for local brain regions and identifies biomarkers, followed by a global Subject-graph neural network that learns relationships between embeddings generated by the local ROI-GNN and non-imaging information. Song et al. [19] integrated multimodal brain imaging data to construct nodes, designing a multi-center attention graph to account for non-image information and feed the graph into a proposed multi-channel mechanism to enhance model performance.

Methods using brain graphs treat each region of interest (ROI) in the brain as a node and the connectivity between ROIs as edges. Ma et al. [30] proposed a multi-scale dynamic graph learning (MDGL) framework that leverages complementary information across spatial resolutions and temporal dynamics of rs-fMRI data to enhance the detection of brain disorders.

Liu et al. [31] embedded the guiding priors from multiscale brain atlases into the hierarchical graph convolutional neural networks for brain disorder diagnoses. Some studies focus on graph contrastive learning for brain graph analysis. Xu et al. [32] proposed ContrastPool, a contrastive graph pooling method with dual attention mechanisms tailored for brain networks and fMRI characteristics. HSGRL [33] is a symbolic graph contrastive learning model with an interpretable graph pooling module that constructs subgraphs by computing nodes with high information gain. Peng et al. [21] proposed an adaptive brain network enhancement method based on group-aware graph learning to construct group-aware brain graphs, which can adapt to distinct groups, reducing the interference of noise. HGFM [34] presents a self-supervised pretraining framework for brain disease diagnosis that models high-order correlations in brain networks using a hypergraph paradigm. DHANet [35] employs a 3D dynamic ConvMixer for feature extraction, dynamic prototype learning for region identification, and joint dynamic edge-correlation modeling to construct a heterogeneous-aware structural brain network.

Different from the above-mentioned papers, this paper treats two modalities (structure and function) from the same patient as different perspectives of the brain graph, designing enhancement strategies using connection profiles as node features for the brain graph and employing a contrastive learning framework for multimodal fusion.

Graph Contrastive Learning

Graph contrastive learning (GCL) methods create multiple graph views through random augmentations, optimizing representations by contrasting positive and negative samples [36]. The aim is to minimize the distance between similar objects (positive pairs) in the embedding space and maximize the distance between dissimilar objects (negative pairs). GCL methods are classified into intra-scale contrast, focusing on comparisons within the same level, and inter-scale contrast, examining comparisons across different levels. Intra-scale contrast focuses on comparisons at the same level, such as between node-level views (local-local). GCA [37] refines graph augmentation methods, incorporating topological and semantic prior information to address the performance limitations of single augmentation schemes. GPA [38] explores the impact of different augmentation strategies on graph instances by iteratively updating the personalized augmentation selector, and assigning personalized augmentation types based on the characteristics of each graph during training. ASP [39] diverges from traditional two-view comparisons by considering three different graph views—original, attribute, and global structure—and performs contrastive learning across these views in a unified manner. DCLN [40] presents a dual curriculum contrastive module to enhance graph structural information and reduce feature redundancy with two target functions, preventing collapse at the node and feature levels.

Inter-scale contrast, on the contrary, focuses on global-to-local comparisons between node-level views and graph-level views. For example, InfoGraph [41] contrasts representations at graph-level and sub-structural scales (nodes, edges, triangles, etc.). Zhao et al. [42] proposed an augmentation-free graph contrastive transformer optimized by the nearest neighbors to avoid model degradation caused by augmentation. In this work, we use a global-to-local contrast mode to differentiate between structural views and functional views, contrasting node representations from one view with graph representations from another view, with mutual information calculation using the Jensen-Shannon Divergence (JSD) [43].

Recent advances in GCL have introduced several innovative frameworks. Wang et al. [44] proposed idCL, a novel GCL framework that disentangles user intents and behavior distributions in user-item-concept graphs, significantly improving recommendation performance and interpretability. Jiang et al. [45] developed AdaGCL, which employs trainable generative and denoising view generators to enable adaptive, data-driven augmentation, thus improving robustness against noise and sparsity. Zhuo et al. [46] introduced an innovative contrastive learning approach that strengthens GNNs by injecting long-range similarity information through dynamically updated augmented views, effectively overcoming the limitations of static augmentations in unsupervised graph representation learning. Further advancing the field, Li et al. [47] proposed iGCL, an augmentation-free framework that eliminates the need for negative samples while ensuring representation invariance and discriminability through a novel invariant-discriminative loss function.

Preliminaries

This paper primarily addresses the problem of stage-aware multimodal brain graph analysis. Given a brain graph dataset B={{Gis,Gif},yi}i=1MB = \{\{G_i^s,G_i^f\},y^i\}_{i=1}^{M}, where GisG_i^s and GifG_i^f represent the SBG and FBG of the ii-th subject, respectively, yiy^i is the corresponding disorder label, and MM is the number of subjects. Each modality’s brain graph is constructed based on region of interest (ROI) connectivity, which can be described by a weighted graph Gi∗=(V,Ei∗,Ai∗)G_i^* = (\mathcal{V},E_i^*,A_i^*), where V={vj}j=1N\mathcal{V} = \{v_j\}_{j=1}^{N} represents a set of NN nodes (ROIs), Ei∗=V×VE_i^* = \mathcal{V} \times\mathcal{V} is the edge set, Ai∗∈RN×NA_i^* \in\mathbb{R}^{N \times N} represents the weighted adjacency matrix. Notably, the node set V\mathcal{V} remains the same across different subjects. The node feature matrix of Gi∗G_i^* is Xi∗=[x1i,x2i,…,xNi]TX_i^* = [x_1^i,x_2^i,\ldots,x_N^i]^{T}, where xji∈RDx_j^i \in\mathbb{R}^{D} represents the feature vector of node vjv_j in Gi∗G_i^*. Specifically, we directly adopt the weighted adjacency matrix as the node feature matrix, i.e., Xi∗=Ai∗X_i^* = A_i^*, such that the feature vector xjix_j^i of node vjv_j corresponds to its connectivity profile (the jj-th row of Ai∗A_i^*), and D=ND = N. For all brain graphs in the dataset, {{G1s,G1f},{G2s,G2f},…,{GMs,GMf}}\{\{G_1^s,G_1^f\},\{G_2^s,G_2^f\},\ldots,\{G_M^s,G_M^f\}\}, they can be grouped into KK groups, each representing a stage of the neurodegenerative disorder. The main goal of this paper is to utilize multimodal brain graphs as multiple views for contrastive learning, training a GNN encoder g(⋅)g(\cdot), to learn a low-dimensional latent representation for each subject, thereby obtaining a graph representation that integrates functional and structural information of brain for disorder diagnosis and stage targeting.

Formally, we calculate noise features using all brain graphs, dropping them to obtain a processed node feature matrix Xi∗′X_i^{*'}, then for the kk-th stage, we extract stage features FkF_k from all group members {{G1s,G1f}k,{G2s,G2f}k,…,{Gjs,Gjf}k}\{\{G_1^s,G_1^f\}_k,\{G_2^s,G_2^f\}_k,\ldots,\{G_j^s,G_j^f\}_k\}, where jj is the number of subjects belonging to stage kk. Subsequently, stage features are used to enhance the model’s learning, embedding the brain graphs into a specific stage space. All the notations in this paper are listed in Table 1.

NotationsDescription
BBDataset of brain graphs
Gis,Gif,Gi∗G_i^s, G_i^f, G_i^*SBG, FBG and a brain graph from any modality of the ii-th subject, respectively
yiy^iThe stage label of ii-th subject
V\mathcal{V}Node set of ii-th subject
Ei∗E_i^*Edge set of Gi∗G_i^*, ∗* represents any modality
MMThe number of subjects in BB
NNThe number of nodes
D,D′D, D'The number of node features’ dimensions and the number of dimensions after denoising, respectively
λ\lambdaThe number of dropped features on each side (top and bottom), the total number of dropped features is 2λ2\lambda
KKThe number of groups or stages
Ai∗A_i^*Weighted adjacency matrix of Gi∗G_i^*
Xi∗X_i^*Node feature matrix of Gi∗G_i^*, Xi∗=[xi1,xi2,…,xiN]TX_i^*=[x_i^1,x_i^2,\ldots,x_i^N]^{\mathrm{T}}
XXThe node feature set of a group of subjects, X={X1,X2,…,XM}X=\{X_1,X_2,\ldots,X_M\}
X~,X^\widetilde{X},\widehat{X}The reshaped node feature set and the denoised node feature set, respectively, X~={X~1,…,X~N}\widetilde{X}=\{\widetilde{X}_1,\ldots,\widetilde{X}_N\} and X^={X^1,…,X^M}\widehat{X}=\{\widehat{X}_1,\ldots,\widehat{X}_M\}
X~,x^\widetilde{X},\widehat{x}The matrix containing node features across all subjects and the denoised node feature, respectively
SSThe feature scoring matrix
ScS_cThe common scoring matrix
FkF_kThe stage feature scoring matrix of stage kk
Fkf,FksF_k^f,F_k^sThe functional and structural stage feature scoring matrix of stage kk
F\mathcal{F}The collection of stage feature scoring matrices, F={Fk}k=1K\mathcal{F}=\{F_k\}_{k=1}^{K}
WWWeighted vector
X^∗′\widehat{X}^{*'}The augmented node feature matrix

Table 1. Notations in this paper.

Methodology

In this section, we present our smBGC approach, with the overall architecture illustrated in Figure 1. We first explain how smBGC employs a stage-aware feature enhancement strategy to adaptively construct brain networks for patients at different stages, thereby reducing noise features while enhancing stage-specific characteristics. Next, we describe our stage-adaptive brain graph augmentation approach, which refines the multimodal network representations. Finally, we detail the multimodal fusion through contrastive learning, in which structural and functional brain networks are treated as multiple perspectives of the brain and jointly embedded into a unified space.

The overall framework of smBGC

Figure 1. The overall framework of smBGC. Multimodal data are used to construct the FBG and SBG. The feature score matrix of each stage is generated using SVD, and feature enhancement is performed with weighted vectors. Both structural and functional brain graphs undergo feature masking and enhancement, with the new graph representations input into a parameter-sharing GNN for contrastive learning to capture the associations and differences between FBGs and SBGs.

Stage-aware Feature Enhancement Strategy

In this section, we detail how to obtain stage-aware brain graphs using the stage-aware feature enhancement strategy. The key to this strategy is a Singular Value Decomposition (SVD)-based feature scoring function, which computes the importance score of each feature from a cohort of patients’ brain graphs, thereby reflecting the node feature’s significance within that subgroup. This scoring framework enables two critical processing stages: Communal Feature Dropping (CFD) to eliminate non-discriminative features across stages, and Stage Feature Extraction (SFE) to selectively capture discriminative features associated with specific disorder stages.

SVD-based Node Feature Scoring Function

The scoring function is inspired by the Latent Semantic Indexing (LSI) algorithm in natural language processing, which fundamentally employs SVD on a term-document matrix (with elements representing word frequencies or weighted values) to extract latent semantic structures: the left singular matrix characterizes the distribution of terms in the latent space, reflecting their semantic properties (such as importance or topic relevance), while the right singular matrix corresponds to the semantic patterns of documents. In this study, we use patients’ connectivity matrices as node features and reorganize the node feature matrices of a group of subjects to obtain a feature-node matrix analogous to the term-document matrix. Given their similar high-dimensional characteristics and entity-relationship structures, we can adapt this core concept of LSI to brain network analysis. By decomposing this matrix, we achieve dimensionality reduction and employ the left singular vectors to interpret key nodal features of the group, mirroring the approach of understanding term importance through their weight distribution in semantic space.

Specifically, taking an arbitrary group of subjects as an example, to introduce the subject more concisely, we consider only the brain graphs from a single modality, omitting the superscripts that denote specific modality graphs. Starting from the node features of this group X={X1,X2,…,XM}\mathcal{X} = \{X_1,X_2,\ldots,X_M\}, where Xm∈RN×DX_m \in\mathbb{R}^{N \times D} represents the node feature matrix of the mm-th subject. The first step of the scoring function is to rearrange the features of each node across all MM subjects in this group, resulting in a new set of feature-node matrices X~={X~1,X~2,…,X~N}\widetilde{\mathcal{X}} = \{\widetilde{X}_1,\widetilde{X}_2,\ldots,\widetilde{X}_N\}, where X~n∈RD×M\widetilde{X}_n \in\mathbb{R}^{D \times M} denotes the matrix containing node features across all subjects of node nn. We then perform SVD on each of these new matrices to score the features at each node. The first column of the left singular matrix obtained from SVD serves as the score for each feature, representing the importance of each feature to each node within this group. Thus, we obtain a feature score matrix for all nodes, which can be expressed as follows:

X~n=UnΣnVnT,n=1,2,…,N,(1)\widetilde{X}_n = U_n\Sigma_n V_n^T,\qquad n=1,2,\ldots,N, \tag*{(1)}
un=Un[:,1]=[μ1n,μ2n,…,μDn]T,(2)\mathbf{u}^n = U_n[:,1] = [\mu_1^n,\mu_2^n,\ldots,\mu_D^n]^T, \tag*{(2)}
S=[u1,u2,…,uN]T=ϕ(X).(3)S = [\mathbf{u}^1,\mathbf{u}^2,\ldots,\mathbf{u}^N]^T = \phi(\mathcal{X}). \tag*{(3)}

Here, UnU_n is the left singular matrix, un\mathbf{u}^n is the set of feature scores for a single node, μdn\mu_d^n is the score of the dd-th dimensional feature, and S∈RN×DS \in\mathbb{R}^{N \times D} is the communal feature score matrix for all nodes in the group. For better understanding, we provide the process of the SVD-based scoring function (as shown in Algorithm 1).

Note that prior to constructing the feature-node matrix X~n\widetilde{X}_n, we take the absolute value of functional connectivity values (derived from Pearson correlation and thus signed), to ensure that the scoring reflects connection strength rather than confounded by correlation sign. Structural connectivity values, non-negative by construction, require no such transformation. The resulting score vector is taken directly from the left singular vector without further normalization.

For a single matrix of size p×qp \times q, the time complexity of performing Singular Value Decomposition (SVD) is O(min⁡(p×q2,p2×q))O(\min(p \times q^{2}, p^{2} \times q)) and the space complexity is O(p×q)O(p \times q). In Algorithm 1, SVD is applied to each node-level matrix. X~n∈RD×M\widetilde{X}_{n} \in\mathbb{R}^{D \times M}. Accordingly, the computational complexity for each node is O(min⁡(D×M2,D2×M))O(\min(D \times M^{2}, D^{2} \times M)), and the space complexity is O(D×M)O(D \times M). Considering that there are NN brain regions (nodes) in total, the overall time and space complexities are:

T=O(N×min⁡(D×M2,D2×M)),(4)T = O(N \times\min(D \times M^{2}, D^{2} \times M)), \tag*{(4)}
S=O(M×N×D).(5)S = O(M \times N \times D). \tag*{(5)}

Given that the number of nodes NN is relatively small in standard brain atlases (e.g., AAL90), and that neurodegenerative disorder datasets are typically of limited scale, this computational cost is acceptable in practice. In addition, SVD operations can be efficiently parallelized on modern GPUs or multi-core CPUs. When extending the framework to higher-resolution brain atlases (e.g., AAL116 or CC200) or longitudinal multi-session datasets, the computational burden can be further reduced using truncated SVD or randomized SVD, which provide efficient low-rank approximations while maintaining interpretability of the feature representations.

Communal Feature Dropping

We achieve brain network denoising by identifying and processing communal features. Specifically, we treat all subjects across different disorder stages in the training set as a unified population, where X={X1,X2,…,XM}\mathcal{X} = \{X_{1}, X_{2}, \ldots, X_{M}\} in the previous step comprises the nodal feature matrices of all training samples. Using our SVD-based feature scoring function, we compute a communal feature scoring matrix that quantifies the global importance of each feature to every network node across different disorder stages. We then compute the average score for each feature to rank the feature dimensions, differentiating between the communal features and the individual features by setting the number of dropping features λ\lambda. We select a subset of features as communal features from both high and low dimensions, namely top-λ\lambda and bottom-λ\lambda. By dropping these communal features, we achieve denoising and dimensionality reduction of the node features in the brain graph. This results in a total of 2λ2\lambda dropped features, and the denoised node feature matrices X^={X^1,X^2,…,X^M}\widehat{\mathcal{X}} = \{\widehat{X}_{1}, \widehat{X}_{2}, \ldots, \widehat{X}_{M}\}, where X^m∈RN×D′\widehat{X}_{m} \in\mathbb{R}^{N \times D'} have reduced dimensionality D′=D−2λD' = D - 2\lambda. The communal feature dropping step is shown in Figure 2. This process effectively identifies and eliminates noise features in brain graphs that are unrelated to specific disorder stages, thereby enhancing the accuracy of subsequent stage-specific analyses.

Overview of the proposed Communal Feature Dropping

Figure 2. Overview of the proposed Communal Feature Dropping.

Algorithm 1 SVD-based Scoring Function

1: Input: Node features of all subjects X={X1,X2,…,XM}\mathbf{X} = \{\mathbf{X}_1,\mathbf{X}_2,\ldots,\mathbf{X}_M\}, X∈RM×N×D\mathbf{X} \in\mathbb{R}^{M \times N \times D}, where Xm∈RN×D\mathbf{X}_m \in\mathbb{R}^{N \times D} is the feature matrix of the mm-th subject, NN is the number of nodes, and DD is the number of features. 2: Output: Scoring matrix S\mathbf{S} 3: Set a node-level tensor X~={X~1,X~2,…,X~N}\widetilde{\mathbf{X}} = \{\widetilde{\mathbf{X}}_1,\widetilde{\mathbf{X}}_2,\ldots,\widetilde{\mathbf{X}}_N\}, X~∈RN×D×M\widetilde{\mathbf{X}} \in\mathbb{R}^{N \times D \times M}, where X~n∈RD×M\widetilde{\mathbf{X}}_n \in\mathbb{R}^{D \times M} is the matrix containing node features across all subjects of node nn. 4: for i=1i = 1 to MM do 5:   for j=1j = 1 to NN do 6:     for z=1z = 1 to DD do 7:       X~[j,z,i]=X[i,j,z]\widetilde{\mathbf{X}}[j,z,i] = \mathbf{X}[i,j,z] 8:     end for 9:   end for 10: end for 11: for i=1i = 1 to NN do 12:   S′=SVD⁡(X~[i,:,:])\mathbf{S}' = \operatorname{SVD}(\widetilde{\mathbf{X}}[i,:,:]) 13:   for j=1j = 1 to DD do 14:     S[i,j]=S′[j,1]\mathbf{S}[i,j] = \mathbf{S}'[j,1] 15:   end for 16: end for 17: return S\mathbf{S}

Stage Feature Extraction

3) Stage Feature Extraction: Building upon the CFD step, we further implement Stage Feature Extraction. Specifically, for each distinct stage of the disorder, we compute a corresponding node feature scoring matrix to quantify the stage-specific contribution of each feature to the nodes. The purified node features obtained after the CFD step are then divided into KK groups according to the disorder stage of the subjects, represented as X^={X^k}k=1K\widehat{\mathbf{X}} = \{\widehat{\mathbf{X}}_k\}_{k=1}^{K}. To extract stage features within each group, we again use the SVD-based scoring function for the denoised node feature matrices of all subjects within a single group, obtaining the scoring matrix for each group.

For group kk, the scoring matrix for that group is Fk=ϕ(X^k)\mathbf{F}_k = \phi(\widehat{\mathbf{X}}_k). After computing for all groups, we can obtain a collection of stage feature scoring matrices F={Fk}k=1K\mathbf{F} = \{\mathbf{F}_k\}_{k=1}^{K}, where Fk∈RN×D′\mathbf{F}_k \in\mathbb{R}^{N \times D'}, with each group corresponding to a stage of neurodegenerative disorders. The scoring matrices can be viewed as weights of various nodes on different features within that stage, reflecting the unique information of that stage. Simultaneously, the scoring matrices will be used for graph augmentation, which will be elaborated in Section IV-B.

Stage-adaptive Brain Graph Augmentation

Graph augmentation has become an indispensable step in graph contrastive learning. The goal of graph augmentation is to generate two graph views by modifying structural information without affecting the semantic labels of the input graphs [48]. Instead of relying on uniform data augmentation schemes, such as random node dropping, edge perturbation, or

subgraph sampling, we introduce a unique stage feature-based strategy into our graph augmentation scheme. In this section, we will describe how to use stage feature scoring matrices to augment brain graphs of subjects at different stages. Figure 3 illustrates the process of augmentation.

Overview of the proposed stage-adaptive brain graph augmentation approach

Figure 3. Overview of the proposed stage-adaptive brain graph augmentation approach. We select the brain graph of a single subject from one stage as an example to illustrate how smBGC utilizes the scoring matrix for graph augmentation.

After applying the stage-aware feature enhancement strategy, we obtain X^f={X^1f,X^2f,…,X^Mf}\widehat{\mathbf{X}}^{f} = \{\widehat{\mathbf{X}}_1^{f},\widehat{\mathbf{X}}_2^{f},\ldots,\widehat{\mathbf{X}}_M^{f}\} and X^s={X^1s,X^2s,…,X^Ms}\widehat{\mathbf{X}}^{s} = \{\widehat{\mathbf{X}}_1^{s},\widehat{\mathbf{X}}_2^{s},\ldots,\widehat{\mathbf{X}}_M^{s}\}, where X^f\widehat{\mathbf{X}}^{f} and X^s\widehat{\mathbf{X}}^{s} represent the denoised node features of the FBG and SBG, respectively, along with the collection of stage feature scoring matrices F={Fk}k=1K\mathbf{F} = \{\mathbf{F}_k\}_{k=1}^{K}. Inspired by the GCA method proposed by Zhu et al. [37], which adaptively enhances the edges and node attributes of input graphs, we employ a stage-based graph augmentation module. Our feature masking strategy masks certain less important attributes in the node features. Specifically, we treat stage features as important attributes that should be preserved. For instance, in single-modality graph augmentation, to compute the importance of stage features, we define weights for each dimension of the subject’s node features as:

W=1N∑i=1N∥xi∥⊙Fk,i,(6)\mathbf{W} = \frac{1}{N}\sum_{i=1}^{N}\lVert\mathbf{x}_i \rVert\odot\mathbf{F}_{k,i}, \tag*{(6)}

where xi\mathbf{x}_i is the feature vector of node viv_i, and Fk,i\mathbf{F}_{k,i} represents the stage scoring vector of node viv_i in stage kk for the subject. ⊙\odot denotes element-wise multiplication, resulting in W=\mathbf{W} = [w1,w2,…,wD][w_1,w_2,\ldots,w_D], where wd\mathbf{w}_d quantifies the aggregated stage-specific importance of the dd-th feature dimension. To convert these weights into meaningful masking probabilities, we apply a logarithmic transformation to compress their dynamic range and compute the masking probability pdp_d for each dimension:

pd=min⁡(α⋅log⁡wmax⁡−log⁡wdlog⁡wmax⁡−log⁡μw,pt).(7)p_d=\min\left(\alpha\cdot\frac{\log w_{\max}-\log\mathbf{w}_d}{\log w_{\max}-\log\mu_w},p_t\right). \tag*{(7)}

where wmax⁡w_{\max} and μw\mu_w denote the maximum and mean values of WW, respectively. Dimensions with higher stage-specific importance (i.e., wd\mathbf{w}_d closer to wmax⁡w_{\max}) yield smaller pdp_d, making them less likely to be masked. Here, α\alpha controls the overall augmentation strength, while pt<1p_t<1 serves as a truncation threshold to prevent excessively aggressive masking that could disrupt the intrinsic graph structure. The feature enhancement strategy samples a random vector b~∈{0,1}D\tilde{\mathbf{b}}\in\{0,1\}^D, where each dimension is described by a Bernoulli distribution, such that b~d∼Bernoulli(pd), ∀i\tilde{b}_d\sim Bernoulli(p_d),\ \forall i. Accordingly, b~d∼Bernoulli(pd)\tilde{b}_d\sim Bernoulli(p_d) is a masking indicator, where b~d=1\tilde{b}_d=1 denotes that the corresponding feature is masked (set to zero) and b~d=0\tilde{b}_d=0 denotes that it is retained, and then the enhanced node features are computed as:

X^′=[x^1⊙(1−b~1);x^2⊙(1−b~2);…;x^N⊙(1−b~N)]T.(8)\hat{X}'=\left[\hat{\mathbf{x}}_1\odot(1-\tilde{\mathbf{b}}_1);\hat{\mathbf{x}}_2\odot(1-\tilde{\mathbf{b}}_2);\ldots;\hat{\mathbf{x}}_N\odot(1-\tilde{\mathbf{b}}_N)\right]^{\mathsf{T}}. \tag*{(8)}

Finally, by applying our graph augmentation approach to FBGs and SBGs, we can generate enhanced graph views {G^s,G^f}\{\hat{G}^{s},\hat{G}^{f}\}.

Multimodal Fusion via Contrastive Learning

In this section, we will discuss how to fuse structural and functional brain graphs via contrastive learning and design contrastive loss and optimization objectives for model training.

Multimodal Brain Graph Embedding

1) Multimodal Brain Graph Embedding: After the aforementioned steps, we obtain a new augmented graph dataset B^={({G^is,G^if},yi)}i=1M\hat{B}=\{(\{\hat{G}^{s}_i,\hat{G}^{f}_i\},y_i)\}_{i=1}^{M}, where the node feature matrix of G^i∗\hat{G}^{*}_i is X^i∗=[x^i,1,x^i,2,…,x^i,N]T\hat{X}^{*}_i=[\hat{\mathbf{x}}_{i,1},\hat{\mathbf{x}}_{i,2},\ldots,\hat{\mathbf{x}}_{i,N}]^{\mathsf{T}}. We use a GNN-based view encoder g(⋅)g(\cdot) to compute the embedding for each subject, with the encoder’s parameters shared across all modalities. For the embedding of a single-modality brain graph, we input its node features into a message-passing GNN. Inspired by BrainGB [7], we construct a message vector vij(l)\mathbf{v}_{ij}^{(l)}, which consists of the node embedding hi(l)\mathbf{h}_i^{(l)} of node viv_i at the ll-th layer, its neighbor’s node embedding, and the edge weight eije_{ij}, to be fed into an MLP. We aggregate all neighborhood information and perform propagation. Formally, the above process can be represented as:

vij(l)=MLP([hi(l);hj(l);eij]).(9)\mathbf{v}_{ij}^{(l)}=MLP\left(\left[\mathbf{h}_i^{(l)};\mathbf{h}_j^{(l)};e_{ij}\right]\right). \tag*{(9)}
hi(l)=ReLU(∑j∈Ni∪{i}vij(l−1)).(10)\mathbf{h}_i^{(l)}=ReLU\left(\sum_{j\in N_i\cup\{i\}}\mathbf{v}_{ij}^{(l-1)}\right). \tag*{(10)}

Finally, we use sum pooling to aggregate all the node embeddings and employ an MLP with residual connections parameterized by Φ\Phi to compute the graph embedding:

z=MLPΦ(∑i=1Nhi(k))+∑i=1Nhi(k).(11)\mathbf{z}=MLP_{\Phi}\left(\sum_{i=1}^{N}\mathbf{h}_i^{(k)}\right)+\sum_{i=1}^{N}\mathbf{h}_i^{(k)}. \tag*{(11)}

Through this method, we compute graph-level representations for two modalities, denoted as zis∼g(G^is)\mathbf{z}^{s}_i\sim g(\hat{G}^{s}_i) and zif∼g(G^if)\mathbf{z}^{f}_i\sim g(\hat{G}^{f}_i).

Multimodal Fusion and Optimization

2) Multimodal Fusion and Optimization: We calculate graph-level representations for each subject, where the graph representations for structural and functional views are represented as zis∼g(G^is)\mathbf{z}^{s}_i\sim g(\hat{G}^{s}_i) and zif∼g(G^if)\mathbf{z}^{f}_i\sim g(\hat{G}^{f}_i). During inference, we fuse the representations of the two views by averaging the sum to form the multimodal graph representation for downstream tasks, expressed as: zi=(zis+zif)/2\mathbf{z}_i=(\mathbf{z}^{s}_i+\mathbf{z}^{f}_i)/2.

We adopt a global-to-local contrastive learning mode to set an optimization objective for model training. Specifically, we contrast the node representation of one view with the graph representation of another view, aiming to maximize the mutual information between views, defined as:

Lcon=12M∑(G^is,G^if)∈B^[1N∑j=1N(I(hjf;zis)+I(hjs;zif))].(12)\mathcal{L}_{\mathrm{con}}=\frac{1}{2M}\sum_{(\hat{G}^{s}_i,\hat{G}^{f}_i)\in\hat{B}}\left[\frac{1}{N}\sum_{j=1}^{N}\left(I(\mathbf{h}^{f}_j;\mathbf{z}^{s}_i)+I(\mathbf{h}^{s}_j;\mathbf{z}^{f}_i)\right)\right]. \tag*{(12)}

Here, I(hjf;zis)I(\mathbf{h}^{f}_j;\mathbf{z}^{s}_i) estimates the mutual information between the node representation hjf\mathbf{h}^{f}_j in the functional view and the structural graph representation zis\mathbf{z}^{s}_i of the ii-th subject, and vice versa. By setting this contrastive objective between different modalities, we ensure cross-modal consistency, allowing the model to adaptively extract discriminative knowledge from each modality without learning a shared brain graph structure. We employ the Jensen-Shannon Divergence (JSD) to compute mutual information I(X;Y)I(X;Y). For example, the JSD mutual information estimate for I(hjf;zis)I(\mathbf{h}^{f}_j;\mathbf{z}^{s}_i) can be represented as:

I(hjf;zis)=−sp(−d(hjf,zis))−1N−1∑vn∈V\{vj}sp(d(hnf,zis)).(13)I(\mathbf{h}^{f}_j;\mathbf{z}^{s}_i)=-sp\left(-d(\mathbf{h}^{f}_j,\mathbf{z}^{s}_i)\right)-\frac{1}{N-1}\sum_{v_n\in V\backslash\{v_j\}}sp\left(d(\mathbf{h}^{f}_n,\mathbf{z}^{s}_i)\right). \tag*{(13)}

Here, sp(x)=log⁡(1+ex)sp(x)=\log(1+e^x) denotes the softplus method, and d(x,y)d(x,y) is a discriminator function that computes the inner product of the two node embeddings along with a sigmoid activation function. The left part of the equation calculates the score for positive sample pairs, taking the functional node embedding of node vjv_j and its corresponding structural graph embedding as positive samples, while the right part computes the score for negative sample pairs, taking all node embeddings except node vjv_j and their graph embeddings as negative samples. The process of maximizing mutual information encourages the scores of positive sample pairs to increase while reducing the scores of negative sample pairs. The theoretical optimization objective is to minimize the contrastive loss Lcon\mathcal{L}_{\mathrm{con}}, which corresponds to maximizing the lower bound of the mutual information between positive sample pairs across views.

Finally, we employ a multilayer perceptron to generate predictions for classification tasks, using cross-entropy loss as the supervised loss. The entire model can be trained in an end-to-end manner by optimizing:

L=η1Lcon+η2Lsupervised.(14)\mathcal{L}=\eta_1\mathcal{L}_{\mathrm{con}}+\eta_2\mathcal{L}_{\mathrm{supervised}}. \tag*{(14)}

where η1\eta_1 and η2\eta_2 are the loss weights.

Experiments

In this section, we conduct a series of experiments to evaluate the effectiveness of the smBGC method. First, we provide detailed information about the datasets and experimental setup. Then, we perform experiments on two datasets to compare the performance of different methods. Finally, we conduct the ablation study and parameter study.

Datasets and Preprocessing

We evaluate our method using two publicly available datasets: the third Alzheimer’s Disease Neuroimaging Initiative (ADNI-3) dataset [49] and the Parkinson’s Progression Markers Initiative (PPMI) dataset [50]. (1) The ADNI-3 is a longitudinal, multi-site, multimodal neuroimaging dataset. In this study, we focus on the latest ADNI-3 dataset, which includes more comprehensive imaging data across additional disorder stages. We collect data from 578 subjects for evaluation, comprising 54 AD patients, 34 late mild cognitive impairment (LMCI) patients, 192 MCI patients, 88 early mild cognitive impairment (EMCI) patients, and 210 NC. Using the ADNI-3 dataset, we perform a three-stage classification task (NC vs. MCI vs. AD) and a four-stage classification task (NC vs. EMCI vs. LMCI vs. AD). (2) The PPMI dataset includes various types of neuroimaging data across different stages of PD. We collect data from 56 NC, 100 high-risk prodromal patients, and 99 PD patients. Using the PPMI dataset, we perform a three-stage classification task (NC vs. Prodromal vs. PD).

For both datasets, each subject includes both fMRI and DTI data. We exclude duplicate scans and retain single-scan data for each modality. For fMRI data, we process it using the GRETNA Toolbox [51], segmenting the brain into regions based on the AAL90 template, calculating time series for each region, and measuring functional connectivity using the Pearson correlation coefficient (PCC). For DTI data, we process it using PANDA [52], correct distortions with FSL to obtain fiber images, and segment brain regions using the AAL90 template based on T1-weighted images. Structural connectivity is calculated using fractional anisotropy metrics.

Experimental Settings

To thoroughly evaluate the performance of our method, we use five evaluation metrics, including classification accuracy (ACC), sensitivity (SEN), specificity (SPE), F1 score (F1) and ROC-AUC (AUC), where higher values indicate better performance. In this study, we use 5-fold cross-validation to evaluate all methods. The splits of the training and testing sets remain consistent, with the dataset divided into five subsets. For each experiment, four subsets are used as the training set, and the remaining subset is used as the testing set. In the stage-aware feature enhancement strategy, both CFD and SFE are performed exclusively on the training set to compute the noise features and stage-specific scoring matrices. The enhanced training data are then used to train the contrastive learning model. During inference, a fixed feature mask learned from the training set is applied to remove noise features from the test samples, and the processed test data are subsequently fed into the trained model for classification. All experiments are implemented in PyTorch and conducted on NVIDIA GeForce A40 GPU with 24 GB memory. The hyperparameters used in our model for different stage diagnosis tasks are detailed in Table II. All hyperparameters are selected based on prelimi

HyperparameterADNI-3 (three stages)ADNI-3 (four stages)PPMI
Functional magnitude αf\alpha_f0.60.60.7
Structural magnitude αs\alpha_s0.60.50.3
Dropping features λ\lambda202030
GNN layers111
Dropout0.50.50.5
Readout methodsumsumsum
Learning rate1e-21e-21e-2
Batch size161616
Epochs100100100
Weight decay1e-41e-41e-4

Table II. Hyperparameters for training on three different tasks.

Algorithm 2 Training Procedure of smBGC

Require: Training set B={(Gis,Gif),yi}i=1M\mathcal{B} = \{(\mathbf{G}_i^s, \mathbf{G}_i^f), y_i\}_{i=1}^{M}; number of stages KK; number of dropping features λ\lambda; loss weights η1,η2\eta_1, \eta_2

Ensure: Trained encoder g(⋅)g(\cdot), classifier, dropped feature index set Idrop\mathcal{I}_{\mathrm{drop}}

  1. Compute communal scoring matrix S←ϕ(X)\mathbf{S} \leftarrow\phi(\mathbf{X}) over all training subjects (Eq. (1)–(3))

  2. Rank features by average score; select top-λ\lambda and bottom-λ\lambda as Idrop\mathcal{I}_{\mathrm{drop}}

  3. Drop Idrop\mathcal{I}_{\mathrm{drop}} from all node features to obtain X^\hat{\mathbf{X}} {Communal Feature Dropping}

  4. Partition X^\hat{\mathbf{X}} into KK stage groups {X^k}k=1K\{\hat{\mathbf{X}}_k\}_{k=1}^{K}

  5. for k=1k = 1 to KK do

  6. &nbsp;&nbsp;&nbsp;&nbsp;Compute stage scoring matrix Fk←ϕ(X^k)\mathbf{F}_k \leftarrow\phi(\hat{\mathbf{X}}_k) {Stage Feature Extraction}

  7. end for

  8. for epoch =1= 1 to EE do

  9. &nbsp;&nbsp;&nbsp;&nbsp;for each subject ii in a mini-batch do

  10. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Compute importance weights W\mathbf{W} via Eq. (6) using Fyi\mathbf{F}_{y_i}

  11. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Compute masking probabilities pdp_d via Eq. (7)

  12. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Sample masking indicators b~d∼Bernoulli⁡(pd)\tilde{b}_d \sim\operatorname{Bernoulli}(p_d)

  13. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Obtain augmented views G^is,G^if\hat{\mathbf{G}}_i^s, \hat{\mathbf{G}}_i^f via Eq. (8)

  14. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Encode both views with shared GNN encoder g(⋅)g(\cdot) to get zis,zif\mathbf{z}_i^s, \mathbf{z}_i^f and node embeddings

  15. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Compute contrastive loss Lcon\mathcal{L}_{\mathrm{con}} (Eqs. (12)–(13)) between the two views

  16. &nbsp;&nbsp;&nbsp;&nbsp;end for

  17. &nbsp;&nbsp;&nbsp;&nbsp;Fuse embeddings zi=(zis+zif)/2\mathbf{z}_i = (\mathbf{z}_i^s + \mathbf{z}_i^f)/2; compute classification loss Lsupervised\mathcal{L}_{\mathrm{supervised}}

  18. &nbsp;&nbsp;&nbsp;&nbsp;Update parameters by minimizing L=η1Lcon+η2Lsupervised\mathcal{L} = \eta_1\mathcal{L}_{\mathrm{con}} + \eta_2\mathcal{L}_{\mathrm{supervised}} (Eq. (14))

  19. end for

  20. return trained g(⋅)g(\cdot), classifier, Idrop\mathcal{I}_{\mathrm{drop}}

Algorithm 3 Testing Procedure of smBGC

Require: Test subject with {Gs,Gf}\{\mathbf{G}^s, \mathbf{G}^f\}; trained encoder g(⋅)g(\cdot); trained classifier; dropped feature index set Idrop\mathcal{I}_{\mathrm{drop}} (fixed from training)

Ensure: Predicted disorder stage y^\hat{y}

  1. Remove features indexed by Idrop\mathcal{I}_{\mathrm{drop}} from Xs,Xf\mathbf{X}^s, \mathbf{X}^f {no re-computation; mask is fixed}

  2. Encode Gs,Gf\mathbf{G}^s, \mathbf{G}^f with trained g(⋅)g(\cdot) (no augmentation) to obtain zs,zf\mathbf{z}^s, \mathbf{z}^f

  3. Fuse: z=(zs+zf)/2\mathbf{z} = (\mathbf{z}^s + \mathbf{z}^f)/2

  4. y^←\hat{y} \leftarrow classifier(z)(\mathbf{z})

  5. return y^\hat{y}}

nary experiments on the training data and are fixed across all folds. During training, we employ the Adam optimizer, and the model’s performance on the testing set is evaluated every five epochs. For each fold in the 5-fold cross-validation, the performance on the testing set at the final epoch is recorded across five runs. The means and standard deviations of these runs are calculated to represent the final results for each metric. The complete training and testing pipeline are illustrated in Algorithm 2 and Algorithm 3.

Model Comparison

Baselines

In this study, to evaluate the effectiveness of smBGC, we compare it with deep graph learning models and well-established brain graph learning models. These methods include:

  • GCN [53]: Graph Convolutional Network (GCN) performs convolution operations on the graph in either the spectral or spatial domain, leveraging the inherent graph structure.

  • GAT [54]: Graph Attention Network (GAT) is a type of graph neural network that uses attention mechanisms to prioritize the influence of neighboring nodes during information aggregation. This mechanism allows GAT to capture complex relationships and dependencies more effectively.

  • GraphSAGE [55]: GraphSAGE samples a fixed-sized neighborhood around each node and aggregates the features of these neighbors from large-scale graphs to learn node embeddings.

  • GIN [56]: Graph Isomorphism Network (GIN) is inspired by the Weisfeiler-Lehman test and aims to provide equivalent discriminative power through expressive aggregation functions.

  • GCA [37]: GCA is a general contrastive framework for unsupervised graph representation learning with adaptive data augmentation. It performs data augmentation on both topological and attribute levels to adapt to graph structures and attributes, encouraging the model to learn important features from these aspects.

  • BrainGB [7]: BrainGB is a benchmark for brain graph analysis using GNNs. It standardizes this process and summarizes the pipeline for constructing brain graphs from functional and structural neuroimaging patterns, modularizing the implementation of GNN designs.

  • BrainIB [57]: BrainIB takes brain networks constructed from fMRI data as input and learns to identify the most discriminative subgraph of key connections, thereby reducing redundant information while improving generalization performance.

  • MAHGCN [31]: MAHGCN constructs functional connectivity networks (FCNs) across multiple spatial scales and leverages hierarchical relationships among brain regions at different scales through an Atlas-guided Pooling strategy. By integrating multiscale information within a hierarchical GCN architecture, it is able to more comprehensively extract brain connectivity features.

  • Cross-GNN [14]: Cross-GNN models cross-modal relationships through dynamic brain graphs and mutual learning mechanisms, using data-driven attention modeling on the adjacency matrices that represent modality dependencies.

  • RH-BrainFS [15]: RH-BrainFS proposes a strategy for region heterogeneity in multimodal brain graph fusion, integrating heterogeneous region features from different modalities within brain graphs while addressing regional heterogeneity issues.

  • MCGAN [58]: MCGAN introduces a multioutput conditional GAN for data augmentation, followed by a multiheaded gating fusion model to capture complementary features across modalities for classification.

  • MMP-GCN [19]: MMP-GCN introduces a penalty mechanism based on DTI intensities to construct functional brain graphs, enhancing the expression of connectivity information. This method integrates various data sources and assigns unique filters to different data, thereby enhancing model performance.

  1. Result Comparison: Table III presents the performance of our method on three-stage and four-stage classification tasks using the ADNI-3 dataset. For the NC vs. MCI vs. AD classification task, smBGC achieves the best performance among all methods, with an accuracy of 96.47%, an F1 score of 96.18%, an AUC of 99.06%, a specificity of 97.89%, and a sensitivity of 95.45%. Similarly, in the more challenging four-stage classification task (NC vs. EMCI vs. LMCI vs. AD), smBGC maintains outstanding performance, achieving the highest accuracy of 81.71%, an F1 score of 79.02%, an AUC of 96.14%, a sensitivity of 64.97%, and a specificity of 96.24%. Table IV demonstrates the results of the three-stage classification task (NC vs. Prodromal vs. PD) on the PPMI dataset. Our method achieves the highest accuracy of 91.15%, an F1 score of 91.24%, an AUC of 96.27%, a sensitivity of 91.77%, and a specificity of 95.61%, underscoring the robustness and generalizability of our approach.

Overall, basic deep graph learning models, such as GCN, perform poorly across all tasks. These methods, relying solely on unimodal data, fail to effectively capture the characteristics of brain graphs at different disorder stages. In contrast, models like RH-BrainFS, MMP-GCN, and Cross-GNN, which integrate multimodal data, further improve stage classification performance, with complementary information between modalities playing a critical role. Notably, GCA

Result Comparison

MethodNC vs. MCI vs. ADNC vs. EMCI vs. LMCI vs. AD
ACCF1AUCSENSPEACCF1AUCSENSPE
GCN54.30±1.6754.30 \pm1.6741.97±2.2941.97 \pm2.2967.51±2.7267.51 \pm2.7242.80±1.7942.80 \pm1.7974.06±1.1974.06 \pm1.1943.75±3.6443.75 \pm3.6435.01±3.6035.01 \pm3.6065.90±3.5865.90 \pm3.5835.07±3.6035.07 \pm3.6080.83±1.2980.83 \pm1.29
GAT50.78±2.4450.78 \pm2.4441.65±3.4841.65 \pm3.4865.22±2.9965.22 \pm2.9941.79±2.8641.79 \pm2.8672.07±0.8872.07 \pm0.8846.88±7.2346.88 \pm7.2337.07±5.3137.07 \pm5.3169.95±5.0369.95 \pm5.0339.17±4.7739.17 \pm4.7781.38±1.8781.38 \pm1.87
GIN50.77±2.5750.77 \pm2.5742.38±2.4842.38 \pm2.4863.06±2.4563.06 \pm2.4543.19±2.7543.19 \pm2.7572.89±1.4272.89 \pm1.4250.00±11.6350.00 \pm11.6347.28±11.5847.28 \pm11.5863.51±7.3463.51 \pm7.3447.22±10.9547.22 \pm10.9582.56±3.9382.56 \pm3.93
GraphSAGE56.95±4.1356.95 \pm4.1347.74±5.1547.74 \pm5.1569.47±3.5669.47 \pm3.5647.84±5.0247.84 \pm5.0275.55±2.8775.55 \pm2.8743.75±6.1243.75 \pm6.1239.29±5.1439.29 \pm5.1461.55±4.8761.55 \pm4.8740.84±4.4640.84 \pm4.4681.26±2.4781.26 \pm2.47
BrainGB53.33±4.4653.33 \pm4.4638.23±4.7938.23 \pm4.7962.10±3.0962.10 \pm3.0940.84±4.1240.84 \pm4.1272.35±2.8172.35 \pm2.8140.63±5.9240.63 \pm5.9232.14±6.0232.14 \pm6.0255.68±4.0155.68 \pm4.0134.67±4.2034.67 \pm4.2076.02±1.7976.02 \pm1.79
MAHGCN56.80±4.2856.80 \pm4.2842.04±4.1242.04 \pm4.1271.33±5.0871.33 \pm5.0844.60±3.4844.60 \pm3.4874.58±2.2274.58 \pm2.2241.95±5.4341.95 \pm5.4332.36±3.7932.36 \pm3.7968.27±2.3568.27 \pm2.3536.79±4.8436.79 \pm4.8479.85±1.7979.85 \pm1.79
BrainIB61.62±1.4061.62 \pm1.4036.88±5.2136.88 \pm5.2166.59±2.6766.59 \pm2.6748.38±3.5048.38 \pm3.5076.89±0.7976.89 \pm0.7949.76±5.8949.76 \pm5.8941.51±6.7141.51 \pm6.7162.65±2.1062.65 \pm2.1044.23±5.9744.23 \pm5.9782.40±2.0882.40 \pm2.08
RH-BrainFS57.14±2.0557.14 \pm2.0550.24±1.5150.24 \pm1.5161.30±1.6861.30 \pm1.6842.52±1.4742.52 \pm1.4773.83±1.1673.83 \pm1.1647.62±6.7047.62 \pm6.7048.33±7.5748.33 \pm7.5766.48±6.1066.48 \pm6.1040.00±6.4640.00 \pm6.4666.67±9.1466.67 \pm9.14
MMP-GCN63.22±2.6463.22 \pm2.6455.48±2.2155.48 \pm2.2170.48±2.1870.48 \pm2.1853.27±1.7453.27 \pm1.7475.79±2.1675.79 \pm2.1641.03±6.4741.03 \pm6.4736.36±2.3436.36 \pm2.3460.09±7.8560.09 \pm7.8536.39±4.8336.39 \pm4.8379.51±1.9579.51 \pm1.95
Cross-GNN64.24±1.3764.24 \pm1.3745.49±0.9445.49 \pm0.9477.53±0.5377.53 \pm0.5342.77±0.7942.77 \pm0.7980.10±0.8480.10 \pm0.8440.63±2.3440.63 \pm2.3428.79±2.1628.79 \pm2.1664.12±3.1564.12 \pm3.1531.11±3.1731.11 \pm3.1779.36±1.3479.36 \pm1.34
MCGAN60.96±3.4260.96 \pm3.4257.44±5.2457.44 \pm5.2471.29±3.3171.29 \pm3.3150.15±8.6450.15 \pm8.6479.37±2.2379.37 \pm2.2357.56±4.2057.56 \pm4.2047.41±2.6347.41 \pm2.6369.98±5.0669.98 \pm5.0650.78±2.9250.78 \pm2.9285.23±1.1585.23 \pm1.15
GCA69.34±3.9869.34 \pm3.9859.21±4.8059.21 \pm4.8085.25±6.4185.25 \pm6.4156.83±3.8456.83 \pm3.8481.32±2.5381.32 \pm2.5352.03±8.5752.03 \pm8.5748.12±7.0548.12 \pm7.0574.75±1.1674.75 \pm1.1648.48±7.5048.48 \pm7.5083.65±2.8383.65 \pm2.83
smBGC (ours)96.47±2.3296.47 \pm2.3296.18±2.5396.18 \pm2.5399.06±0.6299.06 \pm0.6295.45±2.6095.45 \pm2.6097.89±1.3897.89 \pm1.3881.71±1.2281.71 \pm1.2279.02±0.5679.02 \pm0.5696.14±0.4396.14 \pm0.4364.97±2.2764.97 \pm2.2796.24±0.5396.24 \pm0.53

Table III. Performance comparison of different methods on the ADNI-3 dataset (%). The best results are highlighted in bold and the second-best results are underlined.

MethodACCF1AUCSENSPE
GCN51.92±3.5751.92 \pm3.5749.55±3.1949.55 \pm3.1966.26±4.9166.26 \pm4.9150.34±2.2350.34 \pm2.2374.66±0.6674.66 \pm0.66
GAT50.58±5.6650.58 \pm5.6646.22±1.6846.22 \pm1.6860.32±3.0860.32 \pm3.0848.00±1.6248.00 \pm1.6273.20±5.5673.20 \pm5.56
GIN50.52±5.1050.52 \pm5.1049.24±4.2349.24 \pm4.2368.13±3.9468.13 \pm3.9449.83±4.4249.83 \pm4.4274.25±2.4374.25 \pm2.43
GraphSAGE55.04±2.6755.04 \pm2.6752.46±5.2052.46 \pm5.2066.91±5.7766.91 \pm5.7753.22±4.3553.22 \pm4.3576.19±1.2976.19 \pm1.29
BrainGB48.10±5.3948.10 \pm5.3942.80±4.2642.80 \pm4.2660.82±5.6260.82 \pm5.6245.51±2.9945.51 \pm2.9972.29±1.7572.29 \pm1.75
MAHGCN43.59±6.8243.59 \pm6.8230.78±8.3030.78 \pm8.3068.21±8.4668.21 \pm8.4639.55±4.1539.55 \pm4.1569.74±1.9569.74 \pm1.95
BrainIB52.54±2.5652.54 \pm2.5647.47±4.7547.47 \pm4.7559.27±4.1059.27 \pm4.1051.09±3.2351.09 \pm3.2374.88±1.4574.88 \pm1.45
RH-BrainFS58.38±1.5858.38 \pm1.5854.88±2.1154.88 \pm2.1167.30±2.9267.30 \pm2.9247.03±1.0847.03 \pm1.0878.62±0.6578.62 \pm0.65
MMP-GCN60.06±2.4760.06 \pm2.4755.03±3.5855.03 \pm3.5864.61±3.7764.61 \pm3.7755.95±5.8155.95 \pm5.8179.55±1.8179.55 \pm1.81
Cross-GNN56.60±1.8956.60 \pm1.8948.25±1.5148.25 \pm1.5170.14±3.3770.14 \pm3.3749.64±1.3549.64 \pm1.3579.64±1.3279.64 \pm1.32
MCGAN66.41±5.4166.41 \pm5.4164.30±5.6864.30 \pm5.6870.12±3.7870.12 \pm3.7862.38±5.5162.38 \pm5.5184.75±3.4584.75 \pm3.45
GCA65.89±6.4365.89 \pm6.4361.75±5.8961.75 \pm5.8980.39±6.1080.39 \pm6.1061.64±7.9161.64 \pm7.9181.24±3.9781.24 \pm3.97
smBGC (ours)91.15±3.1991.15 \pm3.1991.24±3.1391.24 \pm3.1396.27±0.9196.27 \pm0.9191.77±4.3391.77 \pm4.3395.61±3.5295.61 \pm3.52

Table IV. Performance comparison of different methods on the PPMI dataset (%).

incorporates multimodal data into a contrastive framework for graph augmentation, outperforming all baseline methods across tasks. This demonstrates that contrastive frameworks are also effective for learning multimodal data, and that the graph augmentation module significantly contributes to performance improvements by mitigating noise and enhancing graph attributes. Our method fully leverages complementary information across modalities and considers stage-specific brain dysfunction characteristics. By addressing these factors, we develop a solution that significantly enhances stage classification performance, achieving substantial performance improvements.

Visualization

To demonstrate the performance of various methods, we conduct visualization experiments on the ADNI-3 dataset. Specifically, we use the graph-level embeddings from the final layer of each method for t-SNE visualization. As shown in Figure 4, the distribution of Graph-

t-SNE visualizations of GraphSAGE, GCN, GAT, and smBGC on the ADNI-3 dataset with four stages

Figure 4. The t-SNE visualizations of different methods on the ADNI-3 dataset with four stages.

SAGE is sparse and fails to effectively separate the four classes of samples. GAT and GCN partially concentrate certain categories into clusters, but these clusters lack well-defined boundaries and exhibit significant overlap. In contrast, our method not only achieves clear clustering but also minimizes confusion at cluster boundaries, with only a small number of misclassified samples.

Statistical Significance

To evaluate the robustness of smBGC across different data partitions, we report its fold-level performance and the corresponding 95% confidence intervals in Table V. The results show that smBGC achieves stable and strong performance across the five cross-validation folds. Specifically, smBGC achieves an average ACC of 81.71%, an F1 score of 79.02%, an AUC of 96.14%, a sensitivity of 64.97%, and a specificity of 96.24%. The relatively narrow confidence intervals for ACC, F1, AUC, and specificity indicate that the performance of smBGC is stable across different data partitions. We further conducted two-sided paired tt-tests between smBGC and MHGF using the results obtained from the same five cross-validation folds. As reported in Table VI, smBGC achieves mean improvements of 24.15, 31.61, 26.16, 14.19, and 11.01 percentage points in ACC, F1, AUC, sensitivity, and specificity, respectively. The 95% confidence intervals of all paired differences are entirely above zero, indicating consistent improvements across the five folds. Moreover, all differences remain statistically significant after applying Holm correction for multiple comparisons (all adjusted pp-values <0.001<0.001).

MetricFold 1Fold 2Fold 3Fold 4Fold 5Mean ±\pm Std.95% CI
ACC80.1282.6882.9082.1180.7481.71±1.2281.71 \pm1.22[80.19, 83.23]
F178.4379.1279.7879.2578.5279.02±0.5679.02 \pm0.56[78.33, 79.71]
AUC96.5596.2895.7396.5195.6396.14±0.4396.14 \pm0.43[95.60, 96.68]
SEN62.4267.2163.8567.5463.8364.97±2.2764.97 \pm2.27[62.15, 67.79]
SPE96.7295.8196.6595.5496.4896.24±0.5396.24 \pm0.53[95.58, 96.90]

Table V. Fold-level performance of smBGC on the four-stage classification task of the ADNI-3 dataset (%).

MetricsmBGC (%)MHGF (%)Improvement95% CIt(4)t(4)Adjusted pp
ACC81.7157.5624.15[20.71, 27.59]19.47<0.001< 0.001
F179.0247.4131.61[27.84, 35.37]23.29<0.001< 0.001
AUC96.1469.9826.16[19.65, 32.67]11.16<0.001< 0.001
SEN64.9750.7814.19[11.50, 16.87]14.65<0.001< 0.001
SPE96.2485.2311.01[9.75, 12.28]24.22<0.001< 0.001

Table VI. Two-sided paired t-tests results comparing smBGC with MHGF on the ADNI-3 four-stage classification task.

Ablation Study

In this subsection, we examine the impact of the selected modalities and different modules on the model’s performance.

Analysis of Different Modules

We employ two modules to obtain stage-specific brain graph features: CFD and graph augmentation based on the results of SFE (ASFE). We validate the effectiveness of both modules. We conduct ablation experiments on the PPMI dataset by removing these modules. As shown in Table VII, a comparison of the first three rows reveals that both the CFD and ASFE modules have a positive impact on our model’s performance. Specifically, the comparison between the results of w/o CFD and w/o ASFE highlights the crucial role of the stage-adaptive brain graph augmentation approach in enhancing the model performance. Overall, the results demonstrate the superiority of our model in extracting distinct patterns across neurodegenerative disorder stages. Furthermore, these two modules are compatible and complementary. By integrating both modules, our smBGC achieves the best performance.

MethodsNC vs. Prodromal vs. PD
ACCF1AUCSENSPE
w/o CFD & ASFE41.73 ± 5.2636.97 ± 5.8756.50 ± 4.0839.53 ± 3.8569.09 ± 5.43
w/o ASFE57.44 ± 5.2950.15 ± 1.5970.94 ± 6.7652.24 ± 5.6380.88 ± 2.94
w/o CFD83.24 ± 2.2978.28 ± 3.6197.47 ± 1.1982.96 ± 2.6491.73 ± 5.91
smBGC (ours)91.15 ± 3.1991.24 ± 3.1396.27 ± 0.9191.77 ± 4.3395.61 ± 3.52

Table VII. Results of smBGC variants w/o each proposed component on the PPMI dataset.

Analysis of Different Modalities

We evaluate the model performance when different modalities are utilized for enhancement. Specifically, in both steps of the stage-aware feature enhancement strategy, it is necessary to compute the feature scoring matrix: the common scoring matrix ScS_c for the first step and the stage scoring matrix FkF_k for the second step. Since fMRI and DTI data are collected for each subject, the scoring matrix SS can be computed for each modality, resulting in FkfF_k^f for the functional modality and FksF_k^s for the structural modality. Four possible combinations for the two steps are: f+ff+f, f+sf+s, s+ss+s, and s+fs+f (where ff represents the functional modality and ss represents the structural modality). Figure 5 illustrates the accuracy results for classification tasks under different combinations. It can be observed that all combinations can improve model performance. However, the performance of single-modality combinations is consistently lower than that of multimodal combinations. This demonstrates that the complementary information between modalities plays a significant role in the enhancement strategy.

Experimental results under different modal choices for ADNI-3 and PPMI

Figure 5. Experimental results under different modal choices.

Parameters Analysis

The Magnitude of Feature Enhancement

We perform a parameter analysis of the key hyperparameters in smBGC, specifically the hyperparameters αf\alpha_f and αs\alpha_s, which determine the augmentation strength for structural and functional views, respectively, during graph augmentation. By varying these parameters from 0.2 to 0.7, we evaluate the model performance on the three-stage classification task using ADNI-3 and PPMI datasets. The results are shown in Figure 6. It can be observed that the classification accuracy remains relatively stable when the parameter values are changed. This indicates that, overall, our model is robust to parameter perturbations, demonstrating its insensitivity to these hyperparameters. However, when the parameter values are set too small, noise features within the brain graphs remain significant, and the stage-specific characteristics of brain disorders are not fully revealed. In such cases, the model struggles to extract meaningful information from the graph representations.

Classification accuracy of smBGC with varied different hyperparameters on ADNI-3 and PPMI

Figure 6. The classification accuracy of smBGC with varied different hyperparameters on (a) ADNI-3 with three stages and (b) PPMI datasets.

Neuron Number in Hidden Layer

We investigate the impact of the number of neurons in the hidden layer on the performance of smBGC. Specifically, we conduct experiments with varying hidden layer sizes. As is shown in Figure 7, the results reveal a clear trend: as the number of neurons in the hidden layer increases, the overall performance across the three tasks improves. Notably, smBGC achieves its best performance when the hidden layer is configured with 128 neurons. This observation highlights two key aspects. First, it underscores the model’s stability under different neuron configurations, demonstrating its robustness in handling varying setups. Second, it suggests that the choice of hidden layer size plays an important role in maximizing the model’s potential for learning meaningful representations.

Accuracy, F1-score, and AUC values of the proposed model under different neuron numbers over three datasets.

Figure 7. Accuracy, F1-score, and AUC values of the proposed model under different neuron numbers over three datasets.

Conclusion

This paper has presented a novel Stage-aware Multimodal Brain Graph Contrastive Learning (smBGC) method, which effectively distinguishes different stages of neurodegenerative disorders by exploring distinct brain patterns within each stage. In particular, the proposed method utilizes a stage-aware feature enhancement strategy, removing noise features and distilling stage-specific features to achieve precise targeting of different stages of disorder. smBGC explores the stage-specific characteristics of the progression of neurodegenerative disorders and provides deep insight into pathological mechanisms. It shows great potential to predict the progression trajectory of neurodegenerative disorders, which is crucial for early intervention and treatment planning. Extensive experimental results on two real-world datasets, i.e., ADNI-3 and PPMI, have demonstrated that smBGC outperforms state-of-the-art methods on Alzheimer’s disease detection and Parkinson’s disease detection.

References

  1. [1]N. Chedid, J. Tabbal, A. Kabbara, S. Allouch, and M. Hassan, “The development of an automated machine learning pipeline for the detection of alzheimer’s disease,” Scientific Reports, vol. 12, no. 1, p. 18137, 2022.DOI
  2. [2]J. Chaki and M. Woźniak, “Deep learning for neurodegenerative disorder (2016 to 2022): A systematic review,” Biomedical Signal Processing and Control, vol. 80, p. 104223, 2023.DOI
  3. [3]J. Rasmussen and H. Langerman, “Alzheimer’s disease–why we need early diagnosis,” Degenerative Neurological and Neuromuscular Disease, pp. 123–130, 2019.DOI
  4. [4]A. Bhandarkar, P. Naik, K. Vakkund, S. Junnappanavar, S. Bakare, and S. Pattar, “Deep learning based computer aided diagnosis of alzheimer’s disease: a snapshot of last 5 years, gaps, and future directions,” Artificial Intelligence Review, vol. 57, no. 2, p. 30, 2024.DOI
  5. [5]C. Li, P. Li, Y. Zhang, N. Li, Y. Si, F. Li, Z. Cao, H. Chen, B. Chen, D. Yao, and P. Xu, “Effective emotion recognition by learning discriminative graph topologies in eeg brain networks,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 8, pp. 10 258–10 272, 2024.DOI
  6. [6]Q. Gao, N. Luo, M. Liang, W. Zhou, Y. Li, R. Li, X. Hu, T. Zou, X. Wang, J. Yu, J. Leng, and H. Chen, “A stepwise multivariate granger causality method for constructing hierarchical directed brain functional network,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 4, pp. 4974–4984, 2024.
  7. [7]H. Cui, W. Dai, Y. Zhu, X. Kan, A. C. Gu, J. Lukemire, L. Zhan, L. He, Y. Guo, and C. Yang, “Brainbg: a benchmark for brain network analysis with graph neural networks,” IEEE Transactions on Medical Imaging, vol. 42, no. 2, pp. 493–506, 2022.DOI
  8. [8]J. Zimmermann, J. D. Griffiths, and A. R. McIntosh, “Unique mapping of structural and functional connectivity on cognition,” Journal of Neuroscience, vol. 38, no. 45, pp. 9658–9667, 2018.DOI
  9. [9]I. Bazarbekov, A. Razaque, M. Ipalakova, J. Yoo, S. Assipova, and A. Almisreb, “A review of artificial intelligence methods for alzheimer’s disease diagnosis: Insights from neuroimaging to sensor data analysis,” Biomedical Signal Processing and Control, vol. 92, p. 106023, 2024.
  10. [10]Z. Dai, Q. Lin, T. Li, X. Wang, H. Yuan, X. Yu, Y. He, and H. Wang, “Disrupted structural and functional brain networks in alzheimer’s disease,” Neurobiology of Aging, vol. 75, pp. 71–82, 2019.DOI
  11. [11]C. Peng, E. He, and F. Xia, “Learning on multimodal graphs,” IEEE Intelligent Systems, vol. 41, no. 2, pp. 80–91, 2026.DOI
  12. [12]J. Li, R. Zheng, H. Feng, M. Li, and X. Zhuang, “Permutation equivariant graph framelets for heterophilous graph learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 9, pp. 11 634–11 648, 2024.DOI
  13. [13]Y. Zhu, H. Cui, L. He, L. Sun, and C. Yang, “Joint embedding of structural and functional brain networks with graph neural networks for mental illness diagnosis,” in 2022 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC). IEEE, 2022, pp. 272–276.DOI
  14. [14]Y. Yang, C. Ye, X. Guo, T. Wu, Y. Xiang, and T. Ma, “Mapping multimodal brain connectome for brain diagnosis via cross-modal mutual learning,” IEEE Transactions on Medical Imaging, 2024.DOI
  15. [15]H. Ye, Y. Zheng, Y. Li, K. Zhang, Y. Kong, and Y. Yuan, “Rh-brainfs: regional heterogeneous multimodal brain networks fusion strategy,” Advances in Neural Information Processing Systems, vol. 36, 2024.DOI
  16. [16]J. Ren, F. Xia, I. Lee, A. Noori Hoshyar, and C. Aggarwal, “Graph learning for anomaly analytics: Algorithms, applications, and challenges,” ACM Transactions on Intelligent Systems and Technology, vol. 14, no. 2, Feb. 2023.arxiv.org/abs/2212.05532
  17. [17]H. Cho, J. Sim, G. Wu, and C. Park, “Neurodegenerative brain network classification via adaptive diffusion with temporal regularization,” in Proceedings of the 41st International Conference on Machine Learning (ICML), ser. Proceedings of Machine Learning Research, vol. 235. Vienna, Austria: PMLR, 2024, pp. 8593–8608.
  18. [18]X. Li, Y. Zhou, N. Dvornek, M. Zhang, S. Gao, J. Zhuang, D. Scheinost, L. H. Staib, P. Ventola, and J. S. Duncan, “Brainnn: Interpretable brain graph neural network for fmri analysis,” Medical Image Analysis, vol. 74, p. 102233, 2021.DOI
  19. [19]X. Song, F. Zhou, A. H. Frangi, J. Cao, X. Xiao, Y. Lei, T. Wang, and B. Lei, “Multicenter and multichannel pooling gcn for early ad diagnosis based on dual-modality fused brain network,” IEEE Transactions on Medical Imaging, vol. 42, no. 2, pp. 354–367, 2022.DOI
  20. [20]H. Zhang, R. Song, L. Wang, L. Zhang, D. Wang, C. Wang, and W. Zhang, “Classification of brain disorders in rs-fmri via local-to-global graph neural networks,” IEEE Transactions on Medical Imaging, vol. 42, no. 2, pp. 444–455, 2022.DOI
  21. [21]C. Peng, M. Liu, C. Meng, S. Yu, and F. Xia, “Adaptive brain network augmentation based on group-aware graph learning,” in The Second Tiny Papers Track at ICLR, 2024.
  22. [22]C. Bian, N. Xia, A. Xie, S. Cong, and Q. Dong, “Adversarially trained persistent homology based graph convolutional network for disease identification using brain connectivity,” IEEE Transactions on Medical Imaging, 2023.DOI
  23. [23]Y. Ma, W. Cui, J. Liu, Y. Guo, H. Chen, and Y. Li, “A multi-graph cross-attention-based region-aware feature fusion network using multi-template for brain disorder diagnosis,” IEEE Transactions on Medical Imaging, vol. 43, no. 3, pp. 1045–1059, 2024.DOI
  24. [24]H. Cai, X. Sheng, G. Wu, B. Hu, Y.-M. Cheung, and J. Chen, “Brain network classification for accurate detection of alzheimer’s disease via manifold harmonic discriminant analysis,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 12, pp. 17 266–17 280, 2024.DOI
  25. [25]C. Peng, M. Liu, C. Meng, S. Xue, K. Keogh, and F. Xia, “Stage-aware brain graph learning for alzheimer’s disease,” in IEEE Conference on Artificial Intelligence, 2024.DOI
  26. [26]Y. Hu, J. Wang, H. Zhu, J. Li, and J. Shi, “Cost-sensitive weighted contrastive learning based on graph convolutional networks for imbalanced alzheimer’s disease staging,” IEEE Transactions on Medical Imaging, 2024.DOI
  27. [27]M. Li, A. Micheli, Y. G. Wang, S. Pan, P. Liό, G. S. Gnecco, and M. Sanguineti, “Guest editorial: Deep neural networks for graphs: Theory, models, algorithms, and applications,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 4, pp. 4367–4372, 2024.DOI
  28. [28]S. Yu, S. Jin, M. Li, T. Sarwar, and F. Xia, “Long-range brain graph transformer,” Advances in Neural Information Processing Systems, 2025.arxiv.org/abs/2501.01100
  29. [29]S. Parisot, S. K. T. Kena, E. Ferrante, M. Lee, R. G. Moreno, B. Glocker, and D. Rueckert, “Spectral graph convolutions for population-based disease prediction,” in Medical Image Computing and Computer Assisted Intervention- MICCAI, Quebec City, QC, Canada, Part III 20. Springer, 2017, pp. 177–185.arxiv.org/abs/1703.03020
  30. [30]Y. Ma, Q. Wang, L. Cao, L. Li, C. Zhang, L. Qiao, and M. Liu, “Multi-scale dynamic graph learning for brain disorder detection with functional mri,” IEEE Transactions on Neural Systems and Rehabilitation Engineering, vol. 31, pp. 3501–3512, 2023.DOI
  31. [31]M. Liu, H. Zhang, F. Shi, and D. Shen, “Hierarchical graph convolutional network built by multiscale atlases for brain disorder diagnosis using functional connectivity,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 11, pp. 15 182–15 194, 2024.DOI
  32. [32]J. Xu, Q. Bian, X. Li, A. Zhang, Y. Ke, M. Qiao, Z. Wang, W. Khang Jeremy Sim, and B. Gulyás, “Contrastive graph pooling for explainable classification of brain networks,” IEEE Transactions on Medical Imaging, vol. 43, no. 9, pp. 3292–3305, 2024.DOI
  33. [33]H. Tang, G. Ma, L. Guo, X. Fu, H. Huang, and L. Zhan, “Contrastive brain network learning via hierarchical signed graph pooling model,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 6, pp. 7363–7375, 2024.
  34. [34]X. Han, R. Xue, J. Feng, Y. Feng, S. Du, J. Shi, and Y. Gao, “Hypergraph foundation model for brain disease diagnosis,” IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 10, pp. 17 702–17 716, 2025.DOI
  35. [35]W. Cui, Y. Leng, Y. Peng, C. Bai, L. Li, X. Jiang, G. Yuan, and J. Zheng, “A novel dynamic neural network for heterogeneity-aware structural brain network exploration and alzheimer’s disease diagnosis,” IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 9, pp. 15 764–15 778, 2025.DOI
  36. [36]J. Ren, M. Hou, Z. Liu, and X. Bai, “Eagle: Contrastive learning for efficient graph anomaly detection,” IEEE Intelligent Systems, vol. 38, no. 2, pp. 55–63, 2023.DOI
  37. [37]Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Graph contrastive learning with adaptive augmentation,” in Proceedings of the Web conference 2021, 2021, pp. 2069–2080.DOI
  38. [38]X. Zhang, Q. Tan, X. Huang, and B. Li, “Graph contrastive learning with personalized augmentation,” IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 11, pp. 6305–6316, 2024.arxiv.org/abs/2209.06560
  39. [39]J. Chen and G. Kou, “Attribute and structure preserving graph contrastive learning,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 6, 2023, pp. 7024–7032.
  40. [40]X. Peng, J. Cheng, X. Tang, J. Liu, and J. Wu, “Dual contrastive learning network for graph clustering,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 8, pp. 10 846–10 856, 2024.DOI
  41. [41]F.-Y. Sun, J. Hoffman, V. Verma, and J. Tang, “Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,” in International Conference on Learning Representations, 2020.arxiv.org/abs/1908.01000
  42. [42]H. Zhao, X. Yang, K. Wei, C. Deng, and D. Tao, “Unsupervised graph transformer with augmentation-free contrastive learning,” IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 11, pp. 7296–7307, 2024.DOI
  43. [43]R. D. Hjelm, A. Fedoro, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” in 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.
  44. [44]Y. Wang, X. Wang, X. Huang, Y. Yu, H. Li, M. Zhang, Z. Guo, and W. Wu, “Intent-aware recommendation via disentangled graph contrastive learning,” in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, ser. IJCAI ’23, 2023.DOI
  45. [45]Y. Jiang, C. Huang, and L. Huang, “Adaptive graph contrastive learning for recommendation,” in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ser. KDD ’23. New York, NY, USA: Association for Computing Machinery, 2023, p. 4252–4261.arxiv.org/abs/2305.10837
  46. [46]W. Zhuo and G. Tan, “Graph contrastive learning with adaptive proximity-based graph augmentation,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 10, pp. 14 301–14 314, 2024.DOI
  47. [47]H. Li, J. Cao, J. Zhu, Q. Luo, S. He, and X. Wang, “Augmentation-free graph contrastive learning of invariant-discriminative representations,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 8, pp. 11 157–11 167, 2024.DOI
  48. [48]J. Liu, W. Cui, Y. Chen, Y. Ma, Q. Dong, R. Cai, Y. Li, and B. Hu, “Deep fusion of multi-template using spatio-temporal weighted multi-hypergraph convolutional networks for brain disease analysis,” IEEE Transactions on Medical Imaging, vol. 43, no. 2, pp. 860–873, 2024.DOI
  49. [49]C. R. Jack Jr, M. A. Bernstein, N. C. Fox, P. Thompson, G. Alexander, D. Harvey, B. Borowski, P. J. Britson, J. L. Whitwell, C. Ward et al., “The alzheimer’s disease neuroimaging initiative (adni): Mri methods,” Journal of Magnetic Resonance Imaging: An Official Journal of the International Society for Magnetic Resonance in Medicine, vol. 27, no. 4, pp. 685–691, 2008.
  50. [50]K. Marek, S. Chowdhury, A. Siderowf, S. Lasch, C. S. Coffey, C. Caspell-Garcia, T. Simuni, D. Jennings, C. M. Tanner, J. Q. Tro-janowski et al., “The parkinson’s progression markers initiative (ppmi)—establishing a pd biomarker cohort,” Annals of clinical and translational neurology, vol. 5, no. 12, pp. 1460–1477, 2018.DOI
  51. [51]J. Wang, X. Wang, M. Xia, X. Liao, A. Evans, and Y. He, “Gretna: a graph theoretical network analysis toolbox for imaging connectomics,” Frontiers in Human Neuroscience, vol. 9, p. 386, 2015.DOI
  52. [52]Z. Cui, S. Zhong, P. Xu, Y. He, and G. Gong, “Panda: a pipeline toolbox for analyzing brain diffusion images,” Frontiers in Human Neuroscience, vol. 7, p. 42, 2013.DOI
  53. [53]T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations, 2017.arxiv.org/abs/1609.02907
  54. [54]P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net, 2018.arxiv.org/abs/1710.10903
  55. [55]W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, 2017, pp. 1024–1034.arxiv.org/abs/1706.02216
  56. [56]K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.arxiv.org/abs/1810.00826
  57. [57]K. Zheng, S. Yu, B. Li, R. Jenssen, and B. Chen, “Brainib: Interpretable brain network-based psychiatric diagnosis with graph information bottleneck,” IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 7, pp. 13 066–13 079, 2025.DOI
  58. [58]R. Liu, Z.-A. Huang, Y. Hu, Z. Zhu, K.-C. Wong, and K. C. Tan, “Attention-like multimodality fusion with data augmentation for diagnosis of mental disorders using mri,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 6, pp. 7627–7641, 2024.

Paper details

vlnc:W_pqnswzqu
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents