Detecting $K$-complexes for sleep stage identification using nonsmooth optimization

N. Sukhorukova, D. Moloney, P. Vamplew, J. Ugon, G. Li, G. Beliakov, C. Philippe, H. Amiel, A. Ugon

Abstract


The 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.

doi:10.1017/S1446181112000016

Keywords


K-complexes; nonsmooth optimization; classification



DOI: http://dx.doi.org/10.21914/anziamj.v52i0.4037



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.