ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

אשכול היררכי×ניתוח רכיבים עיקריים×UMAP×
תחוםלמידת מכונהלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learningMachine learning
שנת המקור196320022018
הוגה השיטהWard, J. H.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)McInnes, L.; Healy, J.; Melville, J.
סוגUnsupervised clustering (agglomerative)Unsupervised dimensionality reductionNonlinear manifold-learning dimension reduction
מקור מכונןWard, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗
כינוייםHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transformUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction
קשורות435
תקציר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.Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.UMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.
ScholarGateמערך נתונים
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Hierarchical Clustering · Principal Component Analysis · UMAP. אוחזר בתאריך 2026-06-19 מתוך https://scholargate.app/he/compare