Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Odporne grupowanie hierarchiczne× | Klasteryzacja hierarchiczna× | |
|---|---|---|
| Dziedzina≠ | Statystyka | Uczenie maszynowe |
| Rodzina≠ | Latent structure | Machine learning |
| Rok powstania≠ | 1990 | 1963 |
| Twórca≠ | Kaufman & Rousseeuw (building on Ward, 1963 and others) | Ward, J. H. |
| Typ≠ | Robust unsupervised clustering | Unsupervised clustering (agglomerative) |
| Źródło pierwotne≠ | Kaufman, L. & Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley. ISBN: 978-0471878766 | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Inne nazwy≠ | robust agglomerative clustering, outlier-resistant hierarchical clustering, robust linkage clustering, RHC | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Pokrewne≠ | 5 | 4 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|