Linganisha mbinu

	Ramani inayojipanga Yenyewe (Ramani ya Kohonen)	K-Means Clustering	t-SNE
Nyanja	Ujifunzaji wa Mashine	Ujifunzaji wa Mashine	Ujifunzaji wa Mashine
Familia	Machine learning	Machine learning	Machine learning
Mwaka wa asili	1982	1967	2008
Mwanzilishi	Teuvo Kohonen	MacQueen, J.	van der Maaten, L. & Hinton, G.
Aina	Unsupervised neural network for topology-preserving mapping	Partitional clustering (centroid-based)	Nonlinear dimensionality reduction (manifold visualization)
Chanzo asilia	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.	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
Majina mbadala	SOM, Kohonen map, Kohonen network, öz-örgütlemeli harita	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Zinazohusiana	3	3	3
Muhtasari	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.	t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods.