Abstract
The self-organizing map is one of the most prominent unsupervised learning architectures used to visualize the similarities of high-dimensional input structures. What remains by no means straight-forward, is an explicit representation of cluster boundaries in the final two-dimensional map display. The detection of these boundaries rather requires some amount of insight into the inherent structure of the input data which may not be expected in real-world application scenarios. In this paper we address this deficiency by suggesting an extension to the standard map representation that leads to an easy recognition of cluster boundaries. The general idea is the visualization of clusters within the input data items by connecting units representing similar data items while disconnecting units representing dissimilar data items. As a result we get a grid of connected nodes where the intensity of the connection mirrors the similarity of the underlying data items. Such a representation allows intuitive analysis of the similarities inherent in the input data without the necessity of substantial prior knowledge, and an intuitive recognition of cluster boundaries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blackmore J. and Miikkulainen R. Incremental Grid Growing — Encoding high-dimensional structure into a two-dimensional feature map. Proc of the IEEE Int’l Conf on Neural Networks. San Francisco, CA. 1993.
Fritzke B. Growing Cell Structures — A self-organizing network for unsupervised and supervised learning. Neural Networks 7 (9). 1994.
Kohonen T. Self-Organization and Associative Memory. Springer Verlag, Berlin, Germany. 1989.
Martinetz T. Competitive Hebbian learning rule forms perfectly topology preserving map. Proc of the Int’l Conf on Artificial Neural Networks (ICANN’93) Amsterdam, The Netherlands, 1993.
Merkl D. The Effect of Lateral Inhibition on Learning Speed and Precision of a Self-Organizing Feature Map. Proc Australian Conf on Neural Networks. Sydney. Australia. 1995.
Miikkulainen R. Script Recognition with Hierarchical Feature Maps. Connection Science 2. 1990.
Rauber A. Cluster Visualization in Unsupervised Neural Networks. Diplomarbeit, Technische Universität Wien, Austria. 1996.
Wan W. and Fraser D. A Self-Organizing Neural Network for Contextual Analysis of Spatial Patterns of Multisource Data. Proc Conf on Digital Image Computing, Techniques and Applications. Sydney, Australia. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London Limited
About this paper
Cite this paper
Merkl, D., Rauber, A. (1998). Cluster Connections: A visualization technique to reveal cluster boundaries in self-organizing maps. In: Marinaro, M., Tagliaferri, R. (eds) Neural Nets WIRN VIETRI-97. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1520-5_35
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1520-5_35
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1522-9
Online ISBN: 978-1-4471-1520-5
eBook Packages: Springer Book Archive