Skip to content
naulon
Not checkedNot checked for notices yet.

Diagnosis of Chronic Obstructive Pulmonary Disease Based on Transfer Learning

Qian Wang, Hong Wang, Lutong Wang and 1 more

IEEE Access · 2020

doi:10.1109/access.2020.2979218 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Chronic obstructive pulmonary disease (COPD) is a chronic respiratory disease that seriously endangers human health and has high incidence and mortality worldwide. Therefore, an effective predictive model is required for COPD diagnosis. Given the limited data samples available in current COPD studies, we propose a method for diagnosing COPD based on transfer learning called balanced probability distribution (BPD) algorithm; this algorithm integrates instance- and feature-based transfers to improve the prediction accuracy of the model. First, instance-based cascaded transfer learning was used to initialize the weight distribution of the training data and obtain instances closer to the target domain. Second, the cross-domain feature filtering algorithm was adopted to filter irrelevant features, eliminate redundant features, and obtain the co-occurrence features of the source and target domains. Moreover, the remaining features were assigned different weights and transformed into the same space to reduce the distribution difference between the domains. Third, the BPD algorithm was used to balance the examples and the co-occurrence features from multiple disease source domains and construct a more suitable classification model of the target domain. Finally, the elastic network was used to further improve the generalization performance of the model. The experimental results show that the prediction effect of the BPD model is better than that of state-of-the-art methods and has strong generalization ability and robustness. We proved that our proposed BPD method works well in the COPD prediction model when the sample size is small.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.