Machine learningMachine learning

Ensemble K-means

Ensemble K-means runs K-means clustering many times under varied initializations, random seeds, or feature subsets, then aggregates the resulting partitions into a single consensus assignment. This approach reduces K-means' well-known sensitivity to initialization and produces more stable, reproducible clusters than any single run.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  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

Related methods

Referenced by

ScholarGateEnsemble K-means (Ensemble K-means Clustering (Consensus Clustering)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/ensemble-k-means