2012
DOI: 10.1109/tnnls.2012.2190768
|View full text |Cite
|
Sign up to set email alerts
|

Data-Driven Cluster Reinforcement and Visualization in Sparsely-Matched Self-Organizing Maps

Abstract: A self-organizing map (SOM) is a self-organized projection of high-dimensional data onto a typically 2-dimensional (2-D) feature map, wherein vector similarity is implicitly translated into topological closeness in the 2-D projection. However, when there are more neurons than input patterns, it can be challenging to interpret the results, due to diffuse cluster boundaries and limitations of current methods for displaying interneuron distances. In this brief, we introduce a new cluster reinforcement (CR) phase … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 15 publications
0
11
0
Order By: Relevance
“…Here we propose to use a combination of unsupervised and supervised learning to improve function approximation performance in the case of functions defined on data that can be expected to reside on a low dimensional manifold embedded into a high dimensional space. To deal with the lack of information about the analytical form of the manifold, we use an over-complete self-organizing map (SOM) [19][20][21][22][23][24] to learn the topographic structure of the unknown manifold. Then we learn the approximation of a function defined over the node space of the SOM.…”
Section: Introductionmentioning
confidence: 99%
“…Here we propose to use a combination of unsupervised and supervised learning to improve function approximation performance in the case of functions defined on data that can be expected to reside on a low dimensional manifold embedded into a high dimensional space. To deal with the lack of information about the analytical form of the manifold, we use an over-complete self-organizing map (SOM) [19][20][21][22][23][24] to learn the topographic structure of the unknown manifold. Then we learn the approximation of a function defined over the node space of the SOM.…”
Section: Introductionmentioning
confidence: 99%
“…Such rule yields a unimodal weight distribution where the height of the plasticity window associated with STDP is modulated causing stability after a period of training. Other papers [41], [42], [43], [44] combines the self-organizing map (SOM)…”
Section: Discussionmentioning
confidence: 99%
“…Substantial results from the existing works illustrate that using metamodels to locate an optimum solution is often sufficiently accurate in many applications requiring prediction, optimisation and validation. Datadriven methods such as kriging [17], splines [18], support vector regression [19], self-organising maps [20], cluster reinforcement [21], and neural networks [22] are usual methods for metamodelling in complex system identification and pattern recognition. In this paper, the RBFNN is adopted, making use of such advantages [23] as good accuracy, simplicity, high robustness and efficiency, sample sizes, and capability of dealing with different problem types.…”
Section: Development Of Rbfnn Metamodelmentioning
confidence: 99%
“…Accordingly, the selection of the network centres can be made by taking the iteration number with different vectors ϕ k corresponding to the maximum value of M k defined in (21). To avoid the iteration process, this set can be assessed by the Gram matrix, P, as suggested in [38], where P is a symmetrical and orthogonal matrix of all the possible radial basis outputs for given training data used in the case of exact interpolation.…”
Section: Approach For Selection Of Radial Basis Centresmentioning
confidence: 99%