ScholarGate
助手
Machine learningMachine learning

集成K均值

集成K均值通过在不同的初始化、随机种子或特征子集下多次运行K均值聚类,然后将得到的划分聚合为单一的共识分配。这种方法降低了K均值众所周知的对初始化的敏感性,并产生比单次运行更稳定、可复现的聚类。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

来源

  1. Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link
  2. Monti, S., Tamayo, P., Mesirov, J. & Golub, T. (2003). Consensus clustering: a resampling-based method for class discovery and visualization of gene expression microarray data. Machine Learning, 52, 91–118. DOI: 10.1023/A:1023949509487

如何引用本页

ScholarGate. (2026, June 3). Ensemble K-means Clustering (Consensus Clustering). ScholarGate. https://scholargate.app/zh/machine-learning/ensemble-k-means

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

被引用于

ScholarGateEnsemble K-means (Ensemble K-means Clustering (Consensus Clustering)). 于 2026-06-15 检索自 https://scholargate.app/zh/machine-learning/ensemble-k-means · 数据集: https://doi.org/10.5281/zenodo.20539026