betaFeedback

WorksComputer Science

Bias, Measurement Error, and Double-Dipping: When Can GNN Convolutions Help Brain Connectome Prediction?

Abstract

Graph Neural Networks (GNNs) are an important tool for fMRI prediction, where empirical functional connectivity matrices serve both as features and for graph construction. However, recent studies and our own experiments show that these methods often fail to outperform simpler graph-agnostic baselines. We propose a statistical explanation for this failure by formulating connectome prediction as an errors-in-variables (EIV) problem: the true connectome is latent, while the observed covariance matrix is a noisy finite-time-series estimate. In a linear asymptotic setting, we decompose the effect of graph convolution into three mechanisms: smoothing-induced bias and variance reduction, graph estimation error, and a double-dipping effect arising when the same noisy matrix determines both graph and features. Under a latent community model adapted to neuroscience, we identify a narrow favorable regime, set by the brain community structure, the predictive signal, the graph construction and the recording length, in which message passing can improve prediction. Simulations validate this decomposition, while real-data experiments illustrate that connectome GNN pipelines often fall outside this regime. Our results provide a first step towards explaining when graph convolutions can help brain connectome prediction, and why they often do not.

Introduction

Functional brain network analysis has emerged as an important approach both for diagnosing neurological disorders and for predicting cognitive characteristics. In this setting, the data typically consist of functional magnetic resonance imaging (fMRI) recordings, captured as time-series matrices Zi∈RT×pZ_i \in\mathbb{R}^{T \times p}; each matrix tracks how brain activity unfolds over TT time points across pp predefined regions of interest (ROIs) for a given patient. In this context, the primary research question typically concerns how interactions among brain regions, often measured as covariances or correlations between ROIs and often referred to as “the connectome”, relate to a subject-specific outcome, represented by yiy_i. This framework corresponds to positing an underlying model f⋆f^\star that links the connectome to the outcome: f⋆:Σ(i)→yif^\star: \Sigma^{(i)} \to y_i.

Since brain functions are hypothesized to stem from a complex network of interconnected regions [1], graph-based methods are increasingly adopted for modeling the brain connectome. Following the success of GNNs in other applications, algorithms based on GNN message-passing schemes have become prevalent in the field [2, 3], frequently serving as the backbone of state-of-the-art pipelines with an increasing range of variants created and customized for neuroscience applications.

Despite the popularity of graph-based methods, a growing body of evidence suggests that message passing does not actually help in analyzing the human brain connectome. In Figure 1, we show that the performance of standard GNNs (GraphSAGE [4], GCN [5] and GAT [6]) and a popular brain connectomics graph methodology (Residual GNN [3]) does not improve upon simpler (graph-agnostic) methods on three real-world datasets. This echoes the findings of [7], who benchmarked graph deep learning models on large-scale functional connectome datasets and found that their message aggregation brings no gain over graph-agnostic baselines; we refer to their work for an exhaustive empirical demonstration of the problem. Similarly, [8] showed that basic classifiers using functional connectivity matrices consistently outperform message passing architectures. Finally, [9] showed that the message aggregation mechanisms characteristic of GNNs often have a detrimental effect on prediction performance from functional brain networks. From the broader GNNs landscape, the literature has focused on understanding the pitfalls of message passing in node-level tasks such as semi-supervised classification, with particular emphasis on the oversmoothing phenomenon [10, 11, 12, 13]. However, these critiques are either predominantly empirical or in a non-applicable setting; hence our main question of interest:

Figure 1. Performance across regression and classification tasks on 3 datasets. Graph-based methods fail to outperform graph-agnostic baselines, both linear (Linear Model) and non-linear (Random Forest, SVM, MLP). Mean ±\pm 1 SD over 10 seeds. See Appendix § 11 for details.

Why do graph message passing algorithms fail in brain connectome analysis?

To answer this question, we study the traditional brain connectomics pipeline (Figure 2) as a statistical estimation problem. The true connectome of each subject is latent, and we only observe an empirical connectivity matrix estimated from a finite recording, so the analysis is naturally framed as an errors-in-variables (EIV) problem. The empirical connectivity matrix, either the sample covariance Σ^\widehat{\Sigma} or the sample correlation C^\widehat{C}, is used twice: as the node features and as the basis for the graph A^=f(Σ^)\widehat{A} = f(\widehat{\Sigma}) or A^=f(C^)\widehat{A} = f(\widehat{C}).

