DocumentCode :
3846170
Title :
Graph Based Representations of Density Distribution and Distances for Self-Organizing Maps
Author :
Kadim Tasdemir
Author_Institution :
Department of Computer Engineering, Ya?ar University, Izmir, Turkey
Volume :
21
Issue :
3
fYear :
2010
fDate :
3/1/2010 12:00:00 AM
Firstpage :
520
Lastpage :
526
Abstract :
The self-organizing map (SOM) is a powerful method for manifold learning because of producing a 2-D spatially ordered quantization of a higher dimensional data space on a rigid lattice and adaptively determining optimal approximation of the (unknown) density distribution of the data. However, a postprocessing visualization scheme is often required to capture the data manifold. A recent visualization scheme CONNvis, which is shown effective for clustering, uses a topology representing graph that shows detailed local data distribution within receptive fields. This brief proposes that this graph representation can be adapted to show local distances. The proposed graphs of local density and local distances provide tools to analyze the correlation between these two information and to merge them in various ways to achieve an advanced visualization. The brief also gives comparisons for several synthetic data sets.
Keywords :
"Self organizing feature maps","Data visualization","Prototypes","Lattices","Network topology","Information analysis","Vector quantization","Shape","Inspection","Histograms"
Journal_Title :
IEEE Transactions on Neural Networks
Publisher :
ieee
ISSN :
1045-9227
Type :
jour
DOI :
10.1109/TNN.2010.2040200
Filename :
5395627
Link To Document :
بازگشت