By Topic

Maximum likelihood training of probabilistic neural networks with rotationally related covariance matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. L. Streit ; Naval Undersea Warfare Center, Newport, RI, USA ; S. G. Greineder ; T. E. Luginbuhi

Maximum likelihood algorithms are available for training two fundamental kinds of Gaussian probabilistic neural networks (PNNs), called herein homoscedastic (“same scatter”) and heteroscedastic (“different scatter”) PNNs. These are the only PNNs in the literature having readily derived maximum likelihood training algorithms. A new kind of PNN is defined in this paper, and a maximum likelihood training algorithm is derived. This new PNN is called a strophoscedastic (“twisted scatter”) PNN to reflect the statistical character of its representation (as yet unnamed in the statistical literature). Structurally, in a sense made precise below, strophoscedastic PNNs fall between homoscedastic and heteroscedastic PNNs. Strophoscedastic PNNs are significant because they have a representational power similar to heteroscedastic PNNs and a parametric parsimony (and, hence, an inherent numerical stability) similar to homoscedastic PNNs

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:1 )

Date of Conference:

Nov/Dec 1995