2015
DOI: 10.1016/j.neucom.2013.12.059
|View full text |Cite
|
Sign up to set email alerts
|

Self-organizing maps with information theoretic learning

Abstract: The self organizing map (SOM) is one of the popular clustering and data visualization algorithms and has evolved as a useful tool in pattern recognition, data mining since it was first introduced by Kohonen. However, it is observed that the magnification factor for such mappings deviates from the information-theoretically optimal value of 1 (for the SOM it is 2/3). This can be attributed to the use of the mean square error to adapt the system, which distorts the mapping by oversampling the low probability regi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…The key of the SOM algorithm is to update the BMU and its neighborhood nodes concurrently. Input topology of dataset is preserved on the output nodes through performance of such a mapping [65]. Details of the implementation procedure of SOM are described in the Appendix A.…”
Section: Self-organizing Mapmentioning
confidence: 99%
“…The key of the SOM algorithm is to update the BMU and its neighborhood nodes concurrently. Input topology of dataset is preserved on the output nodes through performance of such a mapping [65]. Details of the implementation procedure of SOM are described in the Appendix A.…”
Section: Self-organizing Mapmentioning
confidence: 99%
“…To implement the SOM author uses Matlab Neural network toolbox [29]. More about the SOM and its learning algorithm can be found in the literature [40,41].…”
Section: Self-organizing Mapmentioning
confidence: 99%
“…Thus, if the BA attempts to process a large number of samples with high-dimensional feature space, it is difficult to maintain feasible computational time, and the likelihood calculation is highly unstable, and global convergence is difficult to achieve. 14 KBA applies KBR 15 instead of the general Bayes' Theorem in BA, and a Correntropy 16 -based alternative similarity measurement called CIM 17 to solve the primitive issues of Bayesian computation which are described above. However, due to the original idea of ART, any input is considered as useful data for clustering.…”
Section: Introductionmentioning
confidence: 99%