2017
DOI: 10.1101/187252
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Data-driven Topological Filtering based on Orthogonal Minimal Spanning Trees: Application to Multi-Group MEG Resting-State Connectivity

Abstract: In the present study a novel data-driven topological filtering technique is introduced to derive the backbone of functional brain networks relying on orthogonal minimal spanning trees (OMST).The method aims to identify the essential functional connections to ensure optimal information flow via the objective criterion of global efficiency minus the cost of surviving connections. TheOMST technique was applied to multichannel, resting-state neuromagnetic recordings from four groups of participants: healthy adults… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
2

Relationship

5
1

Authors

Journals

citations
Cited by 6 publications
(12 citation statements)
references
References 53 publications
0
12
0
Order By: Relevance
“…In this study, we focused on the scale of 2, which corresponds to the frequency range of 0.06 ‐ 0.125 Hz. The absolute values of Fisher's Z‐transformed correlation coefficients were then thresholded with the data‐driven topological filtering scheme based on optimization of the global cost‐efficiency of the network (Bassett et al, ) and the OMSTs (Dimitriadis, Antonakakis, et al, ; Dimitriadis, Salis, et al, ) (see Appendix A for more details). The obtained topological undirected weighted graphs were used for the subsequent community structure analysis.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this study, we focused on the scale of 2, which corresponds to the frequency range of 0.06 ‐ 0.125 Hz. The absolute values of Fisher's Z‐transformed correlation coefficients were then thresholded with the data‐driven topological filtering scheme based on optimization of the global cost‐efficiency of the network (Bassett et al, ) and the OMSTs (Dimitriadis, Antonakakis, et al, ; Dimitriadis, Salis, et al, ) (see Appendix A for more details). The obtained topological undirected weighted graphs were used for the subsequent community structure analysis.…”
Section: Methodsmentioning
confidence: 99%
“…We targeted the short‐term effects of prolonged task performance, which were considered to be due to mental fatigue and persisted for at least several minutes (Breckel et al, ), rather than long‐term training effects. Individual functional networks at pre‐ and posttask runs were constructed with cutting‐edge techniques including maximum overlap discrete wavelet transform (MODWT), Ledoit‐Wolf shrinkage covariance estimator (Ledoit & Wolf, ) and a data‐driven topological filtering scheme based on the orthogonal minimum spanning trees (OMSTs) (Dimitriadis, Antonakakis, Simos, Fletcher, & Papanicolaou, ; Dimitriadis, Salis, Tarnanas, & Linden, ), which yielded reproducible networks. The subnetwork metrics and conventional metrics for the whole networks were introduced as explanatory variables to regression analyses to examine which metrics were effective in discriminating pre‐ and posttask periods and in predicting extents of individual cognitive decline.…”
Section: Introductionmentioning
confidence: 99%
“…In addition to statistical filtering, a data-based topological connection-cutting was applied based on a recently suggested procedure (Dimitriadis et al, 2017a, b). The so-called Orthogonal Minimal Spanning Trees (OMST 1 ) was performed to uncover the entire structure of the most dominant paths within every quasi-static FCG.…”
Section: Methodsmentioning
confidence: 99%
“…The so-called Orthogonal Minimal Spanning Trees (OMST 1 ) was performed to uncover the entire structure of the most dominant paths within every quasi-static FCG. The the OMST procedure was first enhanced from the notion that the full connected FCG can be extracted to an acyclic FCG or MST of minimum cost from the root node to leaf node without changing the strong connections strong from the weak connections (Dimitriadis et al, 2017a, b). Subsequently, the global efficiency of the specific MST was optimized preserving same total cost among within the connections (Dimitriadis et al, 2017b, d).…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation