ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Carte auto-organisatrice (Carte de Kohonen)×Regroupement par K-moyennes×
DomaineApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine19821967
Auteur d'origineTeuvo KohonenMacQueen, J.
TypeUnsupervised neural network for topology-preserving mappingPartitional clustering (centroid-based)
Source fondatriceKohonen, 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 ↗
AliasSOM, Kohonen map, Kohonen network, öz-örgütlemeli haritaK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Apparentées33
Résumé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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Self-Organizing Map · K-Means Clustering. Consulté le 2026-06-18 sur https://scholargate.app/fr/compare