Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

September 1994, Vol. 6, No. 5, Pages 927-943
(doi: 10.1162/neco.1994.6.5.927)
© 1994 Massachusetts Institute of Technology
Probabilistic Winner-Take-All Learning Algorithm for Radial-Basis-Function Neural Classifiers
Article PDF (727.22 KB)
Abstract

This paper proposes a new adaptive competitive learning algorithm called “the probabilistic winner-take-all.” The algorithm is based on a learning scheme developed by Agrawala within the statistical pattern recognition literature (Agrawala 1970). Its name stems from the fact that for a given input pattern once each competitor computes the probability of being the one that generated this pattern, the computed probabilities are utilized to probabilistically choose a winner. Then, only this winner is permitted to learn. The learning rule of the algorithm is derived for three different cases. Its properties are discussed and compared to those of two other competitive learning algorithms, namely the standard winner-take-all and the maximum-likelihood soft competition. Experimental comparison is also given. When all three algorithms are used to train the hidden layer of radial-basis-function classifiers, experiments indicate that classifiers trained with the probabilistic winner-take-all outperform those trained with the other two algorithms.