DocumentCode
2221786
Title
Evolutionary self-organizing map
Author
Chang, Maiga ; Yu, Horng-Jyh ; Heh, Jia-Sheng
Author_Institution
Dept. of Inf. & Comput. Eng., CYCU, Chungli, Taiwan
Volume
1
fYear
1998
fDate
4-8 May 1998
Firstpage
680
Abstract
Extending Kohonen´s SOM the paper proposes one kind of dynamically growing neural network, called evolutionary SOM (ESOM). Firstly, the output layer of the SOM is represented by a so-called neighborhood graph, where nodes are neurons´ weights and edges are the neighborhood relationships of SOM. Then two basic differentiation operations, node differentiation and edge differentiation, are proposed for network differentiation. As in nature´s evolution, each generation of ESOM includes several species of neural nets and the survivors of competition will differentiate to the next generation. This kind of evolution is implemented as two new modules of ESOM, in addition to Kohonen´s SOM toolbox in Matlab. A cross pattern with 1000 data points is taken as example. The results show that there are a large quantity of unnecessary neurons in Kohonen´s SOMs; whereas the resultant ESOM has much smaller size and better fitness to training input
Keywords
graph theory; learning (artificial intelligence); self-organising feature maps; Kohonen´s SOM toolbox; Kohonens self-organizing map; Matlab; dynamically growing neural network; edge differentiation; evolutionary self-organizing map; neighborhood graph; network differentiation; node differentiation; Artificial neural networks; Computer networks; Mathematical model; Mesh generation; Neural networks; Neurons; Organizing; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on
Conference_Location
Anchorage, AK
ISSN
1098-7576
Print_ISBN
0-7803-4859-1
Type
conf
DOI
10.1109/IJCNN.1998.682362
Filename
682362
Link To Document