Greedy based convolutional neural network optimization for detecting apnea

Background and objective: Sleep apnea is a common sleep disorder, usually diagnosed using an expensive, highly specialized, and inconvenient test called polysomnography. A single SpO2 sensor based on an automated classification system can be developed to simplify the apnea detection. The main objective of this work is to develop a classifier based on a convolution neural network with the capability of detecting apnea events from one dimensional SpO2 signal. However, to find an optimum convolution neural network structure is a daunting task is usually done by a trial-and-error method. To solve this problem, a method is proposed to save time and simplify the process of searching for an optimum convolution neural network structure. Methods: Greedy based optimization is proposed to search for an optimized convolution neural network structure. Three different variants of greedy based optimization are proposed: the topology transfer, the weighted-topology transfer with rough estimation, and the weighted-topology transfer with fine tuning. The subject independent and the cross-database test are performed for the analysis. Results: Considering the balance between the execution time and the performance, the weightedtopology transfer with rough estimation is the best. An accuracy of 88.49% for the HuGCDN2008 database and 95.14% for the Apnea-ECG database are obtained for apnea events detection per minute. Regarding the apnea patient detection, also referred to as global classification, an accuracy of 95.71% is achieved for the HuGCDN2008 database, and 100% is achieved for the AED database without removing any subjects from both databases. Conclusions: The proposed one-dimensional convolution neural network performs better in a similar situation than those presented in the literature. The greedy based methods, mainly the weighted-topology transfer with rough estimation, is an alternative method to extensive trial and error method. (C) 2020 Elsevier B.V. All rights reserved.