Performance Of Probabilistic Neural Network Research Articles

A Novel Transformers Fault Diagnosis Method Based on Probabilistic Neural Network and Bio-Inspired Optimizer.

Since it is difficult for the traditional fault diagnosis method based on dissolved gas analysis (DGA) to meet today’s engineering needs in terms of diagnostic accuracy and stability, this paper proposes an artificial intelligence fault diagnosis method based on a probabilistic neural network (PNN) and bio-inspired optimizer. The PNN is used as the basic classifier of the fault diagnosis model, and the bio-inspired optimizer, improved salp swarm algorithm (ISSA), is used to optimize the hidden layer smoothing factor of PNN, which stably improves the classification performance of PNN. Compared with the traditional SSA, the sine cosine algorithm (SCA) and disruption operator are introduced in ISSA, which effectively improves the exploration capability and convergence speed. To verify the engineering applicability of the proposed method, the ISSA-PNN model was developed and tested using sensor data provided by Jiangxi Province Power Supply Company. In addition, the method is compared with machine learning methods such as support vector machine (SVM), back propagation neural network (BPNN), multi-layer perceptron (MLP), and traditional fault diagnosis methods such as the international electrotechnical commission (IEC) ratio method. The results show that the proposed method has a strong learning ability for complex fault data and has advantages in accuracy and robustness compared to other methods.

$$\beta$$-Hill climbing algorithm with probabilistic neural network for classification problems

Classification is a crucial step in the data mining field. The probabilistic neural network (PNN) is an efficient method developed for classification problems. The success factor of using PNN for classification problems implies in finding the proper weight during classification process. The main goal of this paper is to improve the performance of PNN by finding the best weight for the PNN using the recent local search approach called $$\beta$$ -hill-climbing ( $$\beta$$ -HC) optimizer. This algorithm is an extension version of the traditional hill climbing algorithm in that it uses a stochastic operator to avoid local optima. The proposed approach is evaluated against 11 benchmark datasets ,and the experimental results showed that the proposed $$\beta$$ -HC with PNN approach performed better in terms of classification accuracy than the original PNN, HC-PNN and other six well-established approaches using the same experimented benchmarks.

BA-PNN-based methods for power transformer fault diagnosis

This paper presents a machine learning-based approach to power transformer fault diagnosis based on dissolved gas analysis (DGA), a bat algorithm (BA), optimizing the probabilistic neural network (PNN). PNN is a radial basis function feedforward neural network based on Bayesian decision theory, which has a strong fault tolerance and significant advantages in pattern classification. However, one challenge still remains: the performance of PNN is greatly affected by its hidden layer element smooth factor which impacts the classification performance. The proposed approach addresses this challenge by deploying the BA algorithm, a kind of bio-inspired algorithm to optimize PNN. Using the real data collected from a transformer system, we conducted the experiments for validating the performance of the developed method. The experimental results demonstrated that BA is an effective algorithm for optimizing PNN smooth factor and BA-PNN can improve the fault diagnosis performance; in turn, and the machine learning-based model (BA-PNN) can significantly enhance the accuracies of power transformer fault diagnosis.

Sensitivity Analysis for Probabilistic Neural Network Structure Reduction.

In this paper, we propose the use of local sensitivity analysis (LSA) for the structure simplification of the probabilistic neural network (PNN). Three algorithms are introduced. The first algorithm applies LSA to the PNN input layer reduction by selecting significant features of input patterns. The second algorithm utilizes LSA to remove redundant pattern neurons of the network. The third algorithm combines the proposed two and constitutes the solution of how they can work together. PNN with a product kernel estimator is used, where each multiplicand computes a one-dimensional Cauchy function. Therefore, the smoothing parameter is separately calculated for each dimension by means of the plug-in method. The classification qualities of the reduced and full structure PNN are compared. Furthermore, we evaluate the performance of PNN, for which global sensitivity analysis (GSA) and the common reduction methods are applied, both in the input layer and the pattern layer. The models are tested on the classification problems of eight repository data sets. A 10-fold cross validation procedure is used to determine the prediction ability of the networks. Based on the obtained results, it is shown that the LSA can be used as an alternative PNN reduction approach.

