Abstract:
It is shown that frequency sensitive competitive learning (FSCL), one version of the recently improved competitive learning (CL) algorithms, significantly deteriorates in...Show MoreMetadata
Abstract:
It is shown that frequency sensitive competitive learning (FSCL), one version of the recently improved competitive learning (CL) algorithms, significantly deteriorates in performance when the number of units is inappropriately selected. An algorithm called rival penalized competitive learning (RPCL) is proposed. In this algorithm, not only is the winner unit modified to adapt to the input for each input, but its rival (the 2nd winner) is delearned by a smaller learning rate. RPCL can be regarded as an unsupervised extension of Kohonen's supervised LVQ2. RPCL has the ability to automatically allocate an appropriate number of units for an input data set. The experimental results show that RPCL outperforms FSCL when used for unsupervised classification, for training a radial basis function (RBF) network, and for curve detection in digital images.<>
Published in: IEEE Transactions on Neural Networks ( Volume: 4, Issue: 4, July 1993)
DOI: 10.1109/72.238318
References is not available for this document.
Select All
1.
P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach, U.K., London:Prentice-Hall, 1982.
2.
J. Makhoul, S. Rpucos and H. Gish, "Vector quantization in speech coding", Proc. IEEE, vol. 73, no. 11, pp. 1551-1558, 1985.
3.
N. Nasrabadi and R. A. King, "Image coding using vector quantization: A review", IEEE Trans. Commun, vol. 36, no. 8, pp. 957-971, 1988.
4.
J. Moody and C. Darken, "Fast learning in networks of locally tuned processing units", Neural Computation, vol. 1, pp. 281-294, 1989.
5.
T. Poggio and F. Girosi, "Regularizaron algorithms for learning that are equivalent to multilayer networks", Science, vol. 247, pp. 978-982, 1990.
6.
S. J. Nowlan and G. E. Hinton, "Evaluation of adaptive mixtures of competing experts" in Advances in Neural Information Processing System 3, CA, San Mateo:Morgan Kaufman, pp. 774-780, 1991.
7.
D. E. Rumelhart and D. Zipser, "Feature discovery by competitive learning", Cognitive Science, vol. 9, pp. 75-112, 1985.
8.
S. Grossberg, "Competitive learning: from iterative activation to adaptive resonance", Cognitive Science, vol. 11, pp. 23-63, 1987.
9.
R. Hecht-Nielsen, "Counterpropagatíon networks", Appl. Opt., vol. 26, pp. 4979-4984, 1987.
10.
S. Grossberg, "Adaptive patten classification and universal recording: I. parallel development and coding of neural feature detectors", Biol. Cybern., vol. 23, pp. 121-134, 1976.
11.
G. A. Carpenter and S. Grossberg, "A massively parallel architecture for a self-organizing neural pattern recognition machine", Computer Vision Graphics and Image Processing, vol. 37, pp. 54-115, 1987.
12.
G. A. Carpenter and S. Grossberg, "ART 2: Self-organization of stable category recognition codes for analog output patterns", Appl. Opt., vol. 26, pp. 4919-4930, 1987.
13.
G. A. Carpenter and S. Grossberg, "ART 3: Hierarchical searching using chemical transmitters in self-organizing pattern recognition architectures", Neural Networks, vol. 3, pp. 129-152, 1990.
14.
T. Kohonen, Self-Organization and Associative Memory, Berlin:Springer-Verlag, 1988.
15.
T. Kohonen, "The self-organizing map", Proc. IEEE, vol. 78, pp. 1464-1480, 1990.
16.
R. P. Lippmann, "An introduction to computing with neural nets", IEEE ASSP Mag., pp. 4-22, Apr. 1987.
17.
E. L. Bienenstock, L. N. Cooper and P. W. Munro, "Theory for the development of neuron selectivity: orientation specificity and binocular interaction in visual cortex", J. Neuroscience, vol. 2, pp. 32-48, 1982.
18.
D. Desieno, "Adding a conscience to competitive learning", Proc. IEEE Int. Conf. Neural Networks, vol. I, pp. 117-124, 1988.
19.
S. C. Ahalt, A. K. Krishnamurty, P. Chen and D. E. Melton, "Competitive learning algorithms for vector quantization", Neural Networks, vol. 3, pp. 277-291, 1990.
20.
L. Xu, E. Oja and C. Y. Suen, "Modified Hebbian learning for curve and surface fitting", Neural Networks, vol. 5, pp. 441-457, 1992.
21.
H. Robbins and S. Monro, "A stochastic approximation method", Ann. Math. Stat., vol. 22, pp. 400-407, 1951.
22.
L. Xu, E. Oja and P. Kultanen, "A new curve detection methods: Randomized Hough Transform (RHT)", Pattern Recognition Letters, vol. 11, no. 5, pp. 331-338, 1990.
23.
L. Xu and E. Oja, Extended self-organizing map for curve detection, Sept. 1989.
24.
J. Canny, "A computational approach to edge detection", IEEE Trans. Patt. Anal. Machine Intell., vol. 8, pp. 679-698, 1986.
25.
D. Marr and E. Hildreth, "Theory of edge detection", Proc. Roy. Soc. London B, vol. 207, pp. 187-217, 1980.
26.
J. Hertz, A. Krogh and R. G. Palmer, introduction to Theory of Neural Computation, New York:Addison-Wesley, 1991.
