Abstract
The self-organizing map is a prominent unsupervised neural network model which lends itself to the analysis of high-dimensional input data. However, the high execution times required to train the map put a limit to its application in many high-performance data analysis application domains, where either very large datasets are encountered and/or interactive response times are required.
In this paper we present the parSOM, a software-based parallel implementation of the self-organizing map, which is particularly optimized for the analysis of high-dimensional input data. This model scales well in a parallel execution environment, and, by coping with memory latencies, a better than linear speed-up can be achieved using a simple, asymmetric model of parallelization. We demonstrate the benefits of the proposed implementation in the field of text classification, which due to the high dimensionalities of the data spaces encountered, forms a prominent application domain for high-performance computing.
This is a preview of subscription content, log in via an institution to check access.
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
P. Adam, H. Essafi, M.-P. Gayrad, and M. Pic. High-performance programming support for multimedia document database management. In High Performance Computing and Networking, 1999.
G. DeBoeck and T. Kohonen. Visual Explorations in Finance. Springer Verlag, Berlin, Germany, 1998.
D. Hammerstrom. A VLSI architecture for high-performance, low-cost, on-chip learning. In International Joint Conference on Neural Networks, 1990.
T. Kohonen. Self-Organizing Maps. Springer Verlag, Berlin, Germany, 1995.
J. Liu and M. Brooke. A fully parallel learning neural network chip for real-time control. In International Joint Conference on Neural Networks, 1999.
A. Rauber. LabelSOM: On the labeling of self-organizing maps. In Proc. International Joint Conference on Neural Networks, Washington, DC, 1999.
A. Rauber and D. Merkl. Finding structure in text archives. In Proc. European Symp. on Artificial Neural Networks (ESANN98), Bruges, Belgium, 1998.
A. Rauber and D. Merkl. Using self-organizing maps to organize document collections and to characterize subject matters. In Proc. 10th Conf. on Database and Expert Systems Applications, Florence, Italy, 1999.
B. D. Ripley. Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge, UK, 1996.
G. Salton. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, Reading, MA, 1989.
O. Simula, P. Vasara, J. Vesanto, and R. R. Helminen. The self-organizing map in industry analysis. In L.C. Jain and V.R. Vemuri, editors, Industrial Applications of Neural Networks, Washington, DC., 1999. CRC Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tomsich, P., Rauber, A., Merkl, D. (2000). parSOM: Using Parallelism to Overcome Memory Latency in Self-Organizing Neural Networks. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive