Salīdzināt metodes

	Spektrālā klasterizācija	t-SNE
Nozare	Mašīnmācīšanās	Mašīnmācīšanās
Saime	Machine learning	Machine learning
Izcelsmes gads	2002	2008
Autors	Ng, A. Y.; Jordan, M. I.; Weiss, Y.	van der Maaten, L. & Hinton, G.
Tips	Graph-based clustering (spectral method)	Nonlinear dimensionality reduction (manifold visualization)
Pirmavots	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
Citi nosaukumi	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Saistītās	5	3
Kopsavilkums	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.	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.