Probabilistic Neural Networks with rotated kernel functions

1997 ◽  
pp. 379-384 ◽  
Author(s):  
Ingo Galleske ◽  
Juan Castellanos
Keyword(s):  
Neural Networks ◽  
Kernel Functions ◽  
Probabilistic Neural Networks

GENETIC OPTIMIZATION OF RADIAL BASIS PROBABILISTIC NEURAL NETWORKS

2004 ◽  
Vol 18 (08) ◽  
pp. 1473-1499 ◽  
Author(s):  
WEN-BO ZHAO ◽  
DE-SHUANG HUANG ◽  
JI-YAN DU ◽  
LI-MING WANG
Keyword(s):  
Neural Networks ◽  
Fitness Function ◽  
Kernel Functions ◽  
Least Square ◽  
Experimental Results ◽  
Gaussian Kernel ◽  
Benchmark Problems ◽  
Probabilistic Neural Networks ◽  
Radial Basis ◽  
Encoding Method

This paper discusses using genetic algorithms (GA) to optimize the structure of radial basis probabilistic neural networks (RBPNN), including how to select hidden centers of the first hidden layer and to determine the controlling parameter of Gaussian kernel functions. In the process of constructing the genetic algorithm, a novel encoding method is proposed for optimizing the RBPNN structure. This encoding method can not only make the selected hidden centers sufficiently reflect the key distribution characteristic in the space of training samples set and reduce the hidden centers number as few as possible, but also simultaneously determine the optimum controlling parameters of Gaussian kernel functions matching the selected hidden centers. Additionally, we also constructively propose a new fitness function so as to make the designed RBPNN as simple as possible in the network structure in the case of not losing the network performance. Finally, we take the two benchmark problems of discriminating two-spiral problem and classifying the iris data, for example, to test and evaluate this designed GA. The experimental results illustrate that our designed GA can significantly reduce the required hidden centers number, compared with the recursive orthogonal least square algorithm (ROLSA) and the modified K-means algorithm (MKA). In particular, by means of statistical experiments it was proved that the optimized RBPNN by our designed GA, have still a better generalization performance with respect to the ones by the ROLSA and the MKA, in spite of the network scale having been greatly reduced. Additionally, our experimental results also demonstrate that our designed GA is also suitable for optimizing the radial basis function neural networks (RBFNN).

Off-line classification of Polish vowel spectra using artificial neural networks

2004 ◽  
Vol 34 (1) ◽  
pp. 37-52
Author(s):  
Wiktor Jassem ◽  
Waldemar Grygiel
Keyword(s):  
Neural Networks ◽  
Numerical Data ◽  
Word List ◽  
Original Data ◽  
Data Matrix ◽  
Probabilistic Neural Networks ◽  
Independent Variable ◽  
The Individual ◽  
Vowel Phoneme

The mid-frequencies and bandwidths of formants 1–5 were measured at targets, at plus 0.01 s and at minus 0.01 s off the targets of vowels in a 100-word list read by five male and five female speakers, for a total of 3390 10-variable spectrum specifications. Each of the six Polish vowel phonemes was represented approximately the same number of times. The 3390* 10 original-data matrix was processed by probabilistic neural networks to produce a classification of the spectra with respect to (a) vowel phoneme, (b) identity of the speaker, and (c) speaker gender. For (a) and (b), networks with added input information from another independent variable were also used, as well as matrices of the numerical data appropriately normalized. Mean scores for classification with respect to phonemes in a multi-speaker design in the testing sets were around 95%, and mean speaker-dependent scores for the phonemes varied between 86% and 100%, with two speakers scoring 100% correct. The individual voices were identified between 95% and 96% of the time, and classifications of the spectra for speaker gender were practically 100% correct.

Dolomitization geometry and reservoir quality from supervised Bayesian classification and probabilistic neural networks: Midland Basin Leonardian Wichita and Clear Fork Formations

2021 ◽  
Vol 9 (2) ◽  
pp. T585-T598
Author(s):  
Abidin B. Caf ◽  
John D. Pigott
Keyword(s):  
Neural Networks ◽  
Acoustic Impedance ◽  
Probability Distributions ◽  
A Priori ◽  
Bayesian Classification ◽  
Reservoir Quality ◽  
3D Seismic ◽  
Probabilistic Neural Networks ◽  
Neutron Porosity ◽  
Seismic Scale

Extensive dolomitization is prevalent in the platform and periplatform carbonates in the Lower-Middle Permian strata in the Midland and greater Permian Basin. Early workers have found that the platform and shelf-top carbonates were dolomitized, whereas slope and basinal carbonates remained calcitic, proposing a reflux dolomitization model as the possible diagenetic mechanism. More importantly, they underline that this dolomitization pattern controls the porosity and forms an updip seal. These studies are predominately conducted using well logs, cores, and outcrop analogs, and although exhibiting high resolution vertically, such determinations are laterally sparse. We have used supervised Bayesian classification and probabilistic neural networks (PNN) on a 3D seismic volume to create an estimation of the most probable distribution of dolomite and limestone within a subsurface 3D volume petrophysically constrained. Combining this lithologic information with porosity, we then illuminate the diagenetic effects on a seismic scale. We started our workflow by deriving lithology classifications from well-log crossplots of neutron porosity and acoustic impedance to determine the a priori proportions of the lithology and the probability density functions calculation for each lithology type. Then, we applied these probability distributions and a priori proportions to 3D seismic volumes of the acoustic impedance and predicted neutron porosity volume to create a lithology volume and probability volumes for each lithology type. The acoustic impedance volume was obtained by model-based poststack inversion, and the neutron porosity volume was obtained by the PNN. Our results best supported a regional reflux dolomitization model, in which the porosity is increasing from shelf to slope while the dolomitization is decreasing, but with sea-level forcing. With this study, we determined that diagenesis and the corresponding reservoir quality in these platforms and periplatform strata can be directly imaged and mapped on a seismic scale by quantitative seismic interpretation and supervised classification methods.

scholarly journals Computing Discrete Adriatic Indices of Probabilistic Neural Network

2020 ◽  
Vol 13 (5) ◽  
pp. 1149-1161
Author(s):  
T Deepika ◽  
V. Lokesha
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Topological Index ◽  
Probabilistic Neural Network ◽  
Topological Indices ◽  
Probabilistic Neural Networks ◽  
Mathematical Chemistry ◽  
International Academy

A Topological index is a numeric quantity which characterizes the whole structure of a graph. Adriatic indices are also part of topological indices, mainly it is classified into two namely extended variables and discrete adriatic indices, especially, discrete adriatic indices are analyzed on the testing sets provided by the International Academy of Mathematical Chemistry (IAMC) and it has been shown that they have good presaging substances in many compacts. This contrived attention to compute some discrete adriatic indices of probabilistic neural networks.

Sign in / Sign up

Export Citation Format

Share Document