Bat algorithm-based weighted Laplacian probabilistic neural network

Abstract

Probabilistic neural network (PNN) is a single-pass feed-forward neural network with the capability of providing nonlinear decision boundaries. In this work, we propose the modifications to the existing PNN approach. Contributions are threefold: First, symmetric Laplace distribution has been used instead of Gaussian distribution in the pattern layer of the PNN approach. Second, a new weight coefficients’ estimation method has been introduced between the pattern and summation layers of PNN. Third, a novel convex fitness function has been designed for the bat algorithm to obtain an optimal smoothing parameter vector. The designed fitness function maintains a balance between the sensitivity and specificity values. The performance of the proposed algorithm “bat algorithm-based weighted Laplacian probabilistic neural network” is compared with that of conventional PNN, weighted PNN, extreme learning method, optimal pruned extreme learning machine and K-nearest neighbor. Experimental evaluation is carried out on eleven benchmark data sets using different performance measures such as accuracy, sensitivity, specificity and Youden’s index. The comparative performance evaluation of the proposed model has been made with the PNN, and other standard algorithms outperform the compared approaches in terms of classification accuracy. Friedman test is used for statistical evaluation of the proposed approach.