ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

鲁棒 K-均值聚类×聚类分析×
领域统计学统计学
方法族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/zh/compare