2009
DOI: 10.1109/tnn.2008.2005409
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Data Topology in Visualization and Clustering of Self-Organizing Maps

Abstract: The self-organizing map (SOM) is a powerful method for visualization, cluster extraction, and data mining. It has been used successfully for data of high dimensionality and complexity where traditional methods may often be insufficient. In order to analyze data structure and capture cluster boundaries from the SOM, one common approach is to represent the SOM's knowledge by visualization methods. Different aspects of the information learned by the SOM are presented by existing methods, but data topology, which … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
76
0
1

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
2
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 156 publications
(77 citation statements)
references
References 18 publications
0
76
0
1
Order By: Relevance
“…2, left, except for one, have at most 3 neighbors. We see this from the numbers of connections to Voronoi neighbors (pairs of BMUs and second BMUs formed by weights and their Voronoi neighbors) [17], shown in the order of the most to least connected, in Table 1. The connection strength (the number of data samples selecting a weight and its Voronoi neighbor as a pair of BMU and second BMU) between the one weight that has a fourth neighbor, and that fourth most connected neighbor is 1 (negligible).…”
Section: Two Modes Of the Som During Supervised Learningmentioning
confidence: 86%
“…2, left, except for one, have at most 3 neighbors. We see this from the numbers of connections to Voronoi neighbors (pairs of BMUs and second BMUs formed by weights and their Voronoi neighbors) [17], shown in the order of the most to least connected, in Table 1. The connection strength (the number of data samples selecting a weight and its Voronoi neighbor as a pair of BMU and second BMU) between the one weight that has a fourth neighbor, and that fourth most connected neighbor is 1 (negligible).…”
Section: Two Modes Of the Som During Supervised Learningmentioning
confidence: 86%
“…The robustness of SOM clustering method could be associated with its characterized non-linear projection from the higher dimensional space of inputs to a low dimensional grid, which facilitates the discovery of hidden patterns in the input data (Kohonen and Honkela, 2007;Moghimidarzi et al, 2016). The SOM proved to be able to handle large datasets with outliers effectively (Shahreza et al, 2011;Oyana et al, 2012), and it has been applied successfully in complex structures (Tasdemir and Merényi, 2009).…”
Section: Self-organizing Mapsmentioning
confidence: 99%
“…However, as more focus is placed on cooperation processes, it becomes more difficult to visualize class structure or class boundaries, since cooperation processes have roles to diminish discontinuity between neurons related to class boundaries. Though several methods have been developed to measure and extract discontinuity on the output space [30], [31], it is still difficult to extract clear class structure.…”
Section: B Information-theoretic Sommentioning
confidence: 99%