SOM of SOMs: An Extension of SOM from 'Map' to 'Homotopy'
نویسنده
چکیده
This paper proposes an extension of an SOM called the “SOM of SOMs,” or SOM, in which objects to be mapped are self-organizing maps. In SOM, each nodal unit of a conventional SOM is replaced by a function module of SOM. Therefore, SOM can be regarded as a variation of a modular network SOM (mnSOM). Since each child SOM module in SOM is trained to represent an individual map, the parent map in SOM generates a self-organizing map representing the continuous change of the child maps. Thus SOM is an extension of an SOM that generates a ‘self-organizing homotopy’ rather than a map. This extension of an SOM is easily generalized to the case of SOM, such that “SOM as SOM of SOMs”, corresponding to the n-th order of homotopy. This paper proposes a homotopy theory of SOM with new simulation results.
منابع مشابه
Data Clustering Analysis using Self-Organizing Maps with 3-D Output Grids
The self-organizing map (SOM) has been widely used as a software tool for visualization of high-dimensional data. Important SOM features include information compression while trying to preserve topological and metric relationship of the primary data items. The assumption of topological preservation in SOMs is not true for many data mappings involving dimension reduction. With the automation of ...
متن کاملModular Network SOM and Self-Organizing Homotopy Network as a Foundation for Brain-like Intelligence
In this paper, two generalizations of the SOM are introduced. The first of these extends the SOM to deal with more generalized classes of objects besides the vector dataset. This generalization is realized by employing modular networks instead of reference vector units and is thus called a modular network SOM (mnSOM). The second generalization involves the extension of the SOM from ‘map’ to ‘ho...
متن کاملMulti-SOM: an Algorithm for High-Dimensional, Small Size Datasets
ABSRACT Since it takes time to do experiments in bioinformatics, biological datasets are sometimes small but with high dimensionality. From probability theory, in order to discover knowledge from a set of data, we have to have a sufficient number of samples. Otherwise, the error bounds can become too large to be useful. For the SOM (SelfOrganizing Map) algorithm, the initial map is based on the...
متن کاملThe Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملGrowing 3D-SOMs with 2D-Input Layer as a Classification Tool in a Motion Detection System
This paper describes the employment of an 'Adaptive Growing Three-Dimensional Self-Organizing Map' for the classification of images. First a short description of growing SOMs is given and the fundamental advantages are mentioned. Then an extension of the original SOM from two to three dimensions with growing feature is presented. By means of some selected examples the general behavior of the al...
متن کامل