ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Robust K-means Clustering×Ανάλυση Συμπλεγμάτων×
ΠεδίοΣτατιστικήΣτατιστική
ΟικογένειαLatent structureLatent structure
Έτος προέλευσης19971939–1967
ΔημιουργόςCuesta-Albertos, Gordaliza & MatránRobert C. Tryon (early development); Ward (1963) for hierarchical; MacQueen (1967) for k-means
ΤύποςRobust partitional clusteringUnsupervised classification / grouping
Θεμελιώδης πηγή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 ↗Everitt, B. S., Landau, S., Leese, M. & Stahl, D. (2011). Cluster Analysis (5th ed.). Wiley. ISBN: 978-0470749913
Εναλλακτικές ονομασίεςtrimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clusteringclustering, unsupervised classification, data clustering, numerical taxonomy
Συναφείς45
Σύνοψη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.Cluster analysis is a family of unsupervised multivariate techniques that partition a set of objects or observations into internally homogeneous, mutually distinct groups — clusters — based on measured characteristics, without any prior knowledge of group membership. It is widely used in market segmentation, bioinformatics, psychology, and social science to reveal natural groupings in data.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Robust K-means Clustering · Cluster Analysis. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare