Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Robustní hierarchické shlukování× | Robustní K-means shlukování× | |
|---|---|---|
| Obor | Statistika | Statistika |
| Rodina | Latent structure | Latent structure |
| Rok vzniku≠ | 1990 | 1997 |
| Tvůrce≠ | Kaufman & Rousseeuw (building on Ward, 1963 and others) | Cuesta-Albertos, Gordaliza & Matrán |
| Typ≠ | Robust unsupervised clustering | Robust partitional clustering |
| Původní zdroj≠ | Kaufman, L. & Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley. ISBN: 978-0471878766 | Cuesta-Albertos, J. A., Gordaliza, A., & Matrán, C. (1997). Trimmed k-means: An attempt to robustify quantizers. The Annals of Statistics, 25(2), 553–576. DOI ↗ |
| Další názvy | robust agglomerative clustering, outlier-resistant hierarchical clustering, robust linkage clustering, RHC | trimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clustering |
| Příbuzné≠ | 5 | 4 |
| Shrnutí≠ | Robust hierarchical clustering extends classical agglomerative or divisive hierarchical clustering by replacing sensitive distance measures and linkage criteria with outlier-resistant alternatives, preserving cluster structure even when data contain anomalous observations or heavy-tailed distributions. | Robust K-means clustering is an extension of classical k-means that protects cluster estimates from distortion caused by outliers or contaminated observations. By trimming a user-specified fraction of the most extreme points before updating cluster centers, the algorithm yields stable, meaningful partitions even when the data contain atypical cases that would severely bias standard k-means. |
| ScholarGateDatová sada ↗ |
|
|