Key result
The RUSBoosted tree model achieved an average recall of 92.34%, AUC of 95.4%, and F10-score of 83.59% for k-complex detection, outperforming traditional classifiers in handling imbalanced EEG data.
Why the study?
Manual k-complex detection is time-consuming, and existing machine learning methods suffer from imbalanced datasets that impede processing.
The RUSBoosted tree model provides an efficient and automated method for k-complex detection in EEG signals, handling highly imbalanced data effectively.
Answers are grounded in this paper and cite their sources.
May aid automated k-complex detection in EEG research; leaves open prospective clinical validation before practice change.
Background K-complex detection traditionally relied on expert clinicians, which is time-consuming and onerous. Various automatic k-complex detection-based machine learning methods are presented. However, these methods always suffered from imbalanced datasets, which impede the subsequent processing steps. New method In this study, an efficient method for k-complex detection using electroencephalogram (EEG)-based multi-domain features extraction and selection method coupled with a RUSBoosted tree model is presented. EEG signals are first decomposed using a tunable Q-factor wavelet transform (TQWT). Then, multi-domain features based on TQWT are pulled out from TQWT sub-bands, and a self-adaptive feature set is obtained from a feature selection based on the consistency-based filter for the detection of k-complexes. Finally, the RUSBoosted tree model is used to perform k-complex detection. Results Experimental outcomes manifest the efficacy of our proposed scheme in terms of the average performance of recall measure, AUC, and F10-score. The proposed method yields 92.41 ± 7.47%, 95.4 ± 4.32%, and 83.13 ± 8.59% for k-complex detection in Scenario 1 and also achieves similar results in Scenario 2. Comparison to state-of-the-art methods The RUSBoosted tree model was compared with three other machine learning classifiers [i.e., linear discriminant analysis (LDA), logistic regression, and linear support vector machine (SVM)]. The performance based on the kappa coefficient, recall measure, and F10-score provided evidence that the proposed model surpassed other algorithms in the detection of the k-complexes, especially for the recall measure. Conclusion In summary, the RUSBoosted tree model presents a promising performance in dealing with highly imbalanced data. It can be an effective tool for doctors and neurologists to diagnose and treat sleep disorders.
No takes yet. Share an insight, caveat, or question.
Yabing Li (2023) studied Sleep analysis (k-complex detection) (n=10). RUSBoosted tree method vs. Linear discriminant analysis, logistic regression, and linear SVM was evaluated on Recall measure for k-complex detection. The RUSBoosted tree model achieved an average recall of 92.34%, AUC of 95.4%, and F10-score of 83.59% for k-complex detection, outperforming traditional classifiers in handling imbalanced EEG data.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: