2013 IEEE Symposium on Computers &Amp; Informatics (ISCI) 2013
DOI: 10.1109/isci.2013.6612397
|View full text |Cite
|
Sign up to set email alerts
|

EEG feature extraction and selection techniques for epileptic detection: A comparative study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…Therefore, it has complexity C JCLO = N W F L · C t , where C t is the complexity of solving the optimization problem in (20). For DCL algorithm, it solves the optimization problem in (21) N W F L times to get the application layer parameters, then solves the optimization problem in (22) once to get the MAC-PHY layer parameters. Therefore, it has complexity C DCL = N W F L · C p + C ts , where C p is the complexity of solving the optimization problem in (21) and C ts is the complexity of solving the optimization problem in (22).…”
Section: Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore, it has complexity C JCLO = N W F L · C t , where C t is the complexity of solving the optimization problem in (20). For DCL algorithm, it solves the optimization problem in (21) N W F L times to get the application layer parameters, then solves the optimization problem in (22) once to get the MAC-PHY layer parameters. Therefore, it has complexity C DCL = N W F L · C p + C ts , where C p is the complexity of solving the optimization problem in (21) and C ts is the complexity of solving the optimization problem in (22).…”
Section: Simulation Resultsmentioning
confidence: 99%
“…For DCL algorithm, it solves the optimization problem in (21) N W F L times to get the application layer parameters, then solves the optimization problem in (22) once to get the MAC-PHY layer parameters. Therefore, it has complexity C DCL = N W F L · C p + C ts , where C p is the complexity of solving the optimization problem in (21) and C ts is the complexity of solving the optimization problem in (22). Regarding JCL-ESL algorithm, it solves the optimization problem in (24) N W F L times.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The aforementioned set of wavelet families can be applied for the feature extraction purpose. To obtain maximum classification accuracy, Daubechies 6 with 7 levels of decomposition is utilized [24]. Classical statistics (maximum, minimum, mean and standard deviation) are obtained from each wavelet subband and combined together to devise the feature vector, which in turn used in the classification process.…”
Section: Introductionmentioning
confidence: 99%