- Title
- Detecting K-complexes for sleep stage identification using nonsmooth optimization
- Creator
- Moloney, David; Sukhorukova, Nadezda; Vamplew, Peter; Ugon, Julien; Li, Gang; Beliakov, Gleb; Philippe, Carole; Amiel, Hélène; Ugon, Adrien
- Date
- 2012
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/38190
- Identifier
- vital:4728
- Identifier
-
https://doi.org/10.1017/S1446181112000016
- Identifier
- ISSN:1446-1811
- 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. © 2012 Australian Mathematical Society.
- Relation
- ANZIAM Journal Vol. 52, no. 4 (2012), p. 319-332
- Rights
- Copyright Australian Mathematical Society
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 01 Mathematical Sciences; 09 Engineering; Classification; K-complexes; Nonsmooth optimization
- Full Text
- Reviewed
- Hits: 8186
- Visitors: 8267
- Downloads: 399
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted version | 230 KB | Adobe Acrobat PDF | View Details Download |