Author
Abstract
In classification self-organizing maps is used as a generalisation of the K-means method including a neighbourhood organization between clusters. The correspondence between this clusters organization and the input proximity is called the topology preservation. The aim of this paper is to measure, reduce and understand variability of SOM. Considering the property of topology preservation, a local approach of variability (at an individual level) is preferred to a global one. A complementary visualising tool, called Map of Distances between Classes (MDC), is presented to complete this local approach relating variability to the complexity of the data’s intrinsic structure. It basically allows the main information to be extracted from a very large matrix of distances between Self-Organizing Maps’ classes. In the presence of a complex structure, it enlarges the information set, linking the variability of acceptable representations to the data structure complexity. To reduce variability, a stochastic method based on a bootstrap process aims to increase the reliability of the induced neighbourhood structure. The resulting (robust) map, called R-Map, is more robust relative to the sensitivities of the outputs to the sampling method and to some of the learning options of the SOM’ algorithm (initialisation and order of data presentation). This method consists of selecting one map from a group of several solutions resulting from the same self-organizing map algorithm, but obtained with various inputs. The R-map can be perceived as the map, among the group of solutions, and corresponds to the most common interpretation of the data set structure. When an R-map can be perceived as the representative of a given SOM network, the relevance of the chosen network depends on R-map’s ability to adjust the data structure. As an application, a criterion to validate the network size is proposed comparing its ability of adjustment with SOM outputs of a larger network.
Suggested Citation
Patrick Rousset, 2006.
"Self organizing MAPS: understanding, measuring and reducing variability,"
Springer Books, in: Alfredo Rizzi & Maurizio Vichi (ed.), Compstat 2006 - Proceedings in Computational Statistics, pages 371-382,
Springer.
Handle:
RePEc:spr:sprchp:978-3-7908-1709-6_29
DOI: 10.1007/978-3-7908-1709-6_29
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-7908-1709-6_29. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.