On-line evolutionary learning of NN-MLP based on the attentional learning concept

To design the nearest neighbor based multilayer perceptron (NN-MLP) efficiently, the author has proposed a new evolutionary learning algorithm called the R/sup 4/-rule. For off-line learning, the R/sup 4/-rule can produce the smallest or nearly smallest networks with high generalization ability by iteratively performing four basic operations: recognition, remembrance, reduction and review. To apply the algorithm to on-line evolutionary learning of NN-MLP, this paper proposes some improvements for the R/sup 4/-rule based on the attentional learning concept. The performance of the improved algorithm is verified by experimental results.

[1]  F. Girosi,et al.  Networks for approximation and learning , 1990, Proc. IEEE.

[2]  Stephen Grossberg,et al.  The ART of adaptive pattern recognition by a self-organizing neural network , 1988, Computer.

[3]  Teuvo Kohonen,et al.  The self-organizing map , 1990 .

[4]  Nirmal K. Bose,et al.  Neural network design using Voronoi diagrams , 1993, IEEE Trans. Neural Networks.

[5]  O. J. Murphy,et al.  Nearest neighbor pattern classification perceptrons , 1990, Proc. IEEE.

[6]  Tatsuo Higuchi,et al.  Evolutionary learning of nearest-neighbor MLP , 1996, IEEE Trans. Neural Networks.

[7]  G. Gates,et al.  The reduced nearest neighbor rule (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[8]  Shlomo Geva,et al.  Adaptive nearest neighbor pattern classification , 1991, IEEE Trans. Neural Networks.

[9]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[10]  Peter E. Hart,et al.  The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.