PCM-SABRE: a platform for benchmarking and comparing outcome prediction methods in precision cancer medicine

BackgroundNumerous publications attempt to predict cancer survival outcome from gene expression data using machine-learning methods. A direct comparison of these works is challenging for the following reasons: (1) inconsistent measures used to evaluate the performance of different models, and (2) incomplete specification of critical stages in the process of knowledge discovery. There is a need for a platform that would allow researchers to replicate previous works and to test the impact of changes in the knowledge discovery process on the accuracy of the induced models.ResultsWe developed the PCM-SABRE platform, which supports the entire knowledge discovery process for cancer outcome analysis. PCM-SABRE was developed using KNIME. By using PCM-SABRE to reproduce the results of previously published works on breast cancer survival, we define a baseline for evaluating future attempts to predict cancer outcome with machine learning. We used PCM-SABRE to replicate previous work that describe predictive models of breast cancer recurrence, and tested the performance of all possible combinations of feature selection methods and data mining algorithms that was used in either of the works. We reconstructed the work of Chou et al. observing similar trends – superior performance of Probabilistic Neural Network (PNN) and logistic regression (LR) algorithms and inconclusive impact of feature pre-selection with the decision tree algorithm on subsequent analysis.ConclusionsPCM-SABRE is a software tool that provides an intuitive environment for rapid development of predictive models in cancer precision medicine.

Genome-enabled prediction using probabilistic neural network classifiers.

BackgroundMulti-layer perceptron (MLP) and radial basis function neural networks (RBFNN) have been shown to be effective in genome-enabled prediction. Here, we evaluated and compared the classification performance of an MLP classifier versus that of a probabilistic neural network (PNN), to predict the probability of membership of one individual in a phenotypic class of interest, using genomic and phenotypic data as input variables. We used 16 maize and 17 wheat genomic and phenotypic datasets with different trait-environment combinations (sample sizes ranged from 290 to 300 individuals) with 1.4 k and 55 k SNP chips. Classifiers were tested using continuous traits that were categorized into three classes (upper, middle and lower) based on the empirical distribution of each trait, constructed on the basis of two percentiles (15–85 % and 30–70 %). We focused on the 15 and 30 % percentiles for the upper and lower classes for selecting the best individuals, as commonly done in genomic selection. Wheat datasets were also used with two classes. The criteria for assessing the predictive accuracy of the two classifiers were the area under the receiver operating characteristic curve (AUC) and the area under the precision-recall curve (AUCpr). Parameters of both classifiers were estimated by optimizing the AUC for a specific class of interest.ResultsThe AUC and AUCpr criteria provided enough evidence to conclude that PNN was more accurate than MLP for assigning maize and wheat lines to the correct upper, middle or lower class for the complex traits analyzed. Results for the wheat datasets with continuous traits split into two and three classes showed that the performance of PNN with three classes was higher than with two classes when classifying individuals into the upper and lower (15 or 30 %) categories.ConclusionsThe PNN classifier outperformed the MLP classifier in all 33 (maize and wheat) datasets when using AUC and AUCpr for selecting individuals of a specific class. Use of PNN with Gaussian radial basis functions seems promising in genomic selection for identifying the best individuals. Categorizing continuous traits into three classes generally provided better classification than when using two classes, because classification accuracy improved when classes were balanced.Electronic supplementary materialThe online version of this article (doi:10.1186/s12864-016-2553-1) contains supplementary material, which is available to authorized users.

The Impact of Oversampling with SMOTE on the Performance of 3 Classifiers in Prediction of Type 2 Diabetes.

To evaluate the impact of the synthetic minority oversampling technique (SMOTE) on the performance of probabilistic neural network (PNN), naïve Bayes (NB), and decision tree (DT) classifiers for predicting diabetes in a prospective cohort of the Tehran Lipid and Glucose Study (TLGS). . Data of the 6647 nondiabetic participants, aged 20 years or older with more than 10 years of follow-up, were used to develop prediction models based on 21 common risk factors. The minority class in the training dataset was oversampled using the SMOTE technique, at 100%, 200%, 300%, 400%, 500%, 600%, and 700% of its original size. The original and the oversampled training datasets were used to establish the classification models. Accuracy, sensitivity, specificity, precision, F-measure, and Youden's index were used to evaluated the performance of classifiers in the test dataset. To compare the performance of the 3 classification models, we used the ROC convex hull (ROCCH). Oversampling the minority class at 700% (completely balanced) increased the sensitivity of the PNN, DT, and NB by 64%, 51%, and 5%, respectively, but decreased the accuracy and specificity of the 3 classification methods. NB had the best Youden's index before and after oversampling. The ROCCH showed that PNN is suboptimal for any class and cost conditions. To determine a classifier with a machine learning algorithm like the PNN and DT, class skew in data should be considered. The NB and DT were optimal classifiers in a prediction task in an imbalanced medical database.

