Threshold Selection for Brain Connectomes
Nicholas D. TheisiD, Jonathan E. RubiniD, Joshua CapeiD, Satish IyengariD, Konasale M. R. PrasadiD
Abstract
IntroductionStructural and functional brain connectomes built using macroscale data collected through magnetic resonance imaging (MRI) may contain noise that contributes to false-positive edges, which can obscure structure-function relationships with implications for data interpretation. Thresholding procedures are routinely applied in practice to optimize network density by removing low-signal edges, but there is limited consensus regarding the appropriate selection of thresholds. We compare existing methods and propose a novel alternative objective function thresholding (OFT) method. MethodsThe performance of thresholding approaches, including a percolation-based approach and an objective function-based approach, is assessed by (a) computing the normalized mutual information (NMI) of community structure between a known network and a simulated, perturbed networks to which various forms of thresholding have been applied, and (b) comparing the density and the clustering coefficient (CC) between the baseline and thresholded networks. ResultsIn our analysis, the proposed objective function-based threshold exhibits the best performance in terms of high similarity between the underlying networks and their perturbed, thresholded counterparts, as quantified by NMI and CC analysis on the simulated functional networks. DiscussionExisting network thresholding methods yield widely different results when graph metrics are computed. Thresholding based on the objective function appears to maintain a set of edges such that the resulting network shares the community structure and clustering features present in the original network. This outcome provides proof-of-principle evidence that thresholding based on the objective function could offer a useful approach to reducing the network density of functional connectivity data. Impact StatementNetwork thresholding refers to removing edges between node pairs in a functional network that have weak edge-weights that may arise from unwanted variability or noise. Since edge-weight cutoffs used to generate a binary network can be sensitive to thresholding, we introduce a novel thresholding algorithm. We find that when applied to networks derived via perturbations, namely through simulated functional connectivity of a known network, this approach yields a binary network that is more similar to the known network compared to using existing thresholding approaches. Thus, our algorithm is a competitive candidate for use in thresholding of brain connectome.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 17
- FWCI
- 2.09
- Field percentile
- top 14%
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Comparing Community Detection Methods in Brain Functional Connectivity Networks
Reddy Rani Vangimalla, Jaya Sreevalsan‐Nair·Communications in computer and information sciencePeer-reviewed·Jan 1, 2020
- Efficient small-world and scale-free functional brain networks at rest using k-nearest neighbors thresholding
Caroline Garcia Forlim, Siavash Haghiri, … Simone Kühn·bioRxiv·May 5, 2019
- The effect of network thresholding and weighting on structural brain networks in the UK Biobank
Colin R. Buchanan, Mark E. Bastin, … Simon R. Cox·NeuroImagePeer-reviewed·Jan 10, 2020
- Scale-resolved analysis of brain functional connectivity networks with spectral entropy
Carlo Nicolini, Giulia Forcellini, … Angelo Bifone·NeuroImagePeer-reviewed·Feb 7, 2020
- Threshold-Free Network-Oriented Statistics in Neuroscience
Zexuan Hao, Pei Wang, … Weibei Dou·bioRxiv·Jan 3, 2024
- Systematic evaluation of structural connectome thresholding in whole-brain network modelling
Liyi Qian, Sihan Ju, … Liang Chen·bioRxiv·Sep 4, 2026