Ensemble K-means
Ensemble K-means kører K-means-clustering mange gange under varierende initialiseringer, tilfældige frø eller funktionssubset, aggregerer derefter de resulterende partitioner til en enkelt konsensus-tildeling. Denne tilgang reducerer K-means' velkendte følsomhed over for initialisering og producerer mere stabile, reproducerbare klynger end et enkelt kørselsresultat.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Ensemble K-means Clustering (Consensus Clustering). ScholarGate. https://scholargate.app/da/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.
- Ensemble Gaussian Mixture ModelMaskinlæring↔ compare
- K-means ClusteringMaskinlæring↔ compare
- Semi-overvåget K-meansMaskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →