Evidence map›Paper›PMID 36998730›Full record

ArticleFrontiers in neuroscience2023

A RUSBoosted tree method for k-complex detection using tunable Q-factor wavelet transform and multi-domain feature extraction.

Yabing Li, Xinglong Dong

Full text read
In one paragraph

Article in Frontiers in neuroscience, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Yabing LiSchool of Computer Science and Technology, Xi'an University of Posts and Telecommunications, Xi'an, Shaanxi, China.
Xinglong DongSchool of Computer Science and Technology, Xi'an University of Posts and Telecommunications, Xi'an, Shaanxi, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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

Indexed as

electroencephalogram (EEG)k-complexes detectionmulti-domain features extractionRUSBoosted tree modeltunable-Q factor wavelet transform

Identifiers

PMID36998730
PMCPMC10043251

What OpenQuestion holds

Textfull text, public
LicenceCC BY
measurements read26
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.