ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Clustering Ierarhic×t-SNE×
DomeniuÎnvățare automatăÎnvățare automată
FamilieMachine learningMachine learning
Anul apariției19632008
Autorul originalWard, J. H.van der Maaten, L. & Hinton, G.
TipUnsupervised clustering (agglomerative)Nonlinear dimensionality reduction (manifold visualization)
Sursa seminalăWard, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605. link ↗
Denumiri alternativeHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringt-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Înrudite43
RezumatHierarchical 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.
ScholarGateSet de date
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Hierarchical Clustering · t-SNE. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare