Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Galleske, I.
Right arrow Articles by Castellanos, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Galleske, I.
Right arrow Articles by Castellanos, J.
(Neural Computation. 2002;14:1183-1194.)
© 2002 The MIT Press


Letter

Optimization of the Kernel Functions in a Probabilistic Neural Network Analyzing the Local Pattern Distribution

I. Galleske

gingo{at}zipi.fi.upm.es, Departmento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Spain

J. Castellanos

jcastellanos{at}fi.upm.es, Departmento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Spain

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.




This article has been cited by other articles:


Home page
Neural Comput.Home page
M. Zhong, D. Coggeshall, E. Ghaneie, T. Pope, M. Rivera, M. Georgiopoulos, G. C. Anagnostopoulos, M. Mollaghasemi, and S. Richie
Gap-Based Estimation: Choosing the Smoothing Parameters for Probabilistic and General Regression Neural Networks
Neural Comput., October 1, 2007; 19(10): 2840 - 2864.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
T. Glasmachers and C. Igel
Gradient-Based Adaptation of General Gaussian Kernels
Neural Comput., October 1, 2005; 17(10): 2099 - 2105.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2002 by The MIT Press.