2015 IEEE 12th International Symposium on Biomedical Imaging (ISBI) 2015
DOI: 10.1109/isbi.2015.7163812
|View full text |Cite
|
Sign up to set email alerts
|

Kernel-based classification for brain connectivity graphs on the Riemannian manifold of positive definite matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 46 publications
(44 citation statements)
references
References 13 publications
0
38
0
Order By: Relevance
“…Partial correlation between nodes is useful to rule out indirect effects in the correlation structure, but calls for shrunk estimates (Smith et al, 2011;Varoquaux et al, 2010b). Mathematical arguments have also led to representations tailored to the manifold-structure of covariance matrices (Varoquaux et al, 2010a;Ng et al, 2014;Dodero et al, 2015;Colclough et al, 2017). We benchmark the simplest of these, a tangent representation of the manifold which underlies the more complex developments (see Appendix A for a quick introduction to this formalism).…”
Section: Representation Of Brain Functional Connectomesmentioning
confidence: 99%
See 1 more Smart Citation
“…Partial correlation between nodes is useful to rule out indirect effects in the correlation structure, but calls for shrunk estimates (Smith et al, 2011;Varoquaux et al, 2010b). Mathematical arguments have also led to representations tailored to the manifold-structure of covariance matrices (Varoquaux et al, 2010a;Ng et al, 2014;Dodero et al, 2015;Colclough et al, 2017). We benchmark the simplest of these, a tangent representation of the manifold which underlies the more complex developments (see Appendix A for a quick introduction to this formalism).…”
Section: Representation Of Brain Functional Connectomesmentioning
confidence: 99%
“…With this covariance structure, we study three different parametrizations of functional interactions: full correlation, partial correlation (Smith et al, 2011;Varoquaux and Craddock, 2013) and the tangent space of covariance matrices. The latter is less frequently used but has solid mathematical foundations and a variety of groups have reported good decoding per-formances with this framework (Varoquaux et al, 2010a;Barachant et al, 2013;Ng et al, 2014;Dodero et al, 2015;Qiu et al, 2015;Rahim et al, 2017;Wong et al, 2018). We compared two variants, using as a reference point the Euclidean mean (Varoquaux et al, 2010a) or the geometric mean (Ng et al, 2014); in both cases we rely on Nilearn implementation (Abraham et al, 2014b).…”
Section: Connectivity Parametrizationmentioning
confidence: 99%
“…Some other approaches try to design a suitable kernel relating to the specific problem. Dudero et al [2] proposed a mathematical framework based on Riemannian geometry and kernel methods that could be applied to connectivity matrices for the classification tasks. They have trained and tested proposed kernel using crossvalidation method and reported the accuracy of 60.76%.…”
Section: Related Workmentioning
confidence: 99%
“…obtaining the dynamic Laplacian connectivity (dLC), where D t is the degree matrix of W t at each time t. The graph Laplacian is PSD and it can be easily regularized to a positive definite matrix by the modification L t = L t + γI, where γ > 0 is a regularization parameter and I is the identity matrix [11]. In our settings we used γ = 10 −9 .…”
Section: Graph Laplacian and Modularitymentioning
confidence: 99%
“…The graph Laplacian matrix is often used to study modular organization [8,9] and it has recently been proposed to explore dynamical process of network systems [10]. Moreover, the Laplacian matrix is positive semi-definite (PSD) and it can be combined with the Riemannian geometry [11]. Therefore, we characterize dissimilarity between dFC patterns using Riemannian metrics.…”
Section: Introductionmentioning
confidence: 99%