Discrimination of acidic and alkaline enzyme using Chou's pseudo amino acid composition in conjunction with probabilistic neural network model.

Enzyme catalysis is one of the most essential and striking processes among of all the complex processes that have evolved in living organisms. Enzymes are biological catalysts, which play a significant role in industrial applications as well as in medical areas, due to profound specificity, selectivity and catalytic efficiency. Refining catalytic efficiency of enzymes has become the most challenging job of enzyme engineering, into acidic and alkaline. Discrimination of acidic and alkaline enzymes through experimental approaches is difficult, sometimes impossible due to lack of established structures. Therefore, it is highly desirable to develop a computational model for discriminating acidic and alkaline enzymes from primary sequences. In this study, we have developed a robust, accurate and high throughput computational model using two discrete sample representation methods Pseudo amino acid composition (PseAAC) and split amino acid composition. Various classification algorithms including probabilistic neural network (PNN), K-nearest neighbor, decision tree, multi-layer perceptron and support vector machine are applied to predict acidic and alkaline with high accuracy. 10-fold cross validation test and several statistical measures namely, accuracy, F-measure, and area under ROC are used to evaluate the performance of the proposed model. The performance of the model is examined using two benchmark datasets to demonstrate the effectiveness of the model. The empirical results show that the performance of PNN in conjunction with PseAAC is quite promising compared to existing approaches in the literature so for. It has achieved 96.3% accuracy on dataset1 and 99.2% on dataset2. It is ascertained that the proposed model might be useful for basic research and drug related application areas.

HHT-based classification of composite power quality events

Purpose – An electrical power system is expected to deliver undistorted sinusoidal, rated voltage and current continuously to the end-users. The problem of power quality (PQ) occurs when there is (are) deviation(s) in voltage and/or current which cause(s) failure or mal-operation of the customer's equipments. Various methods are suggested to detect and classify single PQ event in a power system, the performance of such methods to classify composite PQ events is limited. The purpose of this paper is the classification of composite PQ events in emerging power systems. Design/methodology/approach – This paper proposes an effective method to classify composite PQ events using Hilbert Huang transform (HHT). The performance of probabilistic neural network (PNN) classifier and support vector machine (SVM) classifier to efficiently classify composite PQ events is compared. Findings – The features extracted from HHT are simple yet effective. SVMs and PNN classifiers are used for PQ classification. It is found that PNN classifier outperforms SVM with the classification accuracy of 100 percent. Originality/value – Different PQ signals used for analysis are generated by simulating a practical distribution system of an Indian academic institution.

The Application of Probabilistic Neural Network in Speech Recognition Based on Partition Clustering

A probabilistic neural network (PNN) speech recognition model based on the partition clustering algorithm is proposed in this paper. The most important advantage of PNN is that training is easy and instantaneous. Therefore, PNN is capable of dealing with real time speech recognition. Besides, in order to increase the performance of PNN, the selection of data set is one of the most important issues. In this paper, using the partition clustering algorithm to select data is proposed. The proposed model is tested on two data sets from the field of spoken Arabic numbers, with promising results. The performance of the proposed model is compared to single back propagation neural network and integrated back propagation neural network. The final comparison result shows that the proposed model performs better than the other two neural networks, and has an accuracy rate of 92.41%.

PARTICLE SWARM OPTIMIZATION-BASED FEATURE SELECTION AND PARAMETER OPTIMIZATION FOR POWER SYSTEM DISTURBANCES CLASSIFICATION

