השוואת שיטות

	אשכול K-means	ניתוח רכיבים עיקריים
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1967 (formalized 1982)	2002
הוגה השיטה	MacQueen, J. B.; Lloyd, S. P.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
סוג	Partitional clustering	Unsupervised dimensionality reduction
מקור מכונן	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.
כינויים	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
קשורות	4	3
תקציר	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.