ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

谱聚类×层次聚类×主成分分析×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份200219632002
提出者Ng, A. Y.; Jordan, M. I.; Weiss, Y.Ward, J. H.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
类型Graph-based clustering (spectral method)Unsupervised clustering (agglomerative)Unsupervised dimensionality reduction
开创性文献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. link ↗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 ↗
别名NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clusteringHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
相关543
摘要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.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.
ScholarGate数据集
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Spectral Clustering · Hierarchical Clustering · Principal Component Analysis. 于 2026-06-20 检索自 https://scholargate.app/zh/compare