In many data mining applications that address classification problems, feature and model selection are considered as key tasks. The appropriate input features of the classifier are selected from a given set of possible features, and the structure parameters of the classifier are adapted with respect to these features and a given dataset. This paper describes the particle swarm optimization algorithm (PSO) that performs feature and model selection simultaneously for the probabilistic neural network (PNN) classifier for power system disturbances. The probabilistic neural network is one of the successful classifiers used to solve many classification problems. However, the computational effort and storage requirement of the PNN method will prohibitively increase as the number of patterns used in the training set increases. An important issue that has not been given enough attention is the selection of a “spread parameter,” also called a “smoothing parameter,” in the PNN classifier. PSO is a powerful meta-heuristic technique in the artificial intelligence field; therefore, this study proposes a PSO-based approach, called PSO-PNN, to specify the beneficial features and the value of spread parameter to enhance the performance of PNN. The experimental results indicate that the proposed PSO-based approach significantly improves the classification accuracy with the discriminating input features for PNN.

Empirical mode decomposition with Hilbert transform for classification of voltage sag causes using probabilistic neural network

This paper employs Empirical Mode Decomposition (EMD) combined with Hilbert Transform (HT) to detect the voltage sag causes. Any power quality disturbance waveform can be seen as superimposition of various oscillating modes. It becomes necessary to separate different components of single frequency or narrow band of frequencies from a non-stationary signal to identify the causes which contribute to power quality disturbances. The main characteristic feature of EMD is that it decomposes a non-stationary signal into mono component and symmetric signals called Intrinsic Mode Functions (IMFs). Further, the Hilbert transform is applied to each IMF to extract the features. Then, Probabilistic Neural Network (PNN) classifier is constructed based on EMD which classifies these extracted features to identify the type of voltage sag cause. Three voltage sag causes are taken for classification (i) fault induced voltage sag, (ii) starting of induction motor and (iii) three phase transformer energization. A comparison of EMD with Wavelet Transform (WT) is made. The performance of PNN is compared with Multilayer Neural Network (MLNN) based on the above mentioned two methods. Simulation results show that the EMD method in combination with PNN is more efficient in classifying the voltage sag causes.

Simulation And Auditing Of Network Security Based On Probabilistic Neural Network Approach

: Probabilistic Neural Network approach used for mobile adhoc network is more efficient way to estimate the network security. In this paper, we are using an Adhoc On Demand Distance Vector (AODV) protocol based mobile adhoc network. In our Proposed Method we are considering the multiple characteristics of nodes. In this we use all the parameter that is necessary in AODV. For simulation purpose we use the probabilistic neural network approach that gives more efficient and accurate results as comparison to the clustering algorithm in the previous systems was used. The performance of PNN (probabilistic neural network) approach is improved for identifying the particular attack like as wormholes, black holes and selfish

An improved application technique of the adaptive probabilistic neural network for predicting concrete strength

Recently, the probabilistic neural network (PNN) has been applied to the prediction of concrete compressive strength. PNN has the advantage over the conventional neural networks (NN) by utilizing lesser time in determining the network architecture and in training. Moreover, PNN yields probabilistic viewpoints and deterministic classification results. However, an important factor in the estimation results, the smoothing parameter, is a user-defined constant and deciding its value is a crucial part of the procedure. Its value affects prediction results significantly. Therefore, an improved application technique of PNN that does not utilize user-defined values for the smoothing parameter is presented. The proposed method called adaptive probabilistic neural network (APNN) uses the dynamic decay adjustment (DDA) algorithm to automatically calculate the smoothing parameter. Also, the estimation performance of PNN is improved by considering the correlation between the input data and the target output values. To evaluate the efficiency of the proposed method, the predicted strengths are compared with actual concrete compression test results as well as with the results obtained by the conventional PNN. The proposed technique proves to effectively estimate realistic values of concrete compressive strengths better than the conventional PNN.

Detection and Classification of Power Quality Disturbances Using S-Transform and Probabilistic Neural Network

