Abstract

The performance of kernel extreme learning machine based CSPAPA (KELM-CSPAPA) is proposed and studied. An adaptive density-based clustering algorithm (ADBC) is used to decompose the training dataset into multiple subsets. Furthermore, the improved flower pollination optimization algorithm (IFPA) is used to optimize the parameters of the KELM model. Initially, the performance of the ADBC algorithm is studied to estimate the optimal number of clusters using three different inputs. Then the KELM model is assessed with different machine learning models using various statistical indices. The time consumption of KELM for the colored noise and speech signal inputs are less compared to the white Gaussian noise input. Finally, a performance comparison of KELM-CSPAPA is presented with three benchmark algorithms: PAPA, block sparse PAPA (BS-PAPA), and CS-PAPA. The result shows that the proposed method outperformed existing algorithms. The simulation results demonstrate that KELM-CSPAPA fully exploits the sparsity and handled the clustered-sparse signal.

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