ABOUT THE KOHONEN ALGORITHM - STRONG OR WEAK SELF-ORGANIZATION

Authors
FORT JC PAGES G
Citation
Jc. Fort et G. Pages, ABOUT THE KOHONEN ALGORITHM - STRONG OR WEAK SELF-ORGANIZATION, Neural networks, 9(5), 1996, pp. 773-785
Citations number
18
Categorie Soggetti
Mathematical Methods, Biology & Medicine","Computer Sciences, Special Topics","Computer Science Artificial Intelligence",Neurosciences,"Physics, Applied
Journal title
Neural networks → ACNP
ISSN journal
08936080
Volume
9
Issue
5
Year of publication
1996
Pages
773 - 785
Database
ISI
SICI code
0893-6080(1996)9:5<773:ATKA-S>2.0.ZU;2-S
Abstract
The question of self-organization for the Kohonen algorithm is investi gated. First the notions of organized states, weak and strong self-org anizations are precisely defined. Then, combining mathematical and sim ulation results we prove that the Kohonen algorithm has not the strong self-organization property at least in two well-known cases: the stim uli space is [0, 1](2), the unit set is a line (resp. a grid) with the two nearest (resp. eight nearest) neighbourhood function. Copyright ( C) 1996 Elsevier Science Ltd