ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Αυτο-οργανωμένος χάρτης (Χάρτης Kohonen)×Συσταδοποίηση K-Means×
ΠεδίοΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης19821967
ΔημιουργόςTeuvo KohonenMacQueen, J.
ΤύποςUnsupervised neural network for topology-preserving mappingPartitional clustering (centroid-based)
Θεμελιώδης πηγήKohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43(1), 59–69. DOI ↗MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗
Εναλλακτικές ονομασίεςSOM, Kohonen map, Kohonen network, öz-örgütlemeli haritaK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Συναφείς33
ΣύνοψηA self-organizing map is an unsupervised neural network, introduced by Teuvo Kohonen in 1982, that projects high-dimensional data onto a low-dimensional (usually two-dimensional) grid of prototype vectors while preserving the data's topology — nearby inputs map to nearby grid cells. It is used for visualization, clustering, and exploratory analysis, turning complex data into an ordered, interpretable map.K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Self-Organizing Map · K-Means Clustering. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare