Detecting K-complexes for sleep stage identification using nonsmooth optimization

DOI10.1017/S1446181112000016MaRDI QIDQ2883243zbMATH OpenFDO

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

Publication date 11 May 2012

Published in The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Medical applications (general) (92C50) Applications of mathematical programming (90C90) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Explore Intrinsic Geometry of Sleep Dynamics and Predict Sleep Stage by Unsupervised Learning Techniques
• Classifying sleep states using persistent homology and Markov chains: a pilot study
• scientific article; zbMATH DE number 1928746
• Automated sleep-wake staging combining robust feature extraction, artificial neural network classification, and flexible decision rules

Cites work

• scientific article; zbMATH DE number 2200689 (Why is no real title available?)
• A Method for Minimization of Quasidifferentiable Functions
• Cutting angle method – a tool for constrained global optimization
• Implementation of novel methods of global and nonsmooth optimization: GANSO programming library

Cited in

(4)

• A comparison study on stages of sleep: quantifying multiscale complexity using higher moments on coarse-graining
• Convex optimisation-based methods for K-complex detection
• Classifying sleep states using persistent homology and Markov chains: a pilot study
• Linear least squares problems involving fixed knots polynomial splines and their singularity study

This page was built for publication: Detecting \(K\)-complexes for sleep stage identification using nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883243)