השוואת שיטות

	K-means מקוון	אשכול היררכי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1967 (online update rule); 2010 (mini-batch variant)	1963
הוגה השיטה	MacQueen, J. (batch); Sculley, D. (mini-batch web-scale variant)	Ward, J. H.
סוג	Unsupervised clustering (online/streaming)	Unsupervised clustering (agglomerative)
מקור מכונן	MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, pp. 281–297. University of California Press.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
כינויים	sequential k-means, streaming k-means, incremental k-means, online clustering	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
קשורות	4	4
תקציר	Online K-means is a streaming variant of the classical K-means algorithm that updates cluster centroids one observation at a time — or in small mini-batches — without storing the entire dataset in memory. It is particularly suited to large-scale, real-time, or continuously arriving data where batch recomputation would be too slow or impractical.	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.