ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Robusni k-means×Hijerarhijsko grupiranje×Grupna analiza K-means×
PodručjeStrojno učenjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learningMachine learning
Godina nastanka199919631967 (formalized 1982)
TvoracGarcia-Escudero, L. A. & Gordaliza, A.Ward, J. H.MacQueen, J. B.; Lloyd, S. P.
VrstaRobust clustering algorithmUnsupervised clustering (agglomerative)Partitional clustering
Temeljni izvorGarcia-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 ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
Drugi nazivirobust k-means clustering, trimmed k-means, outlier-resistant k-means, RKMHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Srodne444
SažetakRobust 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.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.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Robust k-means · Hierarchical Clustering · K-means. Preuzeto 2026-06-20 s https://scholargate.app/hr/compare