Abstract

The classification of Parkinson’s disease speech data is useful and popular. However, the existing public Parkinson’s disease(PD) speech datasets are characterized by small sample sizes, and the possible reason is that labeled speech data from PD patients are scarce. To solve the few-shot problem, a PD classification algorithm based on sparse kernel transfer learning combined with simultaneous sample and feature selection is proposed in this paper. Sparse kernel transfer learning is used to extract the effective structural information of PD speech features from public datasets as source domain data, and the fast alternating direction method of multipliers (ADMM) iteration is improved to enhance the information extraction performance. First, features are extracted from a public speech dataset to construct a feature dataset as the source domain. Then, the PD target domain, including the training and test datasets, is encoded by convolution sparse coding, which can extract more in-depth information. Next, simultaneous optimization is implemented. To further improve the classification performance, a convolution kernel optimization mechanism is designed. In the experimental section, two representative PD speech datasets are used for verification; the first dataset is a frequently used public dataset, and the second dataset is constructed by the authors. Over ten relevant algorithms are compared with the proposed method. The results show that the proposed algorithm achieves obvious improvements in terms of classification accuracy. The study also found that the improvements are considerable when compared with nontransfer learning approaches, demonstrating that the proposed transfer learning approach is more effective and has an acceptable time cost.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call