Self-Organizing Maps 2010
DOI: 10.5772/9164
|View full text |Cite
|
Sign up to set email alerts
|

Learning the Number of Clusters in Self Organizing Map

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(17 citation statements)
references
References 20 publications
0
17
0
Order By: Relevance
“…In this process it is necessary redundancy in the input data in order for the ANN to be able to detect patterns in the inputs. This analysis is particularly effective in the detection and classification of the data relevant groups (clusters), especially when there is no prior knowledge about what is being studied (Cabanes and Bennani, 2010;Qiao and Han, 2010). A detailed description of SOM algorithm was given in Kohonen (2001), Chon et al (1996) and Park et al (2003).…”
Section: Analysis Of Resultsmentioning
confidence: 99%
“…In this process it is necessary redundancy in the input data in order for the ANN to be able to detect patterns in the inputs. This analysis is particularly effective in the detection and classification of the data relevant groups (clusters), especially when there is no prior knowledge about what is being studied (Cabanes and Bennani, 2010;Qiao and Han, 2010). A detailed description of SOM algorithm was given in Kohonen (2001), Chon et al (1996) and Park et al (2003).…”
Section: Analysis Of Resultsmentioning
confidence: 99%
“…The algorithm combines cluster analysis and sequential data mining to detect temporal re-occurrences in massive flows of data. 19 This kind of machine learning enables the machine to predict future occurrences once it detects sequences of events that are similar to previous occurrences. When using the algorithm for the Sensitive Assembly, we wanted to be able to predict the near future occurrences of the wall structure.…”
Section: Methodsmentioning
confidence: 99%
“…Each of them is good (or even optimal) under a number of conditions, but there are also disadvantages [2] is The Suffix Tree Clustering method [7] involves reprocessing the texts of documents. DS2L-SOM algorithm (Density-based Simultaneous Two-Level -SOM) presented in [8], the number of clusters obtained by various clustering methods (SSL = SOM+SingleLinkage, SKM = SOM+K-means). It is clear that the number of clusters is usually unknown factor that needs to be either stated by users based on their prior knowledge or expected in a certain way.…”
Section: Fig1 Sample Of Clustering Process (Proximity Matrix)mentioning
confidence: 99%