Salīdzināt metodes

	Pašorganizējošā karte (Kohonena karte)	K-Means klasterizācija	Lokāli lineārā iegulšana (LLE)
Nozare	Mašīnmācīšanās	Mašīnmācīšanās	Mašīnmācīšanās
Saime	Machine learning	Machine learning	Machine learning
Izcelsmes gads	1982	1967	2000
Autors	Teuvo Kohonen	MacQueen, J.	Sam Roweis & Lawrence Saul
Tips	Unsupervised neural network for topology-preserving mapping	Partitional clustering (centroid-based)	Nonlinear manifold dimensionality reduction
Pirmavots	Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43(1), 59–69.	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.	Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323–2326.
Citi nosaukumi	SOM, Kohonen map, Kohonen network, öz-örgütlemeli harita	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	LLE, manifold learning, nonlinear dimensionality reduction, yerel doğrusal gömme
Saistītās	3	3	3
Kopsavilkums	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.	Locally linear embedding, introduced by Sam Roweis and Lawrence Saul in 2000, is a manifold-learning method for nonlinear dimensionality reduction. It assumes that although data may curve through a high-dimensional space, each point and its neighbours lie approximately on a flat patch. LLE captures each point as a weighted combination of its neighbours and then finds a low-dimensional layout that preserves those same local relationships, unrolling curved structure into a faithful low-dimensional map.