방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 로버스트 k-평균× | K-means 군집화× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1999 | 1967 (formalized 1982) |
| 창시자≠ | Garcia-Escudero, L. A. & Gordaliza, A. | MacQueen, J. B.; Lloyd, S. P. |
| 유형≠ | Robust 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 ↗ | 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 | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| 관련 | 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. | 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데이터셋 ↗ |
|
|