ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

K-means-klustring×Hierarkisk klustring×Analys av huvudkomponenter×
ÄmnesområdeMaskininlärningMaskininlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår1967 (formalized 1982)19632002
UpphovspersonMacQueen, J. B.; Lloyd, S. P.Ward, J. H.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TypPartitional clusteringUnsupervised clustering (agglomerative)Unsupervised dimensionality reduction
UrsprungskällaLloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗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 ↗
Aliask-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Närliggande443
SammanfattningK-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.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.
ScholarGateDatamängd
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: K-means · Hierarchical Clustering · Principal Component Analysis. Hämtad 2026-06-19 från https://scholargate.app/sv/compare