ScholarGate
助手

方法对比

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

鲁棒层次聚类×层次聚类×
领域统计学机器学习
方法族Latent structureMachine learning
起源年份19901963
提出者Kaufman & Rousseeuw (building on Ward, 1963 and others)Ward, J. H.
类型Robust unsupervised clusteringUnsupervised clustering (agglomerative)
开创性文献Kaufman, L. & Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley. ISBN: 978-0471878766Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗
别名robust agglomerative clustering, outlier-resistant hierarchical clustering, robust linkage clustering, RHCHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
相关54
摘要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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Robust Hierarchical Clustering · Hierarchical Clustering. 于 2026-06-19 检索自 https://scholargate.app/zh/compare