2017
DOI: 10.1111/exsy.12211
|View full text |Cite
|
Sign up to set email alerts
|

Electroencephalography‐based feature extraction using complex network for automated epileptic seizure detection

Abstract: Electroencephalography signals are typically used for analyzing epileptic seizures. These signals are highly nonlinear and nonstationary, and some specific patterns exist for certain disease types that are hard to develop an automatic epileptic seizure detection system. This paper discussed statistical mechanics of complex networks, which inherit the characteristic properties of electroencephalography signals, for feature extraction via a horizontal visibility algorithm in order to reduce processing time and c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 45 publications
0
4
0
Order By: Relevance
“…Network analysis metrics can be defined based on different network features, including connectivity, centrality, and distance (Artameeyanant et al, 2017)…”
Section: Visibility Graph Analysismentioning
confidence: 99%
“…Network analysis metrics can be defined based on different network features, including connectivity, centrality, and distance (Artameeyanant et al, 2017)…”
Section: Visibility Graph Analysismentioning
confidence: 99%
“…This technique is used to test the influence of the independent variable on the dependent variable. ANOVA uses the F-Ratio test that allows multiple groups data through that variance between groups and within groups is determined (Artameeyanant et al, 2017).…”
Section: Analysis Of Variancementioning
confidence: 99%
“…For instance, Zhang et al (2022) used the weighted adjacency matrix as a feature representation for classifying different sleep stages using calcium imaging data. In contrast, Mohammadpoory et al (2023) experimented with various methods to extract features from adjacency matrices such as Graph Index Complexity (GIC), Characteristic Path Length (CPL), Global Efficiency (GE) ( Latora and Marchiori, 2001 ), Local Efficiency (LE) ( Latora and Marchiori, 2001 ), Clustering Coefficients (CC) ( Saramäki et al, 2007 ), and Assortative Coefficient (AC) ( Artameeyanant et al, 2017 ). Supriya et al (2016) took a different approach and calculated two network properties: modularity ( Blondel, 2008 ) and an average weighted degree ( Antoniou and Tsompa, 2008 ) from the graph.…”
Section: Introductionmentioning
confidence: 99%