Jämför metoder

	Hierarkisk klustring	t-SNE
Ämnesområde	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning
Ursprungsår	1963	2008
Upphovsperson	Ward, J. H.	van der Maaten, L. & Hinton, G.
Typ	Unsupervised clustering (agglomerative)	Nonlinear dimensionality reduction (manifold visualization)
Ursprungskälla	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
Alias	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Närliggande	4	3
Sammanfattning	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.	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.