Refine
Document Type
- Preprint (2)
Language
- English (2)
Has Fulltext
- yes (2)
Keywords
- Neural networks (2) (remove)
Faculty / Organisational entity
Here the self-organization property of one-dimensional Kohonen's algorithm in its 2k-neighbour setting with a general type of stimuli distribution and non-increasing learning rate is considered. We prove that the probability of self-organization for all initial values of neurons is uniformly positive. For the special case of a constant learning rate, it implies that the algorithm self-organizes with probability one.