Optimization of the kernel functions in a probabilistic neural network analyzing the local pattern distribution.
This article proposes a procedure for the automatic determination of the elements of the covariance matrix of the gaussian kernel function of probabilistic neural networks. Two matrices, a rotation matrix and a matrix of variances, can be calculated by analyzing the local environment of each training pattern. The combination of them will form the covariance matrix of each training pattern. This automation has two advantages: First, it will free the neural network designer from indicating the complete covariance matrix, and second, it will result in a network with better generalization ability than the original model. A variation of the famous two-spiral problem and real-world examples from the UCI Machine Learning Repository will show a classification rate not only better than the original probabilistic neural network but also that this model can outperform other well-known classification techniques.
Galleske
I
I
Departmento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Spain. gingo@zipi.fi.upm.es
Castellanos
J
J
D016571:Neural Networks, Computer; D016011:Normal Distribution; D011336:Probability