2018
DOI: 10.3389/fninf.2018.00058
|View full text |Cite
|
Sign up to set email alerts
|

Learning Brain Connectivity Sub-networks by Group- Constrained Sparse Inverse Covariance Estimation for Alzheimer's Disease Classification

Abstract: Background/Aims: Brain functional connectivity networks constructed from resting-state functional magnetic resonance imaging (rs-fMRI) have been widely used for classifying Alzheimer's disease (AD) from normal controls (NC). However, conventional correlation analysis methods only capture the pairwise information, which may not be capable of revealing an adequate and accurate functional connectivity relationship among brain regions in the whole brain. Additionally, the non-sparse connectivity networks commonly … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(3 citation statements)
references
References 48 publications
0
3
0
Order By: Relevance
“…On the other hand, the multimodal random forest, based on fusion features, has more obvious advantages than the traditional single-modal method (Chanel et al, 2016; Guo et al, 2017). For instance, Rosa et al (2015) used sparse network-based models to identify brain disease patients with an accuracy rate of 79%, and Li et al (2018) employed group-constrained sparse inverse covariance which achieved about 80% accuracy in AD recognition. The average classification accuracy of the multimodal random forest is 83.33%.…”
Section: Discussionmentioning
confidence: 99%
“…On the other hand, the multimodal random forest, based on fusion features, has more obvious advantages than the traditional single-modal method (Chanel et al, 2016; Guo et al, 2017). For instance, Rosa et al (2015) used sparse network-based models to identify brain disease patients with an accuracy rate of 79%, and Li et al (2018) employed group-constrained sparse inverse covariance which achieved about 80% accuracy in AD recognition. The average classification accuracy of the multimodal random forest is 83.33%.…”
Section: Discussionmentioning
confidence: 99%
“…Thus, Σ −1 defines a minimal I-map Markov network [24], whereby nonzero entries correspond to edges in the network. Following the parsimony principle, Σ −1 is always assumed to be sparse in many applications, such as biological inference in gene networks [1,41] and analysis of fMRI brain connectivity data [16,27]. Hence, sparsity regularized negative log-likelihood minimization becomes a popular approach for estimating the sparse inverse covariance matrix.…”
Section: The 0 -Norm With Tikhonov Regularization For Sparse Inverse ...mentioning
confidence: 99%
“…Sparse inverse covariance matrix estimation is a fundamental problem in constructing a Gaussian network model, which uses a graph-based representation as the basis for compactly encoding a multivariate Gaussian distribution over a high-dimensional space [24]. Its applications range from causal inference [2,19,29], biological inference in gene networks [1,41], and detection of brain connectivity [16,27]. The inverse covariance matrix Σ −1 of a Gaussian distribution, called information matrix (or precision matrix), captures independencies between pairs of variables, conditioned on all of the remaining variables in the model.…”
Section: Introductionmentioning
confidence: 99%