A new tree-structured self-organizing map for data analysis

This paper presents a new algorithm for dynamical generation of a hierarchical structure of self-organizing maps (SOM) with applications to data analysis. Different from other tree-structured SOM approaches, in this case the tree nodes are actually maps. From top to down, maps are automatically segmented by using the U-matrix information, which presents relations between neighboring neurons. The automatic map partitioning algorithm is based on mathematical morphology segmentation and it is applied to each map in each level of the hierarchy. Clusters of neurons are automatically identified and labeled and generate new sub-maps. Data are partitioned accordingly the label of its best match unit in each level of the tree. The algorithm may be seen as a recursive partition clustering method with multiple prototypes cluster representation, which enables the discoveries of clusters in a variety of geometrical shapes