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

The thresholding problem and variability in the EEG graph network parameters

Abstract: The graph thresholding is a frequently used practice of eliminating the weak connections in brain functional connectivity graphs. The main aim of the procedure is to delete the spurious connections in the data. However, the choice of the threshold is arbitrary and the effect of the threshold choice in not fully understood. Here we present the description of the changes in the global measures of a functional connectivity graph depending on the different proportional thresholds based on the 146 resting-state EEG… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 65 publications
0
1
0
Order By: Relevance
“…Adjacency matrices were transformed into networks through quartile thresholding (Adamovich et al, 2022; van den Heuvel et al, 2017). We used two different threshold values: 0.5, as previously applied in our research (Zakharov et al, 2020), and 0.8, a more commonly used threshold in the literature.…”
Section: Methodsmentioning
confidence: 99%
“…Adjacency matrices were transformed into networks through quartile thresholding (Adamovich et al, 2022; van den Heuvel et al, 2017). We used two different threshold values: 0.5, as previously applied in our research (Zakharov et al, 2020), and 0.8, a more commonly used threshold in the literature.…”
Section: Methodsmentioning
confidence: 99%