Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Robust k-means× | DBSCAN× | Кластеризація методом k-середніх× | |
|---|---|---|---|
| Галузь | Машинне навчання | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning | Machine learning |
| Рік появи≠ | 1999 | 1996 | 1967 (formalized 1982) |
| Автор методу≠ | Garcia-Escudero, L. A. & Gordaliza, A. | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | MacQueen, J. B.; Lloyd, S. P. |
| Тип≠ | Robust clustering algorithm | Density-based clustering algorithm | Partitional clustering |
| Основоположне джерело≠ | 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 ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| Інші назви≠ | robust k-means clustering, trimmed k-means, outlier-resistant k-means, RKM | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| Пов'язані≠ | 4 | 3 | 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. | 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. | 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. |
| ScholarGateНабір даних ↗ |
|
|
|