Abstract

This paper introduces an unsupervised learning algorithm for optimal training of competitive neural networks. The learning rule of this algorithm is derived from the minimization of a new objective criterion using the gradient descent technique. Its learning rate and competition difficulty are dynamically adjusted throughout iterations. Numerical results that illustrate the performance of this algorithm in unsupervised pattern classification and image compression are also presented, discussed, and compared to those provided by other well-known algorithms for several examples of real test data.

Keywords

Cite this article

@article{cai-544,
  author  = {Mohammed Madiafi and Abdelaziz Bouroumi},
  title   = {Dynamic Optimal Training for Competitive Neural Networks},
  journal = {Computing and Informatics},
  volume  = {33},
  number  = {2},
  pages   = {237--258},
  year    = {2014},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2014/2/dynamic-optimal-training-for-competitive-neural-networks/}
}
Download .bib