Linganisha mbinu
Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.
| Robust k-means× | DBSCAN× | Ngeli ya Kiwango cha Juu (Hierarchical Clustering)× | |
|---|---|---|---|
| Nyanja | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine |
| Familia | Machine learning | Machine learning | Machine learning |
| Mwaka wa asili≠ | 1999 | 1996 | 1963 |
| Mwanzilishi≠ | Garcia-Escudero, L. A. & Gordaliza, A. | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Ward, J. H. |
| Aina≠ | Robust clustering algorithm | Density-based clustering algorithm | Unsupervised clustering (agglomerative) |
| Chanzo asilia≠ | 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. DOI ↗ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Majina mbadala≠ | robust k-means clustering, trimmed k-means, outlier-resistant k-means, RKM | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Zinazohusiana≠ | 4 | 3 | 4 |
| Muhtasari≠ | 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. | DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes. | 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. |
| ScholarGateSeti ya data ↗ |
|
|
|