CoChat

Deep Learning on Computerized Analysis of Chronic Obstructive Pulmonary Disease

Open access
Altan, Gokhan, Kutlu, Yakup, Allahverdi, Novruz · 2020 · IEEE Journal of Biomedical and Health Informatics
Cited by 158

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

GOAL: Chronic obstructive pulmonary disease (COPD) is one of the deadliest diseases in the world. Because COPD is an incurable disease and requires considerable time to be diagnosed even by an experienced specialist, it becomes important to provide analysis abnormalities in simple ways. The aim of the study is comparing multiple machine learning algorithms for the early diagnosis of COPD using multi-channel lung sounds. METHODS: Deep learning is an efficient machine-learning algorithm, which comprises unsupervised training to reduce optimization and supervised training by a feature-based distribution of classification parameters. This study focuses on analyzing multichannel lung sounds using statistical features of frequency modulations that are extracted using the Hilbert-Huang transform. RESULTS: Deep learning algorithm was used in the classification stage of the proposed model to separate the patients with COPD and healthy subjects. The proposed DL model with the Hilbert-Huang transform based statistical features was successful in achieving high classification performance rates of 93.67%, 91%, and 96.33% for accuracy, sensitivity, and specificity, respectively. CONCLUSION: The proposed computerized analysis of the multi-channel lung sounds using DL algorithms provides a standardized assessment with high classification performance. SIGNIFICANCE: Our study is a pioneer study that directly focuses on the lung sounds to separate COPD and non-COPD patients. Analyzing 12-channel lung sounds gives the advantages of assessing the entire lung obstructions.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jbhi.2019.2931395

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Greedy layer-wise training of deep networks

    Bengio, Y., Lamblin, P., Popovici, D., & Larochelle, H. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0024 · Cited by 4,841 · cited 2×

    “The upper layers of the DBN represent features that are more abstract whereas the lower layers of the DBN learn simple features [1]–[3].”
    BackgroundMethod

Cited by

Metadata

Authors
Altan, G., Kutlu, Y., & Allahverdi, N.
Venue
IEEE Journal of Biomedical and Health Informatics
Published
2020-05
Volume
24
Issue
5
Pages
1344-1350
ISSN
  • 2168-2194 (ISSN-L)
  • 2168-2208
OpenAlex
W2964770898
Cited by
158
References
1
FWCI
10.05
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.