Figure 2. Brain connectome GNN pipeline and statistical challenges. Top: the standard analytical pipeline, from ROI time series to prediction y^i\hat{y}_i. Bottom: statistical challenges induced by the pipeline. The errors-in-variables component (red) is analyzed in this paper; the remaining challenges (gray, dashed) are left to future work.

Main contributions. Our contributions are summarized as follows:

  • An EIV formulation that allows untangling different effects. Under an errors-in-variables formulation, we show in Section 3 that the effect of graph convolution on the predictive performance of the method splits into three parts: (i) a graph smoothing effect that induces a bias-variance tradeoff even with a correctly specified (oracle) graph; (ii) the graph estimation error, which is the cost of smoothing over a wrongly estimated graph; and (iii) a double-dipping effect that couples the graph operator with the feature noise when both come from the same sample.

  • When convolution helps. The balance of these three effects, and hence whether graph convolution improves on the raw features, depends on three ingredients: the community structure of the

connectome, which describes how sharply ROIs group into communities; the predictive signal, which describes how the target aligns with these communities; and the threshold, which determines which connections become edges of the graph. We make all three explicit through a latent community model, building on the standard neuroscience assumption that ROIs belong to a small number of communities (§ 4). Under this model, convolution improves on the raw features only when its noise reduction outweighs the signal it distorts, which restricts the gains to short recordings. Simulations, where the true connectome is known, validate the theory (§ 5).

  • Practical relevance for real data. On fMRI data, we build proxies for the oracle and independent graphs to separate the three effects in practice, and we show how the theory can guide the choice of graph, threshold and window length (§ 6, Appendix § 11.§ 4).

Related literature

Graph neural networks for brain connectomes. The brain connectome is commonly modeled as a network of interconnected regions [1] whose activity is driven by a small number of latent components [14, 15, 16]. Message passing with GCN, GraphSAGE or GAT convolutions [5, 4, 6] underlies most connectome-specific models [17, 18, 19, 20] and the standard benchmarks [2, 3]. In these pipelines the graph is obtained by thresholding the same empirical connectivity matrix that serves as the node features.

Evidence against message passing. Graph-agnostic classifiers on the connectivity matrix match or outperform GNNs and graph transformers [8, 7]. On the NeuroGraph benchmarks, accuracy is unchanged when edges are randomly removed, even when all of them are removed [9]. None of these studies explains the failure.

Theory of message passing. Analyses of message passing [21] have focused on node-level tasks. Once linearized, convolutions act as low-pass filters [22, 23]. This explains why models without nonlinearities retain most of their accuracy [22, 24], while repeated aggregation leads to oversmoothing [10, 13]. Closest to our setting, Keriven [11] shows on a latent-space random graph that a finite number of mean-aggregation steps improves node-level regression before oversmoothing sets in. Our setting differs in two ways: the task is graph-level, and the graph is estimated from the same noisy data as the features.

Measurement error and double dipping. Predicting from a noisy estimate of the connectome is an errors-in-variables problem. § 3 reviews the corrections for covariate measurement error and explains why they do not apply here. In the standard pipeline the same window also selects the edges, which we call double dipping, and we quantify its effect for graph convolutions.

Statistical framework

For each subject i=1,…,ni = 1,\ldots,n, let Z(i)∈RT×pZ^{(i)} \in\mathbb{R}^{T \times p} denote the centered fMRI time series measured at pp regions of interest (ROIs) over TT time points. To keep the analysis simple, we assume independent time-points Zt(i)∼i.i.d.N(0,Σ(i))Z_t^{(i)} \overset{\mathrm{i.i.d.}}{\sim} \mathcal{N}(0,\Sigma^{(i)}), t=1,…,Tt = 1,\ldots,T, where Σ(i)∈Rp×p\Sigma^{(i)} \in\mathbb{R}^{p \times p} is the subject’s latent functional connectome. The connectome is not observed directly. Instead, we observe the empirical covariance

