li-detectingkcomplexes-2011.pdf (230.8 kB)
Detecting K-complexes for sleep stage identification using nonsmooth optimisation
journal contribution
posted on 2011-04-01, 00:00 authored by D Moloney, N Sukhorukova, P Vamplew, Julien UgonJulien Ugon, Gang LiGang Li, Gleb BeliakovGleb Beliakov, C Philippe, H Amiel, A UgonThe process of sleep stage identification is a labour-intensive task that involves the specialized interpretation of the polysomnographic signals captured from a patient’s overnight sleep session. Automating this task has proven to be challenging for data mining algorithms because of noise, complexity and the extreme size of data. In this paper we apply nonsmooth optimization to extract key features that lead to better accuracy. We develop a specific procedure for identifying K-complexes, a special type of brain wave crucial for distinguishing sleep stages. The procedure contains two steps. We first extract “easily classified” K-complexes, and then apply nonsmooth optimization methods to extract features from the remaining data and refine the results from the first step. Numerical experiments show that this procedure is efficient for detecting K-complexes. It is also found that most classification methods perform significantly better on the extracted features.
History
Journal
ANZIAM JournalVolume
52Issue
4Pagination
319 - 332Publisher
Cambridge University PressLocation
Cambridge, EnglandISSN
1446-1811Language
engPublication classification
C1 Refereed article in a scholarly journalCopyright notice
2011, Cambridge University PressUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC