Kohonen Feature Maps and Growing Cell Structures - a Performance Comparison
Bernd Fritzke · 1992
A performance comparison of two self-organizing networks, the Kohonen Feature Map and the recently proposed Growing Cell Structures is made. For this purpose several performance criteria for self-organizing networks are proposed and motivated. The models are tested with three example problems of increasing difficulty. The Kohonen Feature Map demonstrates slightly superior results only for the simplest problem. For the other more difficult and also more realistic problems the Growing Cell Structures exhibit significantly better performance by every criterion. Additional advantages of the new model are that all parameters are constant over time and that size as well as structure of the network are determined automatically. 1 INTRODUCTION Self-organizing networks are able to generate interesting low-dimensional representations of high-dimensional input data. The most well-known of these models is the Kohonen Feature Map (Kohonen [1982]). So far it has been applied to a large variety of ...