পদ্ধতির তুলনা করুন

	দৃঢ় কে-মিনস (Robust k-means)	Hierarchical Clustering
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1999	1963
প্রবর্তক	Garcia-Escudero, L. A. & Gordaliza, A.	Ward, J. H.
ধরন	Robust clustering algorithm	Unsupervised clustering (agglomerative)
মৌলিক উৎস	Garcia-Escudero, L. A., & Gordaliza, A. (1999). Robustness properties of k-means and trimmed k-means. Journal of the American Statistical Association, 94(447), 956–969.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
অপর নাম	robust k-means clustering, trimmed k-means, outlier-resistant k-means, RKM	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
সম্পর্কিত	4	4
সারসংক্ষেপ	Robust k-means is a variant of classical k-means clustering designed to resist the influence of outliers. By trimming a specified fraction of the most extreme observations before computing cluster centers, it produces stable and meaningful partitions even when the data contain noise, contamination, or heavy-tailed distributions — situations where standard k-means breaks down.	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.