DocumentCode
445995
Title
Ranked centroid projection: a data visualization approach for self-organizing maps
Author
Yen, Gary G. ; Wu, Zheng
Author_Institution
Sch. of Electr. & Comput. Eng., Oklahoma State Univ., Stillwater, OK, USA
Volume
3
fYear
2005
fDate
31 July-4 Aug. 2005
Firstpage
1587
Abstract
The self-organizing map (SOM) is an efficient tool for visualizing high-dimensional data as it performs a topology-presenting projection of the input space on a low-dimensional grid. To utilize the information provided by the SOM and obtain an approximation of the data structure, a separate data projection method is usually needed. However, most of the SOM projection methods are computationally expensive when the size of the data set becomes large. In this paper, we present an intuitive and effective SOM projection method with comparatively low computational complexity for the purpose of cluster visualization. This method maps data vectors on the output space based on their responses to different prototype vectors. High-resolution maps can be obtained with a relatively small network size. The proposed method is demonstrated using both an artificial and a real world data set.
Keywords
data visualisation; self-organising feature maps; cluster visualization; computational complexity; data projection; data structure; data vector; data visualization; ranked centroid projection; self-organizing map; topology-presenting projection; Computational complexity; Control systems; Data structures; Data visualization; Intelligent control; Intelligent systems; Laboratories; Neurons; Prototypes; Self organizing feature maps;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 2005. IJCNN '05. Proceedings. 2005 IEEE International Joint Conference on
Print_ISBN
0-7803-9048-2
Type
conf
DOI
10.1109/IJCNN.2005.1556115
Filename
1556115
Link To Document