论文信息 - Improved Representation-burden Conservation Network for Learning Non-stationary VQ

Improved Representation-burden Conservation Network for Learning Non-stationary VQ

In a recent publication [1], it was shown that a biologically plausible RCN (Representation-burden Conservation Network) in which conservation is achieved by bounding the summed representation-burden of all neurons at constant 1, is effective in learning stationary vector quantization. Based on the conservation principle, a new approach for designing a dynamic RCN for processing both stationary and non-stationary inputs is introduced in this paper. We show that, in response to the input statistics changes, dynamic RCN improves its original counterpart in incremental learning capability as well as in self-organizing the network structure. Performance comparisons between dynamic RCN and other self-development models are also presented. Simulation results show that dynamic RCN is very effective in training a near-optimal vector quantizer in that it manages to keep a balance between the equiprobable and equidistortion criterion.

Jung-Hua Wang | Wei-Der Sun

[1] Stanley C. Ahalt,et al. Competitive learning algorithms for vector quantization , 1990, Neural Networks.

[2] Bernd Fritzke. Growing Grid — a self-organizing network with constant neighborhood range and adaptation strength , 1995, Neural Processing Letters.

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

[4] Yasuo Matsuyama. Harmonic competition: a self-organizing multiple criteria optimization , 1996, IEEE Trans. Neural Networks.

[5] Teuvo Kohonen,et al. Self-organization and associative memory: 3rd edition , 1989 .

[6] Bernd Fritzke,et al. Growing cell structures--A self-organizing network for unsupervised and supervised learning , 1994, Neural Networks.

[7] Teuvo Kohonen,et al. Self-Organization and Associative Memory , 1988 .

[8] Juang-Hua Wang,et al. Representation-burden Conservation Network Applied to Learning VQ (NPL270) , 2004, Neural Processing Letters.

[9] Sang-Hui Park,et al. Self-creating and organizing neural networks , 1994, IEEE Trans. Neural Networks.

[10] Stanley C. Ahalt,et al. Codeword distribution for frequency sensitive competitive learning with one-dimensional input data , 1996, IEEE Trans. Neural Networks.