Evidence map›Paper›PMID 34770537›Full record

ArticleSensors (Basel, Switzerland)2021

Automatic Detection of K-Complexes Using the Cohen Class Recursiveness and Reallocation Method and Deep Neural Networks with EEG Signals.

Catalin Dumitrescu, Ilona-Madalina Costea, Angel-Ciprian Cormos, Augustin Semenescu

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. 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

4 authors.

Catalin DumitrescuDepartment Telematics and Electronics for Transports, University "Politehnica" of Bucharest, 060042 Bucharest, Romania.ORCID 0000-0002-3882-5062
Ilona-Madalina CosteaDepartment Telematics and Electronics for Transports, University "Politehnica" of Bucharest, 060042 Bucharest, Romania.
Angel-Ciprian CormosDepartment Telematics and Electronics for Transports, University "Politehnica" of Bucharest, 060042 Bucharest, Romania.ORCID 0000-0002-7313-0952
Augustin SemenescuDepartment Engineering and Management for Transports, University "Politehnica" of Bucharest, 060042 Bucharest, Romania.ORCID 0000-0001-6864-3297

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Evoked and spontaneous K-complexes are thought to be involved in sleep protection, but their role as biomarkers is still under debate. K-complexes have two major functions: first, they suppress cortical arousal in response to stimuli that the sleeping brain evaluates to avoid signaling danger; and second, they help strengthen memory. K-complexes also play an important role in the analysis of sleep quality, in the detection of diseases associated with sleep disorders, and as biomarkers for the detection of Alzheimer's and Parkinson's diseases. Detecting K-complexes is relatively difficult, as reliable methods of identifying this complex cannot be found in the literature. In this paper, we propose a new method for the automatic detection of K-complexes combining the method of recursion and reallocation of the Cohen class and the deep neural networks, obtaining a recursive strategy aimed at increasing the percentage of classification and reducing the computation time required to detect K-complexes by applying the proposed methods.

Indexed as

ElectroencephalographySleep StagesArousalNeural Networks, ComputerSleepclassificationCohen classdeep neural networksK-complexessleep disorderssleep stage

Identifiers

PMID34770537
PMCPMC8587652

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.