Graph Based Representations of Density Distribution and Distances for Self-Organizing Maps
Loading...

Date
2010
Authors
Kadim Tasdemir
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
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.
Description
ORCID
Keywords
Graph representation, self-organizing maps (SOMs), topology, visualization, DATA PROJECTION, NETWORKS, Self-Organizing Maps (SOMs), Visualization, Graph Representation, Topology, Computer Graphics, Humans, Computer Simulation, Signal Processing, Computer-Assisted, Neural Networks, Computer, Algorithms
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Scopus Q

OpenCitations Citation Count
24
Source
IEEE Transactions on Neural Networks
Volume
21
Issue
3
Start Page
520
End Page
526
PlumX Metrics
Citations
CrossRef : 22
Scopus : 24
PubMed : 2
Captures
Mendeley Readers : 21
Google Scholar™


