Hyper-connectivity of functional networks for brain disease diagnosis
Open accessThe DOI matches its Crossref record; 93 of the 93 references it cites were found in a registry or an index.
Abstract
Exploring structural and functional interactions among various brain regions enables better understanding of pathological underpinnings of neurological disorders. Brain connectivity network, as a simplified representation of those structural and functional interactions, has been widely used for diagnosis and classification of neurodegenerative diseases, especially for Alzheimer’s disease (AD) and its early stage - mild cognitive impairment (MCI). However, the conventional functional connectivity network is usually constructed based on the pairwise correlation among different brain regions and thus ignores their higher-order relationships. Such loss of high-order information could be important for disease diagnosis, since neurologically a brain region predominantly interacts with more than one other brain regions. Accordingly, in this paper, we propose a novel framework for estimating the hyper-connectivity network of brain functions and then use this hyper-network for brain disease diagnosis. Here, the functional connectivity hyper-network denotes a network where each of its edges representing the interactions among multiple brain regions (i.e., an edge can connect with more than two brain regions), which can be naturally represented by a hyper-graph. Specifically, we first construct connectivity hyper-networks from the resting-state fMRI (R-fMRI) time series by using sparse representation. Then, we extract three sets of brain-region specific features from the connectivity hyper-networks, and further exploit a manifold regularized multi-task feature selection method to jointly select the most discriminative features. Finally, we use multi-kernel support vector machine (SVM) for classification. The experimental results on both MCI dataset and attention deficit hyperactivity disorder (ADHD) dataset demonstrate that, compared with the conventional connectivity network-based methods, the proposed method can not only improve the classification performance, but also help discover disease-related biomarkers important for disease diagnosis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918 · cited 1×
“The linear SVM classifier is implemented using LIBSVM toolbox (Chang and Lin, 2001) with a default parameter value.”
MethodTzourio-Mazoyer, N., Landeau, B., Papathanassiou, D., Crivello, F., Etard, O., Delcroix, N., Mazoyer, B., & Joliot, M. (2002) · NeuroImage · doi:10.1006/nimg.2001.0978 · Cited by 16,319 · cited 6×
“The brain space of fMRI scans for each subject is further parcellated into 116 regions of interesting (ROIs) by warping the Automated Anatomical Labeling (AAL) (Tzourio-Mazoyer et al., 2002) template to the subject space using the deformation fields estimated via a deformable registration method called HAMMER (Shen an…”
MethodInfluentialComplex brain networks: graph theoretical analysis of structural and functional systems
Bullmore, E., & Sporns, O. (2009) · Nature Reviews Neuroscience · doi:10.1038/nrn2575 · Cited by 11,820 · cited 1×
“Among them, most existing studies are based on the correlation-based methods (Bullmore and Sporns, 2009; Kaiser, 2011; Smith et al., 2013; Sporns, 2011; Xie and He, 2011).”
MethodComplex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522 · cited 2×
“In the conventional connectivity network, the clustering coefficient is widely used to quantify the degree to which nodes in a network tend to cluster together (Rubinov and Sporns, 2010).”
MethodRobust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388 · cited 3×
“Specifically, we first construct the connectivity hyper-networks using sparse representation (SR) approach (Wright et al., 2009).”
MethodEfron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261 · cited 9×
“For comparison, we also perform the conventional connectivity network based method with the t-test based feature selection (still denoted as CN), instead of using its original LASSO-based feature selection.”
BackgroundMethodInfluentialAtomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845 · cited 2×
“…‖2 ‖ ‖ This is a well-known NP problem due to the l0-norm term and often been approximated by solving a standard l1-norm regularized optimization problem with the following objective function (Chen et al., 1998): ‖ ‖2 ‖ ‖ where is a regularization parameter controlling the sparsity of the model.”
MethodAn Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Cited by
Pulini, A. A., Kerr, W. T., Loo, S. K., & Lenartowicz, A. (2019) · Biological Psychiatry: Cognitive Neuroscience and Neuroimaging · doi:10.1016/j.bpsc.2018.06.003 · Cited by 85
Exploring the Brain Lateralization in ADHD Based on Variability of Resting-State fMRI Signal
Zou, H., & Yang, J. (2021) · Journal of Attention Disorders · doi:10.1177/1087054718816170 · Cited by 14
Metadata
- Authors
- Jie, B., Wee, C.-Y., Shen, D., & Zhang, D.
- Venue
- Medical Image Analysis
- Publisher
- Elsevier BV
- Published
- 2016-08
- Volume
- 32
- Pages
- 84-100
- ISSN
- 1361-8415 (ISSN-L)
- OpenAlex
- W2304527985
- Cited by
- 160
- References
- 93
- FWCI
- 9.21
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.