Σ^(i)=1T∑t=1TZt(i)Zt(i)T=Σ(i)+H(i),(1)\widehat{\Sigma}^{(i)} = \frac{1}{T}\sum_{t=1}^{T} Z_t^{(i)} Z_t^{(i)\mathsf{T}} = \Sigma^{(i)} + H^{(i)}, \tag*{(1)}

where H(i)H^{(i)} is the finite-sample estimation error. For simplicity, we focus on the sample covariance Σ^(i)\widehat{\Sigma}^{(i)} throughout the theoretical analysis; extensions to the sample correlation matrix C^(i)\widehat{C}^{(i)}, which is the more common choice in fMRI pipelines, are analyzed computationally in Appendix § 10 and behave analogously. We study a simple supervised regression problem in which the patient-level target yiy_i depends on the latent connectome through some (potentially non-linear) function f∗f^*:

yi=f∗(Σ(i))+ϵi,ϵi∼N(0,σϵ2).(2)y_i = f^*\left(\Sigma^{(i)}\right) + \epsilon_i,\qquad\epsilon_i \sim\mathcal{N}\left(0,\sigma_{\epsilon}^2\right). \tag*{(2)}

The purpose of brain connectomics analysis is thus to find the best approximation of f⋆f^\star within some function class F\mathcal{F}, typically parametrized by a vector of parameters θ\theta:

θ^∈argmin⁡fθ∈F1n∑i=1n∥yi−fθ(Σ(i))∥2.(3)\hat{\theta} \in\underset{f_\theta\in\mathcal{F}}{\operatorname{argmin}} \frac{1}{n}\sum_{i=1}^{n}\lVert y_i-f_\theta(\Sigma^{(i)})\rVert^2. \tag*{(3)}

An errors-in-variables regression problem. Since the true connectivity Σ(i)\Sigma^{(i)} is not observed, a simple solution is to use the estimated covariance matrix (also known as the plug-in estimator) Σ^(i)\hat{\Sigma}^{(i)} and solve Eq. (3). However, predicting yiy_i from Σ^(i)\hat{\Sigma}^{(i)} rather than Σ(i)\Sigma^{(i)} places us in an errors-in-variables regression setting. For simplicity, we restrict the function class to linear maps, F={fθ:x↦x⊤θ}\mathcal{F}=\{f_\theta:x\mapsto x^\top\theta\}, so that yi=vec⁡(Σ(i))⊤β⋆+ϵiy_i=\operatorname{vec}(\Sigma^{(i)})^\top\beta^\star+\epsilon_i. In this setting, the plug-in OLS estimator has a closed form. Write xi=vec⁡(Σ(i))x_i=\operatorname{vec}(\Sigma^{(i)}) for the true features, ηi=vec⁡(H(i))\eta_i=\operatorname{vec}(H^{(i)}) for the noise, and x^i=xi+ηi\hat{x}_i=x_i+\eta_i for the observed features. Under the Gaussian model above, the noise ηi\eta_i has conditional mean zero given Σ(i)\Sigma^{(i)} and its conditional covariance scales as T−1T^{-1}:

Eηi[ηi∣Σ(i)]=0,Cov⁡ηi(ηi∣Σ(i))=1TΨ(i),Ψ(i)=(Ip2+Kp,p)(Σ(i)⊗Σ(i)),(4)\mathbb{E}_{\eta_i}[\eta_i\mid\Sigma^{(i)}]=0,\qquad\operatorname{Cov}_{\eta_i}(\eta_i\mid\Sigma^{(i)})=\frac{1}{T}\Psi^{(i)},\qquad\Psi^{(i)}=(I_{p^2}+K_{p,p})(\Sigma^{(i)}\otimes\Sigma^{(i)}), \tag*{(4)}

