Self-organizing maps
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Bio-inspired Applications of Connectionism-Part II
Hi-index | 0.00 |
One of the most interesting features of self-organizing maps is the neighbourhood structure between classes highlighted by this technique. The aim of this paper is to present a stochastic method based on bootstrap process for increasing the reliability of the induced neighbourhood structure. The robustness under interest here concerns the sensitivities of the output to the sampling method and to some of the learning options (the initialisation and the order of data presentation). The presented method consists in selecting one map between a group of several solutions resulting from the same self-organizing map algorithm but with various inputs. The selected (robust) map, called R-map, can be perceived as the map, among the group, that corresponds to the most common interpretation of the data set structure.