Abstract
We propose a method to eliminate unnecessary neurons in Variable-Density Self-Organizing Map. We have defined an energy function which denotes the error of the map, and optimize the energy function by using graph cut algorithm. We conducted experiments to investigate the effectiveness of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kohonen, T.: Self-Organization and Associative Memory. Springer, Heidelberg (1989)
Kohonen, T.: Self-Organizing Maps. Springer Series in Information Science (1995)
Shimada, A., Taniguchi, R.-I.: Variable-Density Self-Organizing Map for Incremental Learning. In: The 5th Workshop On Self-Organizing Maps (WSOM 2007) (2007)
Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 1124–1137 (2004)
Kiviluoto, K.: Topology Preservation in Self-Organizing Maps. In: International Conference on Neural Networks (ICNN), pp. 294–299 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shimada, A., Taniguchi, Ri. (2009). Elimination of Useless Neurons in Incremental Learnable Self-Organizing Map. In: Príncipe, J.C., Miikkulainen, R. (eds) Advances in Self-Organizing Maps. WSOM 2009. Lecture Notes in Computer Science, vol 5629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02397-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-02397-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02396-5
Online ISBN: 978-3-642-02397-2
eBook Packages: Computer ScienceComputer Science (R0)