where Kp,pK_{p,p} is the commutation matrix (Definition 1). Let S=EΣ[xx⊤]S=\mathbb{E}_{\Sigma}[xx^\top] and Γ=EΣ[Ψ]\Gamma=\mathbb{E}_{\Sigma}[\Psi], and write †\dagger for the Moore–Penrose pseudo-inverse. A classical errors-in-variables computation (Remark 1 in Appendix A.2) gives the population OLS coefficient βraw⋆(T)=Λ(T)β⋆\beta^\star_{\mathrm{raw}}(T)=\Lambda(T)\beta^\star, with Λ(T):=(S+1TΓ)†S\Lambda(T):=(S+\frac{1}{T}\Gamma)^\dagger S. Its test error is

MSE⁡raw(T)=β⋆⊤(I−Λ(T))⊤S(I−Λ(T))β⋆+1Tβ⋆⊤Λ(T)⊤ΓΛ(T)β⋆+σϵ2.(5)\operatorname{MSE}_{\mathrm{raw}}(T)=\beta^{\star\top}(I-\Lambda(T))^\top S(I-\Lambda(T))\beta^\star+\frac{1}{T}\beta^{\star\top}\Lambda(T)^\top\Gamma\Lambda(T)\beta^\star+\sigma_\epsilon^2. \tag*{(5)}

The first term is a bias: the noise pulls the coefficient away from β⋆\beta^\star. The second is tied to the variance: the noise in the features is carried into the prediction. Both terms depend on TT, not on nn, so it is important to note that more subjects do not remove the error; only longer recordings do. MSE⁡raw\operatorname{MSE}_{\mathrm{raw}} is the baseline we compare every graph against in the rest of the paper. A convolution is appealing because averaging neighboring entries of Σ^\hat{\Sigma} can reduce the noise term, but it can also distort the signal. The next sections quantify this trade-off.

A large literature has studied corrections for covariate measurement error, spanning corrected high-dimensional Lasso objectives [25, 26], score, likelihood, and deconvolution-based approaches for generalized and nonlinear models [27, 28, 29], and recent nonparametric or neural approaches [30]. None of these are directly applicable here: the measurement error in vec⁡(Σ^)\operatorname{vec}(\hat{\Sigma}) is not exogenous with fixed covariance but dense, entry-correlated, and dependent on the unobserved latent connectome (Eq. (4)).

The appeal of the graph. An alternative is to exploit the inherent problem structure: in neuroscience, each ROI is typically assumed to participate in K≤pK\leq p latent neural communities [1] that can be represented by a graph. For this reason, GNN-based algorithms have been extensively used in this field as standalone standard convolutions [5, 4, 6] or as part of brain-connectome-tailored architectures [3, 17]. Their goal is twofold: (a) obtaining a richer feature map and (b) denoising the empirical covariance matrix by averaging over appropriate neighborhoods. We postulate that the main appeal of these methods in our setting stems from the denoising effect: the usually reported strengths of GNNs as feature maps (such as learning permutation-invariant representations) do not apply here, since ROIs are aligned across patients and therefore non-exchangeable.

A graph message passing layer is defined as X′=σ(R(A)XW)X' = \sigma(R(A)XW), where A∈Rp×pA \in\mathbb{R}^{p \times p} is an adjacency matrix, X∈Rp×mX \in\mathbb{R}^{p \times m} a node feature matrix, W∈Rm×m′W \in\mathbb{R}^{m \times m'} learnable weights, R(A)R(A) the graph operator induced by AA (e.g. D~−1A~\widetilde{D}^{-1}\widetilde{A} for GraphSAGE [4], D~−1/2A~D~−1/2\widetilde{D}^{-1/2}\widetilde{A}\widetilde{D}^{-1/2} for GCN [5], with A~=A+I\widetilde{A}=A+I and D~=diag⁡(A~1)\widetilde{D}=\operatorname{diag}(\widetilde{A}\mathbf{1})), and σ\sigma an activation function.

References

  1. [1]Ed Bullmore and Olaf Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience, 10(3):186–198, 2009. doi: 10.1038/nrn2755.
  2. [2]Hejie Cui, Wei Dai, Yanqiao Zhu, Xuan Kan, Antonio Adong Chen Gu, Joshua Lukemire, Liang Zhan, Lifang He, Ying Guo, and Carl Yang. BrainGB: A benchmark for brain network analysis with graph neural networks. IEEE Transactions on Medical Imaging, 42(2):493–506, February 2023. ISSN 1558-254X. doi: 10.1109/tmi.2022.3218745. URL http://dx.doi.org/10.1109/TMI.2022.3218745.
  3. [3]Anwar Said, Roza G. Bayrak, Tyler Derr, Mudassir Shabbir, Daniel Moyer, Catie Chang, and Xenofon Koutsoukos. NeuroGraph: Benchmarks for graph machine learning in brain connectomics. In Advances in Neural Information Processing Systems, volume 36, pages 6509–6531, 2023.arxiv.org/abs/2306.06202
  4. [4]William L. Hamilton, Rex Ying, and Jure Leskovec. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems, volume 30, 2017.arxiv.org/abs/1706.02216
  5. [5]Thomas N. Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations, 2017.arxiv.org/abs/1609.02907
  6. [6]Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. Graph attention networks. In International Conference on Learning Representations, 2018.arxiv.org/abs/1710.10903
  7. [7]Keqi Han, Yao Su, Lifang He, Liang Zhan, Sergey Plis, Vince Calhoun, and Carl Yang. Rethinking functional brain connectome analysis: Do graph deep learning models help? npj Artificial Intelligence, 2(1):19, 2026.DOI
  8. [8]Liang Yang, Yuwei Liu, Jiaming Zhuo, Di Jin, Chuan Wang, Zhen Wang, and Xiaochun Cao. Do we really need message passing in brain network modeling? In Proceedings of the 42nd International Conference on Machine Learning, volume 267 of Proceedings of Machine Learning Research, pages 70873–70887. PMLR, 2025. URL https://openreview.net/forum?id=KRosBwvhDx.
  9. [9]Jose Lara-Rangel and Clare Heinbaugh. On the limits of applying graph transformers for brain connectome classification. In Proceedings on “I Can’t Believe It’s Not Better: Challenges in Applied Deep Learning” at ICLR 2025 Workshops, volume 296 of Proceedings of Machine Learning Research, pages 47–55. PMLR, 2025.
  10. [10]Qimai Li, Zhichao Han, and Xiao-Ming Wu. Deeper insights into graph convolutional networks for semi-supervised learning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 32, pages 3538–3545, 2018.
  11. [11]Nicolas Keriven. Not too little, not too much: a theoretical analysis of graph (over)smoothing. In Advances in Neural Information Processing Systems, volume 35, pages 2268–2281, 2022.
  12. [12]Juntong Chen, Johannes Schmidt-Hieber, Claire Donnat, and Olga Klopp. Understanding the effect of GCN convolutions in regression tasks. In Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, volume 258 of Proceedings of Machine Learning Research, pages 4573–4581. PMLR, 2025.arxiv.org/abs/2410.20068
  13. [13]T. Konstantin Rusch, Michael M. Bronstein, and Siddhartha Mishra. A survey on oversmoothing in graph neural networks, 2023. URL https://arxiv.org/abs/2303.10993.
  14. [14]Vince D. Calhoun, Tulay Adalı, Godfrey D. Pearson, and James J. Pekar. A method for making group inferences from functional MRI data using independent component analysis. Human Brain Mapping, 14(3):140–151, 2001. doi: 10.1002/hbm.1048.
  15. [15]Christian F. Beckmann and Stephen M. Smith. Probabilistic independent component analysis for functional magnetic resonance imaging. IEEE Transactions on Medical Imaging, 23(2):137–152, 2004. doi: 10.1109/TMI.2003.822821.
  16. [16]Christian F. Beckmann, Mercedes DeLuca, Joseph T. Devlin, and Stephen M. Smith. Investigations into resting-state connectivity using independent component analysis. Philosophical Transactions of the Royal Society B: Biological Sciences, 360(1457):1001–1013, 2005. doi: 10.1098/rstb.2005.1634.DOI
  17. [17]Xiaoxiao Li, Yuan Zhou, Nicha Dvornek, Muhan Zhang, Siyuan Gao, Juntang Zhuang, Dustin Scheinost, Lawrence H Staib, Pamela Ventola, and James S Duncan. BrainGNN: Interpretable brain graph neural network for fMRI analysis. Medical image analysis, 74:102233, 2021.DOI
  18. [18]Falih Gozi Febrinanto, Mujie Liu, and Feng Xia. Balanced graph structure information for brain disease detection. In Pacific Rim Knowledge Acquisition Workshop, pages 134–143. Springer, 2023.DOI
  19. [19]Jiaxing Xu, Kai He, Yue Tang, Wei Li, Mengcheng Lan, Xia Dong, Yiping Ke, and Mengling Feng. BrainPrompt: Multi-level brain prompt enhancement for neurological condition identification. In International Conference on Medical Image Computing and Computer-Assisted Intervention, pages 172–182. Springer, 2025.arxiv.org/abs/2504.16096
  20. [20]Jiaxing Xu, Yongqiang Chen, Xia Dong, Mengcheng Lan, Tiancheng Huang, Qingtian Bian, James Cheng, and Yiping Ke. BrainOOD: Out-of-distribution generalizable brain network analysis. In International Conference on Learning Representations, 2025.arxiv.org/abs/2502.01688
  21. [21]Peter W. Battaglia, Jessica B. Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, Caglar Gulcehre, Francis Song, Andrew Ballard, Justin Gilmer, George Dahl, Ashish Vaswani, Kelsey Allen, Charles Nash, Victoria Langston, Chris Dyer, Nicolas Heess, Daan Wierstra, Pushmeet Kohli, Matt Botvinick, Oriol Vinyals, Yujia Li, and Razvan Pascanu. Relational inductive biases, deep learning, and graph networks, 2018. URL https://arxiv.org/abs/1806.01261.
  22. [22]Felix Wu, Tianyi Zhang, Amauri Holanda de Souza, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. Simplifying graph convolutional networks. In Proceedings of the 36th International Conference on Machine Learning, pages 6861–6871, 2019.arxiv.org/abs/1902.07153
  23. [23]Hoang NT and Takanori Maehara. Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550, 2019.arxiv.org/abs/1905.09550
  24. [24]Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, and Meng Wang. LightGCN: Simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 639–648, 2020.arxiv.org/abs/2002.02126
  25. [25]Po-Ling Loh and Martin J Wainwright. High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity. In Advances in Neural Information Processing Systems, volume 24, pages 2726–2734, 2011.DOI
  26. [26]Abhinup Datta and Hui Zou. CoCoLasso for high-dimensional error-in-variables regression. Annals of Statistics, 45(6):2400–2426, 2017.arxiv.org/abs/1510.07123
  27. [27]Leonard A Stefanski and Raymond J Carroll. Conditional scores and optimal scores for generalized linear measurement-error models. Biometrika, 74(4):703–716, 1987.
  28. [28]Xiaohong Chen, Han Hong, and Denis Nekipelov. Nonlinear models of measurement errors. Journal of Economic Literature, 49(4):901–937, 2011.DOI
  29. [29]Susanne M Schennach. Measurement error in nonlinear models–a review. In Daron Acemoglu, Manuel Arellano, and Eddie Dekel, editors, Advances in Economics and Econometrics: Tenth World Congress, volume 3, pages 296–337. Cambridge University Press, 2013.
  30. [30]Zhirui Hu, Zheng Tracy Ke, and Jun S Liu. Measurement error models: from nonparametric methods to deep neural networks. Statistical Science, 37(4):473–493, 2022.arxiv.org/abs/2007.07498
  31. [31]Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9:1981–2014, 2008.
  32. [32]John Wishart. The generalised product moment distribution in samples from a normal multivariate population. Biometrika, 20A(1/2):32–52, 1928. ISSN 00063444, 14643510. URL http://www.jstor.org/stable/2331939.
  33. [33]Jan R. Magnus and H. Neudecker. The Commutation Matrix: Some Properties and Applications. The Annals of Statistics, 7(2):381 – 394, 1979. doi: 10.1214/aos/1176344621. URL https://doi.org/10.1214/aos/1176344621.
  34. [34]K. J. Worsley, C. H. Liao, J. Aston, V. Petre, G. H. Duncan, F. Morales, and A. C. Evans. A general statistical analysis for fMRI data. NeuroImage, 15(1):1–15, 2002. doi: 10.1006/nimg.2001.0933.DOI
  35. [35]The ADHD-200 Consortium. The ADHD-200 consortium: a model to advance the translational potential of neuroimaging in clinical neuroscience. Frontiers in Systems Neuroscience, 6:62, 2012. doi: 10.3389/fnsys.2012.00062.
  36. [36]Pierre Bellec, Carlton Chu, François Chouinard-Decorte, Yassine Benhajali, Daniel S Margulies, and R Cameron Craddock. The Neuro Bureau ADHD-200 preprocessed repository. NeuroImage, 144:275–286, 2017. doi: 10.1016/j.neuroimage.2016.06.034.DOI
  37. [37]R. C. Craddock, G. A. James, P. E. Holtzheimer, X. P. Hu, and H. S. Mayberg. A whole brain fMRI atlas generated via spatially constrained spectral clustering. Human Brain Mapping, 33 (8):1914–1928, 2012. doi: 10.1002/hbm.21333.
  38. [38]A. Di Martino, C.-G. Yan, Q. Li, E. Denio, F. X. Castellanos, K. Alaerts, J. S. Anderson, M. As-saf, S. Y. Bookheimer, M. Dapretto, et al. The autism brain imaging data exchange: towards a large-scale evaluation of the intrinsic brain architecture in autism. Molecular Psychiatry, 19(6):659–667, 2014. doi: 10.1038/mp.2013.78. URL https://doi.org/10.1038/mp.2013.78.
  39. [39]Cameron Craddock, Yassine Benhajali, Carlton Chu, Francois Chouinard, Alan Evans, András Jakab, Budhachandra Singh Khundrakpam, John David Lewis, Qingyang Li, Michael Milham, et al. The Neuro Bureau preprocessing initiative: open sharing of preprocessed neuroimaging data and derivatives. In Frontiers in Neuroinformatics Conference Abstract: Neuroinformatics 2013. Frontiers Media SA, 2013. doi: 10.3389/conf.fninf.2013.09.00041. URL https://www.frontiersin.org/10.3389/conf.fninf.2013.09.00041/event_abstract.DOI
  40. [40]Cameron Craddock, Sharad Sikka, Brian Cheung, Ranjeet Khanuja, Satrajit S Ghosh, Chaogan Yan, Qingyang Li, V Lurko, Joshua Vogelstein, Randal Burns, Stanley Colcombe, Maarten Mennes, Clare Kelly, Adriana Di Martino, Francisco Xavier Castellanos, and Michael Milham. Towards automated analysis of connectomes: The configurable pipeline for the analysis of connectomes (c-pac). In Frontiers in Neuroinformatics Conference Abstract: Neuroinformatics 2013. Frontiers Media SA, 2013. doi: 10.3389/conf.fninf.2013.09.00042. URL https://www.frontiersin.org/10.3389/conf.fninf.2013.09.00042/event_abstract.DOI
  41. [41]Alexandre Abraham, Fabian Pedregosa, Michael Eickenberg, Philippe Gervais, Andreas Mueller, Jean Kossaifi, Alexandre Gramfort, Bertrand Thirion, and Gaël Varoquaux. Machine learning for neuroimaging with scikit-learn. Frontiers in Neuroinformatics, 8:14, 2014. doi: 10.3389/fninf.2014.00014.DOI
  42. [42]E. Tagliazucchi, F. von Wegner, A. Morzelewski, S. Borisov, K. Jahnke, and H. Laufs. Automatic sleep staging using fMRI functional connectivity data. NeuroImage, 63(1):63–72, 2012. doi: 10.1016/j.neuroimage.2012.06.036.
  43. [43]Evan M. Gordon, Timothy O. Laumann, Babatunde Adeyemo, Jeremy F. Huckins, William M. Kelley, and Steven E. Petersen. Generation and evaluation of a cortical area parcellation from resting-state correlations. Cerebral Cortex, 26(1):288–303, 2016. doi: 10.1093/cercor/bhu239.

Paper details

vlnc:W_6rn373zh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 11

downloads · 0

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

  • Computer Science

large language models (LLMs)

View statement
Looking for related papers…
Contents