Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| K-means-klustring× | Analys av huvudkomponenter× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1967 (formalized 1982) | 2002 |
| Upphovsperson≠ | MacQueen, J. B.; Lloyd, S. P. | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| Typ≠ | Partitional clustering | Unsupervised dimensionality reduction |
| Ursprungskälla≠ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| Alias | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. | 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. |
| ScholarGateDatamängd ↗ |
|
|