A GENERAL MEAN-BASED ITERATIVE WINNER-TAKE-ALL NEURAL-NETWORK

Citation
Jf. Yang et al., A GENERAL MEAN-BASED ITERATIVE WINNER-TAKE-ALL NEURAL-NETWORK, IEEE transactions on neural networks, 6(1), 1995, pp. 14-24
Citations number
14
Categorie Soggetti
Computer Application, Chemistry & Engineering","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
10459227
Volume
6
Issue
1
Year of publication
1995
Pages
14 - 24
Database
ISI
SICI code
1045-9227(1995)6:1<14:AGMIWN>2.0.ZU;2-H
Abstract
In this paper, a new iterative winner-take-all (WTA) neural network is developed and analyzed. The proposed WTA neural net with one-layer st ructure is established under the concept of the statistical mean. For three typical distributions of initial activations, the convergence be haviors of the existing and the proposed WTA neural nets are evaluated by theoretical analyses and Monte Carlo Simulations. We found that th e suggested WTA neural network on average requires fewer than Log2M it erations to complete a WTA process for the three distributed inputs, w here M is the number of competitors. Furthermore, the fault tolerances of the iterative WTA nets are analyzed and simulated. From the view p oints of convergence speed, hardware complexity, and robustness to the errors, the proposed WTA is suitable for various applications.