Abstract
A novel clustering algorithm based upon a SOFM neural network family is proposed in this paper. The algorithm takes full advantage of the characteristics of SOFM Neural Network family and defines a novel similarity measure, topological similarity, which help the clustering algorithm to handle the clusters with arbitrary shapes and avoid suffering from the limitations of the conventional clustering algorithms. The paper suggests another novel thought to tackle the clustering problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hodge, V.J., Austin, J.: Hierarchical Growing Cell Structure: TreeGCS. IEEE transactions on knowledge and data engineering 13 (2001)
Han, J., Kamber, M.: Data Mining Concepts and Techniques. Morgan Kaufmann Publisher, San Francisco (2001)
Lin, S., Si, J.: Weight: Convergence and Weight Density of the Multi-dimensional SOFM Algorithm. In: Proceedings of the American Control Conference, Albuquerque, New Mexico (1997)
Kohonen, T.: Self-organizing Map. Springer, Heidelberg (1995)
Kohonen, T.: The Self-organizing Map. Proceedings of the IEEE 78, 1464–1480 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wen, J., Meng, K., Wu, H., Wu, Z. (2005). A Novel Clustering Algorithm Based upon a SOFM Neural Network Family. In: Wang, J., Liao, XF., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427445_12
Download citation
DOI: https://doi.org/10.1007/11427445_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25913-8
Online ISBN: 978-3-540-32067-8
eBook Packages: Computer ScienceComputer Science (R0)