ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Ensemble K-means×Semi-overvåget K-means×
FagområdeMaskinlæringMaskinlæring
FamilieMachine learningMachine learning
Oprindelsesår20022001–2002
OphavspersonStrehl, A. & Ghosh, J.Wagstaff, K. et al. (constrained); Basu, S. et al. (seeded)
TypeEnsemble clustering (consensus aggregation of K-means partitions)Semi-supervised clustering
Oprindelig kildeStrehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means Clustering with Background Knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML 2001), pp. 577–584. link ↗
Aliasserconsensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKMconstrained K-means, seeded K-means, partially supervised K-means, SS-K-means
Relaterede35
Resumé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.Semi-supervised K-means extends standard K-means clustering by incorporating partial supervision — either a small set of labeled seed points or pairwise must-link and cannot-link constraints — to guide cluster formation. It bridges unsupervised clustering and fully supervised classification, enabling more meaningful clusters when labels are scarce but costly to obtain in full.
ScholarGateDatasæt
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: Ensemble K-means · Semi-supervised K-means. Hentet 2026-06-18 fra https://scholargate.app/da/compare