DocumentCode
328272
Title
Complexity bounds of emerging structures in self-organizing networks
Author
Hoffmann, Achim G.
Author_Institution
Sch. of Comput. Sci. & Eng., New South Wales Univ., Kensington, NSW, Australia
Volume
1
fYear
1993
fDate
25-29 Oct. 1993
Firstpage
475
Abstract
The idea of self-organizing systems is to acquire a meaningful internal structure just by being exposed to some ´natural´ environment. Due to the complex network dynamics it appears very hard to analyze the structures that may emerge in such a system. Results on the complexity of classification functions and the preconditions necessary in order to allow the computation of such functions are presented.
Keywords
pattern classification; self-organising feature maps; classification functions; complex network dynamics; complexity bounds; emerging structures; meaningful internal structure; preconditions; self-organizing networks; Australia; Complex networks; Computer science; Electronic mail; Feature extraction; Feedback; Information resources; Intelligent networks; Neurons; Self-organizing networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on
Print_ISBN
0-7803-1421-2
Type
conf
DOI
10.1109/IJCNN.1993.713957
Filename
713957
Link To Document