Complexity science for sleep stage classification from EEG
File(s)PID4652691.pdf (314.35 KB)
Accepted version
Author(s)
Type
Conference Paper
Abstract
Automatic sleep stage classification is an important
paradigm in computational intelligence and promises consider-
able advantages to the health care. Most current automated
methods require the multiple electroencephalogram (EEG) chan-
nels and typically cannot distinguish the S1 sleep stage from
EEG. The aim of this study is to revisit automatic sleep stage
classification from EEGs using complexity science methods. The
proposed method applies fuzzy entropy and permutation entropy
as kernels of multi-scale entropy analysis. To account for sleep
transition, the preceding and following 30 seconds of epoch data
were used for analysis as well as the current epoch. Combining
the entropy and spectral edge frequency features extracted from
one EEG channel, a multi-class support vector machine (SVM)
was able to classify 93.8% of 5 sleep stages for the SleepEDF
database [expanded], with the sensitivity of S1 stage was 49.1%.
Also, the Kappa’s coefficient yielded 0.90, which indicates almost
perfect agreement.
paradigm in computational intelligence and promises consider-
able advantages to the health care. Most current automated
methods require the multiple electroencephalogram (EEG) chan-
nels and typically cannot distinguish the S1 sleep stage from
EEG. The aim of this study is to revisit automatic sleep stage
classification from EEGs using complexity science methods. The
proposed method applies fuzzy entropy and permutation entropy
as kernels of multi-scale entropy analysis. To account for sleep
transition, the preceding and following 30 seconds of epoch data
were used for analysis as well as the current epoch. Combining
the entropy and spectral edge frequency features extracted from
one EEG channel, a multi-class support vector machine (SVM)
was able to classify 93.8% of 5 sleep stages for the SleepEDF
database [expanded], with the sensitivity of S1 stage was 49.1%.
Also, the Kappa’s coefficient yielded 0.90, which indicates almost
perfect agreement.
Date Issued
2017-07-03
Date Acceptance
2017-02-04
Citation
2017 International Joint Conference on Neural Networks (IJCNN), 2017, pp.4387-4394
ISSN
2161-4407
Publisher
IEEE
Start Page
4387
End Page
4394
Journal / Book Title
2017 International Joint Conference on Neural Networks (IJCNN)
Copyright Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor
Rosetrees Trust
Engineering & Physical Science Research Council (E
Engineering & Physical Science Research Council (EPSRC)
Grant Number
N/A
EP/K503733/1
EP/K025643/1
Source
IEEE International Joint Conference on Neural Networks (IJCNN) 2017
Subjects
Science & Technology
Technology
Computer Science, Artificial Intelligence
Computer Science, Hardware & Architecture
Engineering, Electrical & Electronic
Computer Science
Engineering
ENTROPY
Publication Status
Published
Start Date
2017-05-14
Finish Date
2017-05-19
Coverage Spatial
Anchorage, Alaska, USA
Date Publish Online
2017-07-03