ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Robust k-means×DBSCAN×K-means Shlukování×
OborStrojové učeníStrojové učeníStrojové učení
RodinaMachine learningMachine learningMachine learning
Rok vzniku199919961967 (formalized 1982)
TvůrceGarcia-Escudero, L. A. & Gordaliza, A.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.MacQueen, J. B.; Lloyd, S. P.
TypRobust clustering algorithmDensity-based clustering algorithmPartitional clustering
Původní zdrojGarcia-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 ↗
Další názvyrobust k-means clustering, trimmed k-means, outlier-resistant k-means, RKMDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Příbuzné434
Shrnutí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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Robust k-means · DBSCAN · K-means. Získáno 2026-06-20 z https://scholargate.app/cs/compare