2018 11th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) 2018
DOI: 10.1109/cisp-bmei.2018.8633052
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Visibility Graph Analysis of EEG Signals of Alzheimer Brain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Table 1 lists the most common metrics based on our article review. For instance, Ji et al (2016) found that the degree distribution of the extracted brain network of individuals with job stress increases with the k coefficient, while that of normal individuals decreases with the k coefficient, or Wang et al (2018), by analyzing brain network features, showed that the connections in the brain network of individuals with Alzheimer's disease are more scattered than those of healthy individuals, indicating a scale-free property, and the range of connections in their brain network is reduced. Therefore, calculating and studying network analysis metrics in graph-theoretical area can be highly beneficial.…”
Section: Modularitymentioning
confidence: 99%
“…Table 1 lists the most common metrics based on our article review. For instance, Ji et al (2016) found that the degree distribution of the extracted brain network of individuals with job stress increases with the k coefficient, while that of normal individuals decreases with the k coefficient, or Wang et al (2018), by analyzing brain network features, showed that the connections in the brain network of individuals with Alzheimer's disease are more scattered than those of healthy individuals, indicating a scale-free property, and the range of connections in their brain network is reduced. Therefore, calculating and studying network analysis metrics in graph-theoretical area can be highly beneficial.…”
Section: Modularitymentioning
confidence: 99%
“…In total, we used 12 features to classify the Alzheimer's (AD) and the robust normal elderly (RNE) groups. Six of these features have been tested in previous EEG graph theory studies of AD, namely clustering coefficient sequence similarity [15], average clustering coefficient [38,39], global efficiency [15,38,40], local efficiency [15,41], small-worldness [15] and graph index complexity [15,16]. The other six are graph features heavily studied in the field of computer science that, to the best of our knowledge, have not yet been considered in EEG graph theory studies.…”
Section: Feature Extractionmentioning
confidence: 99%
“…31 The constructed graph inherits the time characteristics of the time series, including the regular graph representing the periodic sequence, the random graph representing the random sequence, and the scale-free network representing the fractal sequence. Previously, VG has been widely used in the study of AD electroencephalogram (EEG) signals, including the successful characterization of the abnormal topology of the AD complex network, 28,32 the effective diagnosis of AD patients, 33,34 the detection of the degree and state of brain fatigue, 35,36 and the successful characterization of the correlation of multiple time series. 37 This fully demonstrates that VG is a powerful network construction tool and a promising method for studying the dynamic characteristics of AD functional networks in time.…”
Section: Introductionmentioning
confidence: 99%