手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| スペクトラルクラスタリング× | 階層的クラスタリング× | 主成分分析× | |
|---|---|---|---|
| 分野 | 機械学習 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning | Machine learning |
| 提唱年≠ | 2002 | 1963 | 2002 |
| 提唱者≠ | 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 clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| 関連≠ | 5 | 4 | 3 |
| 概要≠ | 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データセット ↗ |
|
|
|