This paper presents an S-Transform based probabilistic neural network (PNN) classifier for recognition of power quality (PQ) disturbances. The proposed method requires less number of features as compared to wavelet based approach for the identification of PQ events. The features extracted through the S-Transform are trained by a PNN for automatic classification of the PQ events. Since the proposed methodology can reduce the features of the disturbance signal to a great extent without losing its original property, less memory space and learning PNN time are required for classification. Eleven types of disturbances are considered for the classification problem. The simulation results reveal that the combination of S-Transform and PNN can effectively detect and classify different PQ events. The classification performance of PNN is compared with a feedforward multilayer (FFML) neural network (NN) and learning vector quantization (LVQ) NN. It is found that the classification performance of PNN is better than both FFML and LVQ.

Novel Approaches to Probabilistic Neural Networks Through Bagging and Evolutionary Estimating of Prior Probabilities

In this contribution, novel approaches are proposed for the improvement of the performance of Probabilistic Neural Networks as well as the recently proposed Evolutionary Probabilistic Neural Networks. The Evolutionary Probabilistic Neural Network's matrix of spread parameters is allowed to have different values in each class of neurons, resulting in a more flexible model that fits the data better and Particle Swarm Optimization is also employed for the estimation of the Probabilistic Neural Networks's prior probabilities of each class. Moreover, the bagging technique is used to create an ensemble of Evolutionary Probabilistic Neural Networks in order to further improve the model's performance. The above approaches have been applied to several well-known and widely used benchmark problems with promising results.

Estimation of Concrete Strength Using Improved Probabilistic Neural Network Method

The compressive strength of concrete is commonly used criterion in producing concrete. However, the tests on the compressive strength are complicated and time-consuming. More importantly, it is too late to make improvement even if the test result does not satisfy the required strength, since the test is usually performed at the 28th day after the placement of concrete at the construction site. Therefore, accurate and realistic strength estimation before the placement of concrete is being highly required. In this study, the estimation of the compressive strength of concrete was performed by probabilistic neural network(PNN) on the basis of concrete mix proportions. The estimation performance of PNN was improved by considering the correlation between input data and targeted output value. Improved probabilistic neural network was proposed to automatically calculate the smoothing parameter in the conventional PNN by using the scheme of dynamic decay adjustment (DDA) algorithm. The conventional PNN and the PNN with DDA algorithm(IPNN) were applied to predict the compressive strength of concrete using actual test data of two concrete companies. IPNN showed better results than the conventional PNN in predicting the compressive strength of concrete.

A new method of reducing network complexity in probabilistic neural network for target identification

The performance of Probabilistic Neural Network (PNN) in object identification has been investigated with reduced complexity retaining its remarkable recognition accuracy. A new method has been proposed to reduce the network complexity in PNN by performing the harmonics mean, geometry mean, arithmetic mean and root mean square values on the training samples. The simulation results have proven a significant improvement in network complexity reduction in PNN while maintaining the recognition accuracy. This would greatly enhance the applicability of PNNs.

Application of probabilistic neural network in the clinical diagnosis of cancers based on clinical chemistry data

As a recently developed and powerful classification tool, probabilistic neural network was used to distinguish cancer patients from healthy persons according to the levels of nucleosides in human urine. Two datasets (containing 32 and 50 patterns, respectively) were investigated and the total consistency rate obtained was 100% for dataset 1 and 94% for dataset 2. To evaluate the performance of probabilistic neural network, linear discriminant analysis and learning vector quantization network were also applied to the classification problem. The results showed that the predictive ability of the probabilistic neural network is stronger than the others in this study. Moreover, the recognition rate for dataset 2 can achieve to 100% if combining these three methods together, which indicated the promising potential of clinical diagnosis by combining different methods.

A comparison of neural network performance for seismic phase identification

Traditional techniques of analysis and interpretation of seismic events involve a series of complex steps involving sophisticated signal processing as well as many manual tasks. Automating each of these steps is an important goal of this ongoing research. The paper discusses the use of neural networks in performing phase identification, namely the discrimination of distinct seismic waves within a seismogram. The scope is further restricted to the identification of only two of the regional principal phases, Pg and Lg, among the signals collected in the western United States. Using a database of 75 earthquakes and 75 underground nuclear explosions, the performance of several types of neural networks was compared. The performance of probabilistic neural network (PNN), radial basis function (RBF) network and learning vector quantization (LVQ) network is compared with a back-propagation network that combines the conjugate-gradient method with a weight-elimination strategy. The results indicate that the latter outperformed